DSA Study — References & Resources
NoteUpdated
On this page
All external links, articles, and resources used to build this DSA Study directory.
Primary Study Lists
| Resource | URL | What It Provides |
|---|---|---|
| Blind 75 (Original) | https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU | The original curated list of 75 must-do LeetCode problems by Yangshun Tay |
| NeetCode 150 | https://neetcode.io/practice | Extended version with 150 problems grouped by pattern |
| LeetCode | https://leetcode.com/ | Primary platform for practicing all problems |
Articles & Guides Used
| Resource | URL | Content Extracted |
|---|---|---|
| How to Rock the Coding Interview (Yangshun Tay) | https://www.freecodecamp.org/news/coding-interviews-for-dummies-5e048933b82b/ | Interview phases, topic-specific tips, data structure tricks, preparation strategy → saved to 15-Blind-75/interview-tips-and-strategies.md |
| Blind 75 Solved — Part 1: Arrays (Uluc Ozdenvar) | https://medium.com/@ulucozdenvar/ace-your-coding-interview-blind-75-solved-and-explained-part-1-arrays-4692c04891e0 | Array problem solutions and approaches → used for 15-Blind-75/Array/problems/ |
| Blind 75 Solved — Part 6.2: Trees Continued | https://medium.com/@ulucozdenvar/ace-your-coding-interview-blind-75-solved-and-explained-part-6-2-trees-continued-64cf6f60350 | Tree problem solutions (referenced in Part 1) |
Books
| Book | Author | Notes |
|---|---|---|
| Cracking the Coding Interview | Gayle Laakmann McDowell | Classic reference — 189 interview problems with solutions |
| Grokking Algorithms | Aditya Bhargava | Visual, beginner-friendly algorithm explanations |
| Introduction to Algorithms (CLRS) | Cormen, Leiserson, Rivest, Stein | Comprehensive academic reference |
Online Courses & Platforms
| Platform | URL | Notes |
|---|---|---|
| AlgoMonster | https://algomonster.com/ | Data-driven pattern teaching (one-time fee) |
| Grokking the Coding Interview | https://www.educative.io/courses/grokking-the-coding-interview | Pattern-based approach; Java, Python, C++, JS solutions |
| interviewing.io | https://interviewing.io/ | Free anonymous mock interviews with FAANG engineers |
| Pramp | https://www.pramp.com/ | Peer-to-peer mock interviews |
| HackerRank | https://www.hackerrank.com/ | More competitive-programming style; good for language practice |
| CodeForces | https://codeforces.com/ | Competitive programming contests |
Data Structures & Language References
| Resource | URL | Notes |
|---|---|---|
| Java Collections Framework | https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/util/package-summary.html | Official Java data structures API |
| Python Time Complexities | https://wiki.python.org/moin/TimeComplexity | Referenced in freeCodeCamp article |
| Lago (DS & Algo in JS) | https://github.com/yangshun/lago | Data Structures and Algorithms in JavaScript |
| PEP 8 Style Guide | https://peps.python.org/pep-0008/ | Python coding style |
| Google Java Style Guide | https://google.github.io/styleguide/javaguide.html | Java coding style |
Study Links by Topic (from freeCodeCamp article)
| Topic | Study Link | Description |
|---|---|---|
| Binary | Bits, Bytes, Building With Binary | Understanding binary representation |
| Dynamic Programming | Demystifying Dynamic Programming | DP fundamentals |
| Graph | From Theory To Practice: Representing Graphs | Graph representations |
| Graph | Deep Dive Through A Graph: DFS Traversal | DFS explained |
| Graph | Going Broad In A Graph: BFS Traversal | BFS explained |
| Heap | Learning to Love Heaps | Heap fundamentals |
| Tree | Leaf It Up To Binary Trees | Binary tree basics |
| Trie | Trying to Understand Tries | Trie data structure |
How This Directory Was Built
- Pattern-based structure (directories 00-14) — Follows Grokking the Coding Interview patterns
- Blind 75 overlay (directory 15) — Covers all 75 essential interview problems
- Java-only solutions — Following the
dsa-study-guide.mdcrules - Beginner-friendly — Every solution includes brute force, optimal, dry run, and ASCII visualization
- Interview tips — Extracted from proven resources by engineers who landed FAANG offers
Adding New Resources
When you find a new useful resource, add it here with:
- Name of the resource
- URL (full link)
- What content was extracted and where it was saved in this directory