DSA Study Log & Progress Tracker
DSA Study Log & Progress Tracker
Overall Progress
Completed: 64 | Learning: 0 | To Do: 1%%{init: {'pie': {'textPosition': 0.75}, 'themeVariables': {'pieOuterStrokeWidth': '2px'}}}%%
pie showData
title Overall GenAI Study Progress
"⚪️ To Do" : 1
"✅ Completed" : 64
This document serves as a centralized dashboard to track my learning progress through the DSA master list. The goal is to master these high-ROI problems and patterns.
Status Legend:
- ⚪️ To Do: Not yet started.
- 🟡 Learning: Actively studying the topic.
- ✅ Completed: Study is complete and validated with a
Proof of Study.
Tier 1: The Bedrock (Non-Negotiable Fundamentals)
Arrays & Hashing
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Arrays & Hashing | Group Anagrams | ✅ | (NeetCode) | Group Anagrams | |
| Arrays & Hashing | Two Sum | ✅ | (NeetCode) | Two Sum | |
| Arrays & Hashing | Sort Colors / The Dutch National Flag Problem | ✅ | (NeetCode / EPI 6.1) | Dutch National Flag | |
| Arrays & Hashing | Test Palindromicity | ✅ | (EPI 7.5) | Test Palindromicity | |
| Arrays & Hashing | Longest Consecutive Sequence | ✅ | (NeetCode) | Longest Consecutive Sequence |
Linked Lists
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Linked Lists | Reverse Linked List | ✅ | (NeetCode) | Reverse Linked List | |
| Linked Lists | Merge Two Sorted Lists | ✅ | (NeetCode / EPI 8.1) | Merge Two Sorted Lists | |
| Linked Lists | Linked List Cycle / Test for Cyclicity | ✅ | (NeetCode / EPI 8.3) | Linked List Cycle / Test for Cyclicity | |
| Linked Lists | Copy List With Random Pointer | ✅ | (NeetCode) | Copy List With Random Pointer |
Stacks
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Stacks | Valid Parentheses | ✅ | (NeetCode) | Valid Parentheses | |
| Stacks | Evaluate RPN Expressions | ✅ | (NeetCode / EPI 9.2) | Evaluate RPN Expressions |
Binary Trees (General)
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Binary Trees | Maximum Depth of Binary Tree | ✅ | (NeetCode) | Maximum Depth of Binary Tree | |
| Binary Trees | Binary Tree Level Order Traversal | ✅ | (NeetCode) | Binary Tree Level Order Traversal | |
| Binary Trees | Invert Binary Tree | ✅ | (NeetCode) | Invert Binary Tree |
Graphs
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Graphs | Number of Islands / Search a Maze | ✅ | (NeetCode / EPI 19.1) | Number of Islands | |
| Graphs | Clone a Graph | ✅ | (NeetCode / EPI 19.4) | Clone a Graph |
Tier 2: The Differentiators (Senior-Level Proficiency)
Advanced Arrays & Hashing
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Advanced Arrays & Hashing | Container With Most Water | ✅ | (NeetCode) | Container With Most Water | |
| Advanced Arrays & Hashing | Product of Array Except Self | ✅ | (NeetCode) | Product of Array Except Self | |
| Advanced Arrays & Hashing | Best Time to Buy and Sell Stock | ✅ | (NeetCode / EPI 6.6) | Buying Selling Stock Once |
String Manipulation
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| String Manipulation | Valid Anagram | ✅ | (NeetCode) | Valid Anagram | |
| String Manipulation | String to Integer (atoi) | ⚪️ | (NeetCode) |
Binary Search
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Binary Search | Binary Search | ✅ | (NeetCode) | Binary Search | |
| Binary Search | Search in Rotated Sorted Array | ✅ | (NeetCode) | Search in Rotated Sorted Array | |
| Binary Search | Find Minimum in Rotated Sorted Array | ✅ | (NeetCode / EPI) | Find Minimum in Rotated Sorted Array |
Sliding Window
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Sliding Window | Longest Substring Without Repeating Characters | ✅ | (NeetCode) | Longest Substring Without Repeating Characters | |
| Sliding Window | Minimum Window Substring / Find the Smallest Subarray Covering All Values | ✅ | (NeetCode / EPI 13.7) | Minimum Window Substring |
Matrix Problems
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Matrix Problems | Spiral Matrix | ✅ | (NeetCode) | Spiral Matrix | |
| Matrix Problems | Set Matrix Zeroes | ✅ | (NeetCode) | Set Matrix Zeroes |
Intervals
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Intervals | Merge Intervals | ✅ | (NeetCode / EPI) | Merge Intervals | |
| Intervals | Insert Interval | ✅ | (NeetCode) | Insert Interval |
Heaps (Priority Queues)
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Heaps | Kth Largest Element in an Array | ✅ | (NeetCode) | Kth Largest Element in an Array | |
| Heaps | Find Median from Data Stream | ✅ | (NeetCode) | Find Median from Data Stream | |
| Heaps | Merge K Sorted Lists | ✅ | (NeetCode / EPI 11.1) | Merge K Sorted Lists |
Backtracking (Applied Recursion)
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Backtracking | Subsets | ✅ | (NeetCode) | Subsets | |
| Backtracking | Combination Sum | ✅ | (NeetCode) | Combination Sum | |
| Backtracking | Permutations | ✅ | (NeetCode / EPI 16.3) | Permutations | |
| Backtracking | Word Search | ✅ | (NeetCode) | Word Search | |
| Backtracking | Subsets II | ✅ | (NeetCode) | Subsets II |
Tries
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Tries | Implement Trie (Prefix Tree) | ✅ | (NeetCode) | Implement Trie (Prefix Tree) | |
| Tries | Design Add and Search Words Data Structure | ✅ | (NeetCode) | Design Add and Search Words Data Structure |
Advanced Trees & BSTs
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Advanced Trees & BSTs | Validate Binary Search Tree | ✅ | (NeetCode / EPI 15.1) | Validate Binary Search Tree | |
| Advanced Trees & BSTs | Lowest Common Ancestor of a Binary Search Tree | ✅ | (NeetCode) | Lowest Common Ancestor of a Binary Search Tree | |
| Advanced Trees & BSTs | Lowest Common Ancestor of a Binary Tree | ✅ | (NeetCode) | Lowest Common Ancestor of a Binary Tree | |
| Advanced Trees & BSTs | Binary Tree Maximum Path Sum | ✅ | (NeetCode) | Binary Tree Maximum Path Sum | |
| Advanced Trees & BSTs | Construct Binary Tree from Preorder and Inorder Traversal | ✅ | (NeetCode / EPI 10.12) | Construct Binary Tree from Preorder and Inorder Traversal |
Advanced Graphs
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Advanced Graphs | Course Schedule | ✅ | (NeetCode) | Course Schedule | |
| Advanced Graphs | Rotting Oranges | ✅ | (NeetCode) | Rotting Oranges | |
| Advanced Graphs | Word Ladder / Transform One String to Another | ✅ | (NeetCode / EPI 19.7) | Word Ladder |
Dynamic Programming (DP)
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Dynamic Programming | Climbing Stairs | ✅ | (NeetCode) | Climbing Stairs | |
| Dynamic Programming | Coin Change | ✅ | (NeetCode) | Coin Change | |
| Dynamic Programming | Longest Increasing Subsequence | ✅ | (NeetCode) | Longest Increasing Subsequence | |
| Dynamic Programming | Longest Palindromic Substring | ✅ | (NeetCode) | Longest Palindromic Substring | |
| Dynamic Programming | Longest Common Subsequence | ✅ | (NeetCode) | Longest Common Subsequence | |
| Dynamic Programming | Word Break | ✅ | (NeetCode) | Word Break | |
| Dynamic Programming | Unique Paths | ✅ | (NeetCode) | Unique Paths | |
| Dynamic Programming | Edit Distance / Compute the Levenshtein Distance | ✅ | (NeetCode / EPI 17.2) | Edit Distance |
Tier 3: Advanced Extensions (For Comprehensive FAANG Prep)
These additional problems from NeetCode 150 and EPI provide deeper practice on key patterns, focusing on variations that frequently appear in big tech interviews.
Two Pointers
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Two Pointers | 3Sum | ✅ | (NeetCode / EPI 18.2) | 3 sum | |
| Two Pointers | Trapping Rain Water | ✅ | (NeetCode) | Trapping Rain Water |
Heaps & Priority Queues
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Heaps | K Closest Points to Origin | ✅ | (NeetCode) | K Closest Points to Origin | |
| Heaps | Top K Frequent Elements | ✅ | (NeetCode) | Top K Frequent Elements |
Trees & Serialization
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Trees | Serialize and Deserialize Binary Tree | ✅ | (NeetCode / EPI 10.13) | Serialize and Deserialize Binary Tree |
Graphs & Advanced
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Graphs | Pacific Atlantic Water Flow | ✅ | (NeetCode) | Pacific Atlantic Water Flow | |
| Graphs | Network Delay Time (Dijkstra’s) | ✅ | (NeetCode) | Network Delay Time |
Math & Bit Manipulation
| Topic | Problem | Status | References | Proof of Study (Link) | Notes / Key Takeaway |
|---|---|---|---|---|---|
| Math & Bit Manipulation | Number of 1 Bits | ✅ | (NeetCode) | Number of 1 Bits | |
| Math & Bit Manipulation | Reverse Integer | ✅ | (NeetCode) | Reverse Integer |
Updated with comprehensive coverage including String Manipulation, Binary Search, Matrix Problems, Intervals, and Math/Bit Manipulation for complete FAANG prep.