This repository contains my complete solutions for the NeetCode 75 – a curated list of the most important Data Structures & Algorithms problems commonly asked in FAANG and top tech interviews.
The goal of this repository is to practice, revise, and master core DSA concepts while improving problem‑solving skills and coding patterns.
I have completed all 75 problems across major categories such as:
- Arrays & Hashing
- Two Pointers
- Sliding Window
- Stack
- Binary Search
- Linked List
- Trees
- Tries
- Heap / Priority Queue
- Backtracking
- Intervals
- Greedy
- Graphs (DFS/BFS)
- Dynamic Programming
Each folder contains:
- Clean and optimized code solutions
- Time & space complexity
📦 neetcode-75
├── Arrays & Hashing
├── Two Pointers
├── Sliding Window
├── Stack
├── Binary Search
├── Linked List
├── Trees
├── Tries
├── Heap-PriorityQueue
├── Backtracking
├── Intervals
├── Greedy
├── Graphs
└── Dynamic Programming
Each topic contains solutions in separate files.
- Identified repeated patterns like sliding window, hashing, monotonic stack.
- Improved logical thinking and problem-solving speed.
- Strengthened knowledge of recursion, DFS/BFS, and dynamic programming.
- Learned to analyze time & space complexity effectively.
- Two Pointer Technique
- Sliding Window Technique
- HashMap / Set Patterns
- Binary Search on Answer
- DFS & BFS Graph Traversal
- Recursion + Backtracking
- Kadane’s Algorithm
- Priority Queue / Heap Usage
- DP (1D & 2D states)
- Java (Primary language)
- VS Code
- Git & GitHub for version control
✔️ All 75 problems completed
This repo is personal but contributions, suggestions, and optimizations are welcome! Feel free to open issues or pull requests.
If you have suggestions or want to connect:
- GitHub: https://github.com/Alpha2820
- LinkedIn: https://www.linkedin.com/in/abhijeet-tiwari-240409202/
⭐ If you like this repository, consider giving it a star!