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

Skills for tackling LeetCode problems - Tree Depth First Search. We can use recursion or a stack for iteration to keep t

Skills for tackling LeetCode problems - Tree Breadth First Search. BFS can efficiently solve problems involving the trav

Skills for tackling LeetCode problems - Inplace Reversal of a Linked List. Inplace reversal is an efficient approach to

Skills for tackling LeetCode problems - Merge Intervals. This approach is usually used to deal with overlapping interval

Skills for tackling LeetCode problems - Cyclic Sort. Problem statement: You are given an unsorted array containing n num