| Problems |
|---|
| LeetCode |
| Cracking The Coding Interview |
| Problems |
|---|
| LeetCode |
| Cracking The Coding Interview |
| Problems |
|---|
| LeetCode |
| Cracking The Coding Interview |
| Type | Implementation |
|---|---|
| Singly Linked List | Java |
| Doubly Linked List | Java |
| Circular Linked List | Java |
| XOR Linked List |
| Problems |
|---|
| DSA Made Easy |
| LeetCode |
| Cracking The Coding Interview |
| Type | Implementation |
|---|---|
| Array Based | Java |
| Dynamic Array Based | Java |
| ArrayList Based | Java |
| LinkedList Based | Java |
| Problems |
|---|
| DSA Made Easy |
| LeetCode |
| Cracking The Coding Interview |
- Max Heap
- Min Heap
- Undirected Graph
- Directed Graph
- Find shortest path between nodes in a graph
- Find shortest paths from single node to all other nodes in a graph
- Find shortest paths in weighted graph with positive or negative edge weights, but no negative cycles
- Design Patterns
- Design Patterns for Humans
- Java Design Patterns
- Java Design Patterns
- Ways to implement Singleton Pattern in Java
- Base CS by Vaidehi Joshi
- Tech Interview Handbook by Yangshun Tay
- Front End Interview Handbook by Yangshun Tay
- Awesome Interview Questions Collection by Maksim Abramchuk
- Interactive Coding Challenges by Donne Martin
- Interview Resource Collection by Andrei Simionescu
- Computer Science Study Plan by John Washam
- System Design Primer by Donne Martin
- Useful Anki Decks by Donne Martin
- Google Java Style Guide
- Python Style Guide