Before jumping directly into the patterns, please revise the following data structures.

1. Arrays

2. ArrayList

3. LinkedList

4. Stack

5. Queue

6. HashMap

7. HashSet

8. Trie

Important patterns to remember for DSA interviews

1. Two Pointers

2. Sliding Window

3. Modified Binary Search

4. Bitwise XOR

5. Fast & Slow Pointers

6. In-place Reversal of Linked List

7. Matrix Traversal

8. Merge Intervals

9. Tree BFS

10. Tree DFS

11. Cyclic Sort

12. Backtracking

13. Subsets

14. Top ‘K’ Elements

15. Two Heaps

16. K-way Merge

17. Topological Sort

18. Monotonic Stack

19. Dynamic Programming

Thank you for reading!

You can support me by buying me a book.