All Posts

1276 articles

dsa1 min read

Find a peak element in O(log n) by binary searching on the slope direction — always move toward the higher neighbor.

March 19, 2026Read →

dsa1 min read

Find the missing number in [0..n] using the Gauss sum formula or XOR in O(n) time O(1) space.

March 19, 2026Read →

dsa2 min read

Find all elements appearing more than n/3 times using Extended Boyer-Moore Voting with two candidate trackers.

March 19, 2026Read →

dsa1 min read

Rearrange an array so nums[0] < nums[1] > nums[2] < nums[3]... using virtual index mapping and nth_element for O(n) time.

March 19, 2026Read →

dsa1 min read

Compress a sorted unique integer array into the smallest sorted list of range coverage strings.

March 19, 2026Read →

Page 14 of 256