Several coding patterns for solving data structures and algorithms problems during interviews

Pattern 1: Sliding Window	Pattern 9: Two Heaps
Pattern 2: Two Pointer	Pattern 10: Subsets
Pattern 3: Fast & Slow pointers	Pattern 11: Modified Binary Search
Pattern 4: Merge Intervals	Pattern 12: Bitwise XOR
Pattern 5: Cyclic Sort	Pattern 13: Top 'K' Elements
Pattern 6: In-place Reversal of a LinkedList	Pattern 14: K-way merge
Pattern 7: Tree Breadth First Search	Pattern 15: 0/1 Knapsack (Dynamic Programming)
Pattern 8: Depth First Search (DFS)	Pattern 16: Topological Sort (Graph)

All credits: Chanda-Abdul