Given an array nums of size n, return the majority element.The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Example 1:Input: nums = [3,2,3]Output: 3Example 2:Input: nums = [2,2,1,1,1,2,2]Output: 2 Constraints:n == nums.length1 <= n <= 5 * 104-109 <= nums[i] <= 109 Follow-up: Could you solve the problem in linear time and in O(1) space?

Given an array nums of size n, return the majority element.The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Saran wants to develop a program that uses linear search to find the majority element in an array, which is an element appearing more than n-2 times, where n is the size of the array. The program should input the size of the array and its elements. Display the majority element if found, and indicate if no majority element is present in the array.Help Saran in developing the program.Input format :The first line of input consists of an integer n, representing the number of elements in the array.The second line consists of n space-separated integers, representing the array elements.Output format :The output prints an integer representing the majority element.If no such element is found, print "No majority element found."Refer to the sample output for formatting specifications.Code constraints :1 ≤ n ≤ 101 ≤ array elements ≤ 100Sample test cases :Input 1 :51 4 1 1 1Output 1 :1Input 2 :

Write the codeGiven a list of elements, find the majority element, which appears more than half the times (> floor(len(lst) / 2.0)).You can assume that such an element exists.For example,given : [1, 2, 1, 1, 3, 4, 0,1],return : Nonesimple input 0 : 1,1,1,1,1,1,2,2,2,3simple output 0 : 1simple input 1 : 1,1,2,2,2,3,3simple input 1 : NoneSample Test CasesTest Case 1:Expected Output:Enter·list·of·Elements:·1,1,1,1,11Test Case 2:Expected Output:Enter·list·of·Elements:·1,1,1,1,2,2,2,3,3None

Let T[n] be an array of n elements. An element x is said to be a majority element in T if the number of i's such that T[i] = x  is greater than  n/2. Design an algorithm that can decide whether an array T[1..n]  includes a majority element and if so find it when the only comparisons allowed between elements are tests of equality. So you cannot assume that an order relationship exists between the elements. What is the time complexity of your algorithm?a. O( n^2 ) b.Nonec.O( n^3 )d.O( n log n )

You are given an array of positive integers nums.Return the number of subarrays of nums, where the first and the last elements of the subarray are equal to the largest element in the subarray. Example 1:Input: nums = [1,4,3,3,2]Output: 6Explanation:There are 6 subarrays which have the first and the last elements equal to the largest element of the subarray:subarray [1,4,3,3,2], with its largest element 1. The first element is 1 and the last element is also 1.subarray [1,4,3,3,2], with its largest element 4. The first element is 4 and the last element is also 4.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.subarray [1,4,3,3,2], with its largest element 2. The first element is 2 and the last element is also 2.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.Hence, we return 6.Example 2:Input: nums = [3,3,3]Output: 6Explanation:There are 6 subarrays which have the first and the last elements equal to the largest element of the subarray:subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.Hence, we return 6.Example 3:Input: nums = [1]Output: 1Explanation:There is a single subarray of nums which is [1], with its largest element 1. The first element is 1 and the last element is also 1.Hence, we return 1. Constraints:1 <= nums.length <= 1051 <= nums[i] <= 109