44 Majority Element

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: 3 Example 2: Input: nums = [2,2,1,1,1,2,2] Output: 2 #datastructures , #algorithms , #binarysearch , #RotatedArray, #sortingalgorithms , #SearchingAlgorithms, #Arrays, #LinkedLists, #Stacks, #Queues, #Trees, #BinaryTrees, #Graphs, #DynamicProgramming, #Recursion, #Hashing, #Heaps, #divideandconquer , #TwoPointerApproach, #SlidingWindowTechnique, #GreedyAlgorithms, #Backtracking, #GraphAlgorithms, #StringAlgorithms, #advanceddatastructures , #ComplexityAnalysis, #ProblemSolving, #InterviewPreparation, #geeksforgeeks , #FAANG, #MAANG, #leetcodechallenge, #blind75, #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa