0% found this document useful (0 votes)
21 views3 pages

Converted Text

This document outlines a topic-wise LeetCode practice plan aligned with Apna College's DSA course structure, recommending a progression from easy to medium/hard problems. It includes specific problem links for various programming concepts and data structures, along with pro tips for tracking progress and focusing on FAANG-tagged questions. A sample weekly plan is provided to structure practice over ten weeks, culminating in a goal of solving 300+ problems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views3 pages

Converted Text

This document outlines a topic-wise LeetCode practice plan aligned with Apna College's DSA course structure, recommending a progression from easy to medium/hard problems. It includes specific problem links for various programming concepts and data structures, along with pro tips for tracking progress and focusing on FAANG-tagged questions. A sample weekly plan is provided to structure practice over ten weeks, culminating in a goal of solving 300+ problems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Great choice!

Here's a **topic-wise LeetCode practice plan** aligned with **Apna College's DSA
course structure**. For each topic, start with easy problems, then progress to medium/hard.
Focus on **FAANG-tagged questions** where possible.

---

### **Programming with C++ (Basic Prep)**


| **Topic** | **LeetCode Problems (Easy Medium)**
|
|-------------------------|-------------------------------------------------------------------------------------------------------|
| **Loops & Conditionals**| 1. [Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) (412) <br>
2. [Two Sum](https://leetcode.com/problems/two-sum/) (1) <br> 3. [Palindrome Number]
(https://leetcode.com/problems/palindrome-number/) (9) |
| **Patterns** | *Note: LeetCode focuses on logic, not patterns. Use HackerRank for pattern
printing.* |
| **Functions & Scope** | 1. [Power of Three](https://leetcode.com/problems/power-of-three/)
(326) <br> 2. [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)
(172) |

---

### **Core Data Structures & Algorithms**


| **Topic** | **LeetCode Problems (Easy Medium)**
|
|-------------------------|-------------------------------------------------------------------------------------------------------|
| **Arrays & 2D Arrays** | 1. [Best Time to Buy/Sell Stock](https://leetcode.com/problems/best-
time-to-buy-and-sell-stock/) (121) <br> 2. [Rotate Image](https://leetcode.com/problems/rotate-
image/) (48) <br> 3. [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) (54) |
| **Sorting** | 1. [Sort Colors](https://leetcode.com/problems/sort-colors/) (75) <br> 2.
[Kth Largest Element](https://leetcode.com/problems/kth-largest-element-in-an-array/) (215)
<br> 3. [Merge Intervals](https://leetcode.com/problems/merge-intervals/) (56) |
| **Strings** | 1. [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)
(125) <br> 2. [Longest Substring Without Repeating Characters](https://leetcode.com/problems/
longest-substring-without-repeating-characters/) (3) <br> 3. [Group Anagrams](https://
leetcode.com/problems/group-anagrams/) (49) |
| **Pointers & STL** | 1. [Move Zeroes](https://leetcode.com/problems/move-zeroes/) (283)
<br> 2. [Container With Most Water](https://leetcode.com/problems/container-with-most-water/)
(11) <br> 3. [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-
elements/) (347) |
| **Recursion & Backtracking** | 1. [Subsets](https://leetcode.com/problems/subsets/) (78) <br>
2. [Permutations](https://leetcode.com/problems/permutations/) (46) <br> 3. [Combination
Sum](https://leetcode.com/problems/combination-sum/) (39) |
| **Linked Lists** | 1. [Reverse Linked List](https://leetcode.com/problems/reverse-linked-
list/) (206) <br> 2. [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-
lists/) (21) <br> 3. [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) (141) |
| **Stacks & Queues** | 1. [Valid Parentheses](https://leetcode.com/problems/valid-
parentheses/) (20) <br> 2. [Implement Queue using Stacks](https://leetcode.com/problems/
implement-queue-using-stacks/) (232) <br> 3. [Daily Temperatures](https://leetcode.com/
problems/daily-temperatures/) (739) |
| **Binary Trees** | 1. [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)
(226) <br> 2. [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-
of-binary-tree/) (104) <br> 3. [Binary Tree Level Order Traversal](https://leetcode.com/problems/
binary-tree-level-order-traversal/) (102) |
| **BST** | 1. [Validate BST](https://leetcode.com/problems/validate-binary-search-
tree/) (98) <br> 2. [Lowest Common Ancestor](https://leetcode.com/problems/lowest-common-
ancestor-of-a-binary-search-tree/) (235) <br> 3. [Kth Smallest Element](https://leetcode.com/
problems/kth-smallest-element-in-a-bst/) (230) |

---

### **Advanced DSA**


| **Topic** | **LeetCode Problems (Medium Hard)**
|
|-------------------------|-------------------------------------------------------------------------------------------------------|
| **Heaps** | 1. [Kth Largest Element](https://leetcode.com/problems/kth-largest-
element-in-an-array/) (215) <br> 2. [Merge k Sorted Lists](https://leetcode.com/problems/merge-
k-sorted-lists/) (23) |
| **HashMaps** | 1. [Two Sum](https://leetcode.com/problems/two-sum/) (1) <br> 2.
[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-
sequence/) (128) <br> 3. [Subarray Sum Equals K](https://leetcode.com/problems/subarray-
sum-equals-k/) (560) |
| **Graphs** | 1. [Number of Islands](https://leetcode.com/problems/number-of-islands/)
(200) <br> 2. [Course Schedule](https://leetcode.com/problems/course-schedule/) (207) <br> 3.
[Dijkstra’s Algorithm (Shortest Path)](https://leetcode.com/problems/network-delay-time/) (743)
|
| **Dynamic Programming** | 1. [Climbing Stairs](https://leetcode.com/problems/climbing-
stairs/) (70) <br> 2. [Coin Change](https://leetcode.com/problems/coin-change/) (322) <br> 3.
[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-
subsequence/) (300) |
| **Greedy** | 1. [Maximum Subarray](https://leetcode.com/problems/maximum-
subarray/) (53) <br> 2. [Jump Game](https://leetcode.com/problems/jump-game/) (55) <br> 3.
[Gas Station](https://leetcode.com/problems/gas-station/) (134) |

---

### **Pro Tips**


1. **After Each Topic**:
- Solve **5-10 problems** from the topic’s list.
- Use **Apna College’s code examples** to cross-check your logic.
2. **Track Progress**: Use a spreadsheet to log solved problems and revisit tough ones weekly.
3. **FAANG Focus**: Filter problems by company tags on LeetCode (e.g., [Amazon Top 50]
(https://leetcode.com/company/amazon/)).
4. **Pattern Mastery**: Use **NeetCode’s Roadmap** or **Striver’s SDE Sheet** for pattern-
based practice.

---
### **Sample Weekly Plan**
- **Week 1-2**: Arrays + Sorting (20 problems).
- **Week 3-4**: Linked Lists + Stacks/Queues (15 problems).
- **Week 5-6**: Trees + BST (20 problems).
- **Week 7-8**: Graphs + Heaps (15 problems).
- **Week 9-10**: Dynamic Programming + Greedy (25 problems).

---

### **Final Checklist**


- Solve **300+ problems** (60% Medium, 40% Hard).
- Master **10-15 problem patterns** (e.g., Sliding Window, BFS/DFS).
- Practice **mock interviews** on Pramp/Interviewing.io.

With Apna College’s course + this plan, you’ll be **FAANG-ready**! Stay consistent and grind
smart.

You might also like