LeetCode 75 Study Plan

A structured approach to mastering fundamental programming concepts through carefully selected LeetCode problems.

Progress Tracking

• Completed Problems: 0
• Total Problems: 75
• Completion Rate: 0%

Categories

Array / String

• Merge Strings Alternately Easy
• Greatest Common Divisor of Strings Easy
• Kids With the Greatest Number of Candies Easy
• Can Place Flowers Easy
• Reverse Vowels of a String Easy
• Reverse Words in a String Medium
• Product of Array Except Self Medium
• Increasing Triplet Subsequence Medium
• String Compression Medium

Two Pointers

• Move Zeroes Easy
• Is Subsequence Easy
• Container With Most Water Medium
• Max Number of K-Sum Pairs Medium

Sliding Window

• Maximum Average Subarray I Easy
• Maximum Number of Vowels in a Substring of Given Length Medium
• Max Consecutive Ones III Medium
• Longest Subarray of 1's After Deleting One Element Medium

Prefix Sum

• Find the Highest Altitude Easy
• Find Pivot Index Easy

Hash Map / Set

• Find the Difference of Two Arrays Easy
• Unique Number of Occurrences Easy
• Determine if Two Strings Are Close Medium
• Equal Row and Column Pairs Medium

Stack

• Removing Stars From a String Medium
• Asteroid Collision Medium
• Decode String Medium

Queue

• Number of Recent Calls Easy
• Dota2 Senate Medium

Linked List

• Delete the Middle Node of a Linked List Medium
• Odd Even Linked List Medium
• Reverse Linked List Easy
• Maximum Twin Sum of a Linked List Medium

Binary Tree - DFS

• Maximum Depth of Binary Tree Easy
• Leaf-Similar Trees Easy
• Count Good Nodes in Binary Tree Medium
• Path Sum III Medium
• Longest ZigZag Path in a Binary Tree Medium
• Lowest Common Ancestor of a Binary Tree Medium

Binary Tree - BFS

• Binary Tree Right Side View Medium
• Maximum Level Sum of a Binary Tree Medium

Binary Search Tree

• Search in a Binary Search Tree Easy
• Delete Node in a BST Medium

Graphs - DFS

• Keys and Rooms Medium
• Number of Provinces Medium
• Reorder Routes to Make All Paths Lead to the City Zero Medium
• Evaluate Division Medium

Graphs - BFS

• Nearest Exit from Entrance in Maze Medium
• Rotting Oranges Medium

Heap / Priority Queue

• Kth Largest Element in an Array Medium
• Smallest Number in Infinite Set Medium
• Maximum Subsequence Score Medium
• Total Cost to Hire K Workers Medium

Binary Search

• Guess Number Higher or Lower Easy
• Successful Pairs of Spells and Potions Medium
• Find Peak Element Medium
• Koko Eating Bananas Medium

Backtracking

• Letter Combinations of a Phone Number Medium
• Combination Sum III Medium

DP - 1D

• N-th Tribonacci Number Easy
• Min Cost Climbing Stairs Easy
• House Robber Medium
• Domino and Tromino Tiling Medium

DP - Multidimensional

• Unique Paths Medium
• Longest Common Subsequence Medium
• Best Time to Buy and Sell Stock with Transaction Fee Medium
• Edit Distance Medium

Bit Manipulation

• Counting Bits Easy
• Single Number Easy
• Minimum Flips to Make a OR b Equal to c Medium

Trie

• Implement Trie (Prefix Tree) Medium
• Search Suggestions System Medium

Intervals

• Non-overlapping Intervals Medium
• Minimum Number of Arrows to Burst Balloons Medium

Monotonic Stack

• Daily Temperatures Medium
• Online Stock Span Medium

How to Use This Repository

1. Check off problems as you complete them using the checkboxes
2. Focus on understanding patterns within each category
3. Review completed problems periodically
4. Track your progress using the progress bar at the top

Problem Difficulty Breakdown

• Easy: 19 problems
• Medium: 56 problems
• Hard: 0 problems

Study Tips

1. Solve problems within the same category consecutively
2. Understand the patterns and techniques specific to each category
3. Review solutions after solving or if stuck for more than 30-45 minutes
4. Practice explaining your solutions to reinforce understanding

---

Happy Coding! 🚀# Leetcode75