169. Majority Element - Easy

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:
Input: nums [3,2,3]

Output: 3

Constraints:

  • n == nums.length;
  • 1 <= n <= 5 * 10**4
  • -10**9 <= nums[i] <= 10**9
Solution:
var majorityElement = function(nums) {
    const sortedNums = nums.sort();
    return sortedNums.length > 1 ? sortedNums[Math.floor(nums.length / 2)] : sortedNums[0];
}

Thoughts:
Got the answer pretty quickly but struggled to pass the last couple test cases for a while so thats when I had to use the if statement to check the length of the array is greater than 1 or else we can just return the first index value as the answer. I believe it solves the problem in linear time and 0(1) space because sorted it is in 0(n) and then because its an array we can do 0(1) lookup. I'd give my confidence rating a 7.5/10 out of 10.

Comments

Post a Comment

Popular posts from this blog

27. Remove Element - Easy

 Given an integer array of nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val. Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things:     Change the array nums such that the first k elements of nums contain the elements which are not equal to val. The remaining elements of nums are not important as well as the size of nums. Return k Example: Input: nums = [3,2,2,3], val = 3 Output: 2, nums = [2,2,_,_] Explanation: Your function should return k = 2, with the first two elements of nums being 2. It does not matter what you leave beyond the returned k (hence they are underscores). Constraints: 0 <= nums.length <= 100 0 <= nums[i] <= 50 0 <= val <= 100 Solution: var removeElement = function(nums, val) {     let index = 0;      ...
Read more

55. Jump Game - Medium

 You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last index or false otherwise. Example: Input: nums = [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index. Example 2: Input: nums = [3,2,1,0,4] Output: false Explanation: You will always arrive at index 3 no matter wht. Its maximum jump length is 0, which makes it impossible to reach the last index. Constraints: 1 <= nums.length <= 10**4 0 <= nums[i] <= 10**5 Solution: var canJump = function(nums) {     let goal = nums.length - 1;     for (let i = nums.length - 2; i >= 0; i--) {          if (i + nums[i] >= goal) {               goal = i;          }     return goal === 0; } Thoughts: Too diff...
Read more

26. Remove Duplicates from Sorted Array - Easy

Given an integer array nums sorted in non-decreasing order, remove the duplicates in place such that each unique element appears only once. The relative order of the elements should be kept the same. Then, return the number of unique elements in nums. Consider the number of unique elements of nums to be k. To get accepted, you need to do the following things: Change the array nums such that the first k elements of nums contain the unique elements in the order they were present in nums initially. The remaining elements of nums are not important as well as the size of nums. Return k; Example: Input: nums = [1,1,2] Output: 2, nums = [1,2,_] Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2, respectively. It does not matter what you leave beyond the returned k (hence, they are underscores). Constraints: 1 <= nums.length <= 3 * 10**4 -10**4 <= nums[i] <= 10**4 nums is sorted in non-decreasing order Solution: var removeDuplicates = ...
Read more