- 100 Days of DS Algo is my goal on working towards the problem solving skills using data structures and algorithms by:
- Solving more than 200 problems from every important topic
- Staying consistent
- Note taking patterns & optimization of problems
Su | Mo | Tu | We | Th | Fr | Sa |
---|---|---|---|---|---|---|
- | - | - | - | - | - | 1 ❌ |
2 ✅ | 3 ✅ | 4 ❌ | 5 ❌ | 6 ❌ | 7 ❌ | 8 ❌ |
9 ✅ | 10 ✅ | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 | 26 | 27 | 28 | 29 |
30 | 31 | - | - | - | - | - |
- Click the dates to check out the commits
- Progress type:
- ✅ Consitency
- ❌ Broke the chain
- 404 Error implies that it's private repository for now, wait till it's made public
- Shoutout to James Clear (Author of Atomic Habits) for sharing the idea of Progress Tracker in his book Atomic Habits
- Dr. Angela Yu (Developer & Lead Instructor) for sharing a habit tracker printout template with her course
- And myself 😅 Aswin Barath (Owner of Repo) to mix-match ideas into this repository for the first time in my GitHub profile
- DSA Cracker Sheet: Arrays
- SDE Sheet - Day 1: Arrays
- FAANG 30 - Arrays: Question #1 Google Interview Question Two Sum (Easy)
- DSA Cracker Sheet: Arrays
- SDE Sheet - Day 2: Arrays
- FAANG 30 - Arrays: Question #2 Container With Most Water (Medium)
- DSA Cracker Sheet: Matrix
- SDE Sheet - Day 3: Arrays
- FAANG 30 - Arrays: Question #3 Trapping Rainwater (Hard)
- DSA Cracker Sheet: Strings
- SDE Sheet - Day 4: Hashing
- FAANG 30 - Strings: Question #4 Backspace String Compare (Easy)
- DSA Cracker Sheet: Strings
- SDE Sheet - Day 5: Linked lists
- FAANG 30 - Strings: Question #5 Longest Substring Without Repeating Characters (Medium)
- DSA Cracker Sheet: Searching & Sorting
- SDE Sheet - Day 6: Linked lists
- FAANG 30 - Palindromes:
- Question #6a Valid Palindrome(Easy)
- Question #6b Almost Palindrome (Easy)
- DSA Cracker Sheet: Searching & Sorting
- SDE Sheet - Day 7: 2-pointer
- FAANG 30 - Linked lists:
- Basic Algorithm - Reverse Linked List
- Question #7 M, N Reversals (Medium)
- DSA Cracker Sheet: Linked lists
- SDE Sheet - Day 8: Greedy
- FAANG 30 - Doubly Linked lists: Question #8 Merge Multi-Level Doubly Linked List (Medium)
- DSA Cracker Sheet: Linked lists
- SDE Sheet - Day 9: Recursion
- FAANG 30 - Linked lists: Question #9 Cycle Detection (Medium)
- DSA Cracker Sheet: Binary Trees
- SDE Sheet - Day10: Recursion and Backtracking
- FAANG 30 - Stacks: Question #10 Valid Parentheses (Easy)
- DSA Cracker Sheet: Binary Trees
- SDE Sheet - Day 11: Binary Search
- FAANG 30 - Stacks: Question #11 Minimum Brackets To Remove To Make Valid (Medium)
- DSA Cracker Sheet: Binary Search Trees
- SDE Sheet - Day 12: Bit Manipulation
- FAANG 30 - Queues: Question #12 Implement Queue With Stacks (Easy)
- DSA Cracker Sheet: Greedy
- SDE Sheet - Day 13: Stack and Queue
- FAANG 30 - Recursion & Sorting: Question #13 Kth Largest Element (Medium)
- DSA Cracker Sheet: Greedy
- SDE Sheet - Day 14: Miscellaneous
- FAANG 30 - Recursion & Binary Search: Question #14 Start And End Of Target (Medium)
- DSA Cracker Sheet: Backtracking
- SDE Sheet - Day 15: String Manipulation
- FAANG 30 - Binary Trees: Question #15 Maximum Depth Of Binary Tree (Easy)
- DSA Cracker Sheet: Stack and Queue
- SDE Sheet - Day 16: String Manipulation
- FAANG 30 - Binary Trees: Question #16 Level Order Of Binary Tree (Medium)
- DSA Cracker Sheet: Stack and Queue
- SDE Sheet - Day 17: Binary Tree
- FAANG 30 - Binary Trees: Question #17 Right Side View of Tree (Medium)
- DSA Cracker Sheet: Heap
- SDE Sheet - Day 18: Binary Tree
- FAANG 30 - Full And Complete Binary Trees: Question #18 Number Of Nodes In Complete Tree (Medium)
- DSA Cracker Sheet: Graphs
- SDE Sheet - Day 19: Binary Tree
- FAANG 30 - Binary Search Trees: Question #19 Validate Binary Search Tree (Medium)
- DSA Cracker Sheet: Graphs
- SDE Sheet - Day 20: Binary Search Tree
- FAANG 30 - 2D-Arrays:
- Heaps & Priority Queues implementation
- Traversals
- DFS in 2D-Arrays
- BFS in 2D-Arrays
- Question #20 Number Of Islands (Medium)
- DSA Cracker Sheet: Trie
- SDE Sheet - Day 21: Binary Search Tree
- FAANG 30 - 2D-Arrays: Question #21 Rotting Oranges (Medium)
- DSA Cracker Sheet: Dynamic Programming
- SDE Sheet - Day 22: Miscellaneous
- FAANG 30 - 2D-Arrays: Question #22 Walls And Gates (Medium)
- DSA Cracker Sheet: Dynamic Programming
- SDE Sheet - Day 23: Graphs
- FAANG 30 - Graphs
- BFS Graph Traversal
- DFS Graph Traversals
- Question #23 Time Needed To Inform All Employees (Medium)
- DSA Cracker Sheet: Dynamic Programming
- SDE Sheet - Day 24: Graphs
- FAANG 30 - Graphs
- Question #24 Course Scheduler (Medium)
- DSA Cracker Sheet: Bit Manipulation
- SDE Sheet - Day 25: Dynamic Programming
- FAANG 30 - Graphs
- Question #25 Network Time Delay (Medium)
- SDE Sheet - Day 26: Dynamic Programming
- FAANG 30 - Dynamic Programming
- Question #26 Minimum Cost Of Climbing Stairs (Easy)
- FAANG 30 - Dynamic Programming
- Question #27 Knight Probability In Chessboard (Medium)
- FAANG 30 - Back Tracking
- Question #28 Sudoku Solver (Hard)
- Additional Backtracking Problems:
- Palindrome Partitioning (Medium)
- N-Queens (Hard)
- FAANG 30 - Interface Design: Question #29 Monarchy (Medium)
- FAANG 30 - Tries: Question #30 Implement Prefix Trie (Medium)
- Complete Revision