Welcome to our LeetCode Curated Algo 170 Study Group! 🎯 This is a structured and supportive space for learners who want to work through the LeetCode Curated Algorithm 170 problems systematically. Whether preparing for coding interviews, improving problem-solving skills, or challenging yourself, this group will keep you accountable.

🚀 How to Join

1️Register for the group here. (https://www.moocable.com/groups/view/43)
2️Click on "Join Academy Group"
3️Connect with fellow learners, participate in discussions, and track progress.

📚 What Are We Studying?

We are tackling the LeetCode Curated Algorithm 170 problem set, a handpicked collection of must-know problems for coding interviews. It covers:
✅ Arrays & Strings
✅ Linked Lists
✅ Trees & Graphs
✅ Dynamic Programming
✅ Backtracking
✅ Greedy Algorithms
✅ Bit Manipulation & More

⏳ Duration

This is a 4-month structured study plan, where we aim to complete the 170 problems in a systematic, paced manner.

🗓️ Schedule

We follow a weekly problem-set approach:

Total duration: 4 months
Problems per week: ~10-12
Daily commitment: 1-2 problems/day
Balanced difficulty: Easy → Medium → Hard
"Revise & Catch Up" weeks every 4 weeks for flexibility

📅 Weeks 1-4: Arrays, Hashing, Two Pointers

Focus: Fundamentals, Sorting, Searching, Optimization

Week 1:
- ✅ Two Sum
- ✅ Contains Duplicate
- ✅ Best Time to Buy and Sell Stock
- ✅ Product of Array Except Self
- ✅ Maximum Subarray
- ✅ Merge Intervals
- ✅ Insert Interval
Week 2:
- ✅ Non-overlapping Intervals
- ✅ Valid Anagram
- ✅ Group Anagrams
- ✅ Longest Consecutive Sequence
- ✅ 3Sum
- ✅ Container With Most Water
- ✅ Valid Palindrome
Week 3:
- ✅ Longest Substring Without Repeating Characters
- ✅ Minimum Window Substring
- ✅ Find Minimum in Rotated Sorted Array
- ✅ Search in Rotated Sorted Array
- ✅ Median of Two Sorted Arrays
- ✅ Kth Largest Element in an Array
- ✅ Find Peak Element
Week 4: 🔄 Revise & Catch Up
- Go over tricky problems
- Redo past mistakes
- Solve extra problems if ahead

📅 Weeks 5-8: Stacks, Queues, Linked Lists

Focus: Recursion, Fast/Slow Pointers, Stack Optimization

Week 5:
- ✅ Valid Parentheses
- ✅ Largest Rectangle in Histogram
- ✅ Trapping Rain Water
- ✅ Daily Temperatures
- ✅ Next Greater Element I & II
- ✅ Min Stack
Week 6:
- ✅ Reverse Linked List
- ✅ Merge Two Sorted Lists
- ✅ Remove Nth Node From End of List
- ✅ Reorder List
- ✅ Linked List Cycle
- ✅ Linked List Cycle II
Week 7:
- ✅ LRU Cache
- ✅ Copy List with Random Pointer
- ✅ Add Two Numbers
- ✅ Merge k Sorted Lists
- ✅ Sort List
- ✅ Rotate List
Week 8: 🔄 Revise & Catch Up
- Redo hardest problems
- Fill gaps in concepts

📅 Weeks 9-12: Trees & Graphs

Focus: DFS, BFS, Topological Sort, Graph Traversals

Week 9:
- ✅ Invert Binary Tree
- ✅ Maximum Depth of Binary Tree
- ✅ Same Tree
- ✅ Symmetric Tree
- ✅ Binary Tree Level Order Traversal
- ✅ Balanced Binary Tree
Week 10:
- ✅ Binary Tree Inorder Traversal
- ✅ Lowest Common Ancestor of a BST
- ✅ Kth Smallest Element in a BST
- ✅ Validate Binary Search Tree
- ✅ Serialize and Deserialize Binary Tree
Week 11:
- ✅ Number of Islands
- ✅ Word Ladder
- ✅ Course Schedule
- ✅ Course Schedule II
- ✅ Alien Dictionary
- ✅ Graph Valid Tree
Week 12: 🔄 Revise & Catch Up
- Practice more DFS/BFS
- Strengthen weak areas

📅 Weeks 13-16: Dynamic Programming & Bit Manipulation

Focus: 1D DP, 2D DP, Knapsack, Bitwise Operations

Week 13:
- ✅ Climbing Stairs
- ✅ House Robber
- ✅ House Robber II
- ✅ Coin Change
- ✅ Longest Increasing Subsequence
- ✅ Decode Ways
Week 14:
- ✅ Unique Paths
- ✅ Edit Distance
- ✅ Longest Common Subsequence
- ✅ Longest Palindromic Substring
- ✅ Palindromic Substrings
Week 15:
- ✅ Single Number
- ✅ Sum of Two Integers
- ✅ Counting Bits
- ✅ Reverse Bits
- ✅ Missing Number
- ✅ Find the Duplicate Number
Week 16: 🔄 Revise & Wrap Up
- Final revision of hard problems
- Solve time-bound problems
- If needed, redo any weak topics

✏️ Assignments

Each week you’ll get a list of problems to solve.
Submit your progress under the Progress & Check-ins tag.
Get and give feedback on solutions.

👨‍💻 Study Format

📌 Solve problems at your own pace, but aim to complete the weekly targets.
📌 Post doubts, insights, and optimizations in the group.
📌 Discuss alternative approaches to problems.
📌 Help each other and keep the momentum going!

🚀 Let’s ace these problems together! 🚀