518. Coin Change 2 (DP) (Medium)
1472. Design Browser History(Design) (Medium)
1471. The k Strongest Values in an Array(Priority Queue) (Medium)
1470. Shuffle the Array (Two Pointers) (Easy)
231. Power of Two (Bit manipulation) (Easy)
528. Random Pick with Weight (Math) (Medium)
392.Is Subsequence (Two_Pointer/DP/Greedy) (Easy) (Unresolved)
35. Search Insert Position (Two_Pointer/Binary_Search) (Easy)
75. Sort Colors (Sort/Two_Pointer) (Medium) (Unresolved)
380. Insert Delete GetRandom O(1) (Design) (Medium) (Unresolved)
1480. Running Sum of 1d Array (Array) (Prefix Sum) (Easy)
1481. Least Number of Unique Integers after K Removal (Binary Search) (Hashtable) (Medium)(Unresolved)
368. Largest Divisible Subset (DP) (Math) (Medium) (Unresolved)
787. Cheapest Flights Within K Stops (Graph) (Dijkstra/Bellman-Ford) (Shortest Path) (Medium) (Unresolved)
700. Search in a Binary Search Tree (Tree) (Shortest Path) (Easy)
468. Validate IP Address (Divide & Conquer) (Regular Expression) (Medium)
130. Surrounded Regions (DFS/BFS) (Shortest Path) (Medium) (Unresolved)
275. H-Index II (Tree) (Binary Search) (Medium) (Unresolved)
1044. Longest Duplicate Substring (Binary Search) (Rabin-Karp) (Hard) (Unresolved)
60. Permutation Sequence (Math) (Back-tracking) (Medium) (Unresolved)
1486. XOR Operation in an Array (Bit) (Easy) (Unresolved)
1487. Making File Names Unique (Medium) (Unresolved)
1488. Avoid Flood in The City (TreeSet) (Medium) (Unresolved)
174. Dungeon Game (DP) (Back-tracking) (Hard) (Unresolved)
137. Single Number II (Bit) (HashMap) (Medium) (Unresolved)
222. Count Complete Tree Nodes (Tree) (Binary Search) (Medium)
96. Unique Binary Search Trees (DP) (Tree) (Medium)
287. Find the Duplicate Number (Binary Seach) (Cycle Detection in LinkedList) (Floyd's tortoise and hare) (Medium) (Unresolved)