Problem Statement
Given a sorted array where:
Every element appears exactly twice.
Only one element appears once.
Find the single element in O(log N) time and O(1) space.
Related reading
Majority Element - I
Given an array of size n, find the element that appears more than n/2 times. ...
Find the Duplicate Number
Problem Statement Given an array nums containing n + 1 integers where: Each integer is...
Majority Element II
Given an integer array nums, return all elements that appear more than ⌊n/3⌋ times. Key...
Kth Largest Element | Heaps
Problem Statement Given an integer array nums and an integer k, return the kth largest...
Leetcode 150 | Day 4: Majority Element - Naive vs. Optimized
Leetcode 169 asks us to identify the majority element in a given array. The majority element is...
Removing Duplicates from a integer list (Easy) | LeetCode Practice #7
Remove Duplicates From Sorted Array Given an integer array nums sorted in non-decreasing...