~/lc-grind

Design a data structure that supports O(1) average time complexity for insert, remove, and retrieving a random element with equal probability, using a combination of a hash map and a dynamic array.

Maximize your academic impact by calculating the h-index, the largest number `h` where at least `h` papers have at least `h` citations each.

Master the greedy BFS technique to find the minimum jumps needed to traverse an array where each element dictates your maximum jump length.

Maximize your profit by buying and selling stocks multiple times, capturing every possible price increase in the array with a simple greedy approach.

Master the art of rotating an array to the right by k steps in-place with a clever three-reversal technique, a classic problem that elegantly combines array manipulation and two-pointer skills.

Efficiently find the element that appears more than ⌊n/2⌋ times in an array using sorting, hashing, or the optimal Boyer-Moore Voting Algorithm.

Master the two-pointer technique to efficiently remove duplicates in-place, allowing each element to appear at most twice while preserving the sorted order.

Use two pointers to efficiently remove duplicates in-place from a sorted array, returning the count of unique elements while preserving their original order.

Efficiently remove all instances of a given value from an array in-place using a two-pointer technique, returning the count of remaining elements.

Efficiently merge two sorted arrays into `nums1` in-place using a clever two-pointer technique that starts from the end to avoid overwriting.