06-29 LeetCode 406. Queue Reconstruction by Height Pattern of Data Pairs Problem: Sorting First then Greedy
06-25 LeetCode 191. Number of 1 Bits 6 Approaches: Cycle, API, Divide and Conquer, Low Bit, Bit Set, Recursion
06-22 LeetCode 215. Kth Largest Element in an Array 3 Approaches: Sorting, Priority Queue and Divide and Conquer
06-21 LeetCode 1642. Furthest Building You Can Reach Priority Queue + Greedy: Consider Ladder as a One-time Unlimited Bricks
06-11 LeetCode 1834. Single-Threaded CPU How to Maintain the Enqueued Tasks? | Sorting the array then Priority Queue | minHeap