DSA Last-Minute Revision Sheet for Campus Interviews

Pattern Checklist

Two pointers, sliding window max sum, binary search variants, BFS/DFS templates, topological sort Kahn, Dijkstra basics, DP knapsack LCS LIS, union find, trie prefix, heap top K.

Complexity Quick Reference

Sort O(n log n), hash map ops O(1) average, BST operations O(log n) balanced, graph BFS DFS O(V+E). State complexities aloud in interview unprompted.

48-Hour Schedule

Day 1: revisit 15 previously missed medium problems. Day 2: 3 timed random mediums morning, light pattern notes afternoon, early sleep. No all-nighter coding.

Interview Day Mindset

Clarify constraints before coding. Write skeleton then fill. Test edge cases empty input single element. Communicate throughout silence hurts evaluation.