This repository contains my structured preparation for Data Structures and Algorithms focused on coding interviews.
- Arrays
- Strings
- Hashing
- Sliding Window
- Two Pointers
- Stack & Queue
- Trees
- Graphs
- Dynamic Programming
- Backtracking
- Greedy
Each solution includes:
- Problem description
- Approach explanation
- Time Complexity
- Space Complexity
Example:
Time Complexity: O(n)
Space Complexity: O(1)
Strengthening problem-solving skills and mastering patterns for scalable system design interviews.