A curated collection of the top 50 "sure short" interview questions, organized by pattern and topic.
The project is organized by DSA topics to make it easy to navigate and study.
src/main/java/com/dsa/
├── arrays/ # Array-based problems
├── strings/ # String manipulation problems
├── linkedlists/ # Linked list implementations and problems
├── stacks/ # Stack-based problems
├── queues/ # Queue-based problems
├── trees/ # Binary trees, BST, etc.
├── graphs/ # Graph algorithms
├── recursion/ # Recursive solutions
├── dynamicprogramming/ # DP problems
├── sorting/ # Sorting algorithms
├── searching/ # Searching algorithms
├── backtracking/ # Backtracking problems
├── twopointer/ # Two Pointer problems
└── slidingwindow/ # Sliding Window problems
Each problem includes a main method with a test case. You can run any file individually:
mvn compile
java -cp target/classes com.dsa.arrays.TwoSum- Master common patterns (Two Pointers, Sliding Window, DFS/BFS, etc.)
- Understand Time and Space Complexity.
- Stay consistent — one problem every day.