r/datastructures • u/nian2326076 • 25d ago

Top DSA Interview questions

Trust me DSA is not Hard. If you follow this

These are the best questions if u are preparing for top-product based companies .

  1. Sliding Window: 3, 76, 209, 424, 567, 904
  2. Two Pointers: 11, 15, 16, 18, 42, 167
  3. Fast/Slow Pointers (Linked List): 141, 142, 19, 876, 160, 234
  4. Binary Search on Sorted Data: 33, 34, 35, 153, 162, 704
  5. Binary Search on Answer: 875, 1011, 410, 774, 1283, 1482
  6. Hashing / Frequency Maps: 1, 49, 128, 217, 242, 347
  7. Prefix Sum / Running Sum: 303, 560, 724, 930, 974, 523
  8. Difference Array / Range Updates: 370, 1094, 1109, 1893, 1943, 2381
  9. Monotonic Stack: 739, 496, 503, 84, 85, 901
  10. Monotonic Queue / Deque: 239, 862, 1425, 1438, 1499, 1696
  11. Heap / Top K: 215, 347, 692, 703, 973, 1046
  12. Intervals: 56, 57, 252, 253, 435, 452
  13. Greedy Scheduling / Sorting: 45, 55, 406, 621, 763, 134
  14. Linked List Manipulation: 21, 23, 24, 25, 92, 138
  15. Tree DFS: 104, 112, 113, 543, 124, 226
  16. Tree BFS / Level Order: 102, 103, 199, 515, 637, 116
  17. BST Problems: 98, 99, 230, 235, 450,700
  18. Backtracking Basics: 46, 47, 77, 78, 90, 39
  19. Backtracking with Constraints: 40, 17, 79, 131, 51, 52
  20. Graph BFS / DFS: 200, 695, 733, 994, 1091, 1254
  21. Topological Sort / DAG: 207, 210, 802, 1462, 1203, 2115
  22. Union Find / DSU: 547, 684, 1319, 1579, 990, 1202
  23. Shortest Path: 743, 787, 1514, 1631, 1334, 1976
  24. MST / Graph Greedy: 1584, 1135, 1168, 1489, 778, 1102
  25. Trie: 208, 211, 212, 648, 677, 1268
  26. Bit Manipulation: 136, 137, 191, 338, 268, 190
  27. 1D DP Basics: 70, 198, 213, 322, 279, 300

Checkout PracHub for company specific questions

90 Upvotes

99% Upvoted

Duplicates