[T-5] Programming Problem (Medium, 6 Points): Write a function which takes an array and prints its majority element if it exists. A majority element in an array A[] of size n is an element that appears more than n/2 times. Can you do it in O(n) time and O(1) space complexities?
0
0
0
0
0