Introduction

The collection of problem-solving techniques for coding interview:

• Sliding Window Fixed Size
• Sliding Window Dynamic Size
• Two Pointers
• Tree: Depth First Search
• Tree: Breadth First Search
• Tree: Heaps
• Tree: Trie
• Graph: DFS on Matrix
• Graph: DFS on Undirected Graph
• Graph: Topological Sort
• Linked List: In-place Reversal
• Linked List: Fast and Slow Pointers
• Binary Search in Sorted Array
• Binary Search in Implicitly Sorted Array
• Backtracking: Subsets
• Backtracking: Combinations
• Backtracking: Permutations
• Intervals