07-03 [LeetCode][1631. Path With Minimum Effort] 3 Approaches: BFS(Dijkstra), Binary Search, Union Find
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-18 [LeetCode][199. Binary Tree Right Side View] 2 Approaches: DFS and BFS with Detailed Explanation