Zendesk Associate Developer Interview Question 2024 March | Arrays | on-campus

Question 1: Majority Element Problem Statement 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. Can you solve it in O(n) time and O(1) space? Constraints n == nums.length 1 <= n <= 5 x 104 -109 <= nums[i] <= 109 The majority element always exists in the array Examples Example 1: ...