Dynamic Programming - 0/1 Knapsack. Dynamic Programming has two characteristics: 1) overlapping subproblems 2) optimal s

Solution to LeetCode 2034 Stock Price Fluctuation LeetCode 2034Stock Price Fluctuation (Medium). [link] Use a HashMap to

Skills for tackling LeetCode problems - Topological Sort (Graph). Topological Sort is used to find a linear ordering of

Solution to LeetCode 1332 Remove Palindromic Subsequences. LeetCode 1332Remove Palindromic Subsequences (Easy). [link] A

Skills for tackling LeetCode problems - 0/1 Knapsack. 0/1 Knapsack can be efficiently solved by Memoization and Bottom-U

Skills for tackling LeetCode problems - K-Way Merge. We can use Min Heap to make a sorted traversal of all elements in m

Skills for tackling LeetCode problems - Heap for Top K Numbers. Heap can be used to efficiently solve problems dealing w

Skills for tackling LeetCode problems - Bitwise XOR. XOR is a logical bitwise operator that returns 0 (false) if both bi

Skills for tackling LeetCode problems - Modified Binary Search. Binary search can be used to find a certain element in a

Skills for tackling LeetCode problems - BFS for Subsets. BFS is efficient to deal with permutations and combinations of

Solution to LeetCode 1220 Count Vowels Permutation. LeetCode 1220Count Vowels Permutation (Hard). [link] Dynamic Progra

Skills for tackling LeetCode problems - Two Heaps. Two heaps pattern is efficient in finding the smallest element in one