[go: up one dir, main page]

0% found this document useful (0 votes)
9 views4 pages

Question 2025

The document outlines various coding problems categorized by data structures and difficulty levels, including Arrays & Hashing, Two Pointers, Sliding Window, Stack, Binary Search, Linked List, Trees, Graphs, Dynamic Programming, and Bit Manipulation. Each category lists specific problems from easy to hard, along with their respective LeetCode numbers. It also provides a recommended approach for practicing these problems, suggesting to start with easy ones and gradually progress to harder challenges.

Uploaded by

Chhavi pal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views4 pages

Question 2025

The document outlines various coding problems categorized by data structures and difficulty levels, including Arrays & Hashing, Two Pointers, Sliding Window, Stack, Binary Search, Linked List, Trees, Graphs, Dynamic Programming, and Bit Manipulation. Each category lists specific problems from easy to hard, along with their respective LeetCode numbers. It also provides a recommended approach for practicing these problems, suggesting to start with easy ones and gradually progress to harder challenges.

Uploaded by

Chhavi pal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1️⃣ Arrays & Hashing

🔹 Easy:
✅ Two Sum (LC 1)
✅ Contains Duplicate (LC 217)
✅ Merge Sorted Array (LC 88)

🔹 Medium:
✅ Group Anagrams (LC 49)
✅ Top K Frequent Elements (LC 347)
✅ Product of Array Except Self (LC 238)
✅ Longest Consecutive Sequence (LC 128)

🔹 Hard:
✅ Median of Two Sorted Arrays (LC 4)
✅ Sliding Window Maximum (LC 239)

2️⃣ Two Pointers

🔹 Easy:
✅ Valid Palindrome (LC 125)
✅ Remove Duplicates from Sorted Array (LC 26)

🔹 Medium:
✅ Two Sum II - Input Array is Sorted (LC 167)
✅ 3Sum (LC 15)
✅ Container With Most Water (LC 11)

🔹 Hard:
✅ Trapping Rain Water (LC 42)

3️⃣ Sliding Window

🔹 Medium:
✅ Longest Substring Without Repeating Characters (LC 3)
✅ Longest Repeating Character Replacement (LC 424)
✅ Minimum Window Substring (LC 76)

4️⃣ Stack

🔹 Easy:
✅ Valid Parentheses (LC 20)
✅ Min Stack (LC 155)
🔹 Medium:
✅ Evaluate Reverse Polish Notation (LC 150)
✅ Daily Temperatures (LC 739)
✅ Car Fleet (LC 853)
✅ Largest Rectangle in Histogram (LC 84)

🔹 Hard:
✅ Basic Calculator (LC 224)

5️⃣ Binary Search

🔹 Easy:
✅ Binary Search (LC 704)

🔹 Medium:
✅ Search in Rotated Sorted Array (LC 33)
✅ Find Minimum in Rotated Sorted Array (LC 153)
✅ Koko Eating Bananas (LC 875)

🔹 Hard:
✅ Median of Two Sorted Arrays (LC 4)

6️⃣ Linked List

🔹 Easy:
✅ Reverse Linked List (LC 206)

🔹 Medium:
✅ Merge Two Sorted Lists (LC 21)
✅ Linked List Cycle (LC 141)
✅ Reorder List (LC 143)

🔹 Hard:
✅ Merge k Sorted Lists (LC 23)

7️⃣ Trees

🔹 Easy:
✅ Invert Binary Tree (LC 226)
✅ Maximum Depth of Binary Tree (LC 104)
🔹 Medium:
✅ Subtree of Another Tree (LC 572)
✅ Construct Binary Tree from Preorder and Inorder Traversal (LC 105)

🔹 Hard:
✅ Serialize and Deserialize Binary Tree (LC 297)

8️⃣ Graphs (BFS/DFS)

🔹 Medium:
✅ Number of Islands (LC 200)
✅ Rotten Oranges (LC 994)
✅ Course Schedule (LC 207)

🔹 Hard:
✅ Word Ladder (LC 127)

9️⃣ Dynamic Programming (DP)

🔹 Easy:
✅ Climbing Stairs (LC 70)

🔹 Medium:
✅ House Robber (LC 198)
✅ Unique Paths (LC 62)
✅ Longest Increasing Subsequence (LC 300)
✅ Coin Change (LC 322)

🔹 Hard:
✅ Regular Expression Matching (LC 10)

🔟 Bit Manipulation

🔹 Easy:
✅ Single Number (LC 136)

🔹 Medium:
✅ Reverse Bits (LC 190)

📌 How to Approach?

1. Start with Easy Problems (~30%)


2. Move to Medium Problems (~50%)

3. Attempt Hard Problems Last (~20%)

4. Practice 2-3 Problems Daily

5.

You might also like