Hello, everyone! 👋 I'm Sanket Rajput, and I'm taking on the 75-day challenge to complete the Striver's A2Z DSA Sheet. This challenge will help me strengthen my problem-solving skills, improve DSA knowledge, and prepare for coding interviews.
- 📆 Start Date: 16-Jan-2025
- 🏁 End Date: 1-Apr-2025
- 🔥 Commitment: 4-5 problems daily
- ✅ Goal: Complete Striver's A2Z DSA Sheet in 75 days
- Improve coding speed and logic-building
- Enhance problem-solving for FAANG & top tech interviews
- Stay consistent & disciplined in DSA practice
- Share progress on LinkedIn & GitHub
📌 Daily Updates: Uploading solutions every day
📢 Weekly LinkedIn Posts: Sharing learnings & reflections
📝 Explanations & Comments: For better understanding
💡 LeetCode/GFG Solutions: Practicing problems on different platforms
🌟 LinkedIn: Sanket Rajput
📂 GitHub: sanket-rajput
🔗 View Full Striver's A2Z Sheet
🔥 Let’s stay consistent and ace DSA together!🔥
🚀 Target: Complete all 18 steps in 75 days → 1.5 to 2 steps per week
🔹 Step 1: Learn the Basics (31 Topics)
🔹 Step 2: Sorting Techniques (7 Topics)
✔ Daily Goal: 4-5 concepts + 5-7 problems
✔ End-of-Week Progress: Basics complete ✅ | Sorting 50% ✅
✔ LinkedIn Update on Jan 22: Share concepts covered, key learnings
🔹 Step 3: Arrays (40 Problems)
🔹 Step 4: Binary Search (32 Problems)
✔ Daily Goal: 5-6 problems from Arrays + 4 Binary Search problems
✔ End-of-Week Progress: Arrays 50% ✅ | Binary Search 30% ✅
✔ LinkedIn Update on Jan 29: Array techniques & Binary Search tricks
🔹 Step 5: Strings (15 Problems)
🔹 Step 6: Linked Lists (31 Problems)
✔ Daily Goal: 3 String problems + 4 Linked List problems
✔ End-of-Week Progress: Strings ✅ | Linked Lists 40% ✅
✔ LinkedIn Update on Feb 5: Common String & Linked List patterns
🔹 Step 7: Recursion (25 Problems)
🔹 Step 8: Bit Manipulation (18 Problems)
✔ Daily Goal: 3 Recursion problems + 2 Bit Manipulation problems
✔ End-of-Week Progress: Recursion 50% ✅ | Bit Manipulation 50% ✅
✔ LinkedIn Update on Feb 12: Recursion techniques & Bitwise operations
🔹 Step 9: Stack & Queue (30 Problems)
🔹 Step 10: Sliding Window & Two Pointer (12 Problems)
✔ Daily Goal: 3 Stack/Queue problems + 2 Sliding Window problems
✔ End-of-Week Progress: Stack & Queue 50% ✅ | Sliding Window ✅
✔ LinkedIn Update on Feb 19: Stack/Queue tricks & Two Pointer mastery
🔹 Step 11: Heaps (17 Problems)
🔹 Step 12: Greedy Algorithms (16 Problems)
✔ Daily Goal: 3 Heap problems + 3 Greedy problems
✔ End-of-Week Progress: Heaps ✅ | Greedy 50% ✅
✔ LinkedIn Update on Feb 26: Heap properties & Greedy approaches
🔹 Step 13: Binary Trees (39 Problems)
🔹 Step 14: Binary Search Trees (16 Problems)
✔ Daily Goal: 3 Tree problems + 2 BST problems
✔ End-of-Week Progress: Trees 50% ✅ | BST 50% ✅
✔ LinkedIn Update on Mar 4: Tree traversal techniques
🔹 Step 15: Graphs (54 Problems)
✔ Daily Goal: 5-6 Graph problems
✔ End-of-Week Progress: Graphs 50% ✅
✔ LinkedIn Update on Mar 11: Graph algorithms (BFS, DFS, Dijkstra)
🔹 Step 16: DP (56 Problems)
✔ Daily Goal: 5-6 DP problems
✔ End-of-Week Progress: DP 50% ✅ | DP 100% ✅ by Mar 25
✔ LinkedIn Update on Mar 18 & Mar 25: DP tricks & patterns
🔹 Step 17: Tries (7 Problems)
🔹 Step 18: Strings (Final Problems & Revision)
🔹 Final Revision & Mock Tests
✔ Daily Goal: 3 Trie problems + 3 revision problems
✔ Final LinkedIn Update (Apr 1, 2025): Challenge Completed! 🎉
📌 Daily: Push solutions to GitHub (Strivers-A2Z-DSA-75Days).
📌 Weekly: Post progress summary on LinkedIn.
📌 Every 15 days: Identify weak areas & revise.
Would you like help setting up a Notion tracker or automating commits? 🚀
| 0026-remove-duplicates-from-sorted-array |
| 0189-rotate-array |
| 0344-reverse-string |
| 0167-two-sum-ii-input-array-is-sorted |
| 0189-rotate-array |
| 0268-missing-number |
| 0268-missing-number |
| 1813-maximum-erasure-value |
| 0560-subarray-sum-equals-k |
| 0169-majority-element |
| 0217-contains-duplicate |
| 0268-missing-number |
| 2498-smallest-subarrays-with-maximum-bitwise-or |
| 0167-two-sum-ii-input-array-is-sorted |
| 0209-minimum-size-subarray-sum |
| 0268-missing-number |
| 2498-smallest-subarrays-with-maximum-bitwise-or |
| 0268-missing-number |
| 0169-majority-element |
| 0217-contains-duplicate |
| 0121-best-time-to-buy-and-sell-stock |
| 1302-delete-characters-to-make-fancy-string |
| 1818-maximum-score-from-removing-substrings |
| 0344-reverse-string |
| 1813-maximum-erasure-value |
| 2498-smallest-subarrays-with-maximum-bitwise-or |
| 0209-minimum-size-subarray-sum |
| 1818-maximum-score-from-removing-substrings |
| 1818-maximum-score-from-removing-substrings |
| 0560-subarray-sum-equals-k |
| 0724-find-pivot-index |
| 0209-minimum-size-subarray-sum |
| 0169-majority-element |
| 0169-majority-element |