The document outlines a comprehensive roadmap for practicing coding problems across various data structures and algorithms. It includes categories such as Linked Lists, Binary Trees, Recursion & Backtracking, Dynamic Programming, and more, with specific problems listed under each category. This structured approach is aimed at enhancing problem-solving skills in preparation for coding interviews and competitions.
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 ratings0% found this document useful (0 votes)
6 views7 pages
Ilovepdf Merged 1
The document outlines a comprehensive roadmap for practicing coding problems across various data structures and algorithms. It includes categories such as Linked Lists, Binary Trees, Recursion & Backtracking, Dynamic Programming, and more, with specific problems listed under each category. This structured approach is aimed at enhancing problem-solving skills in preparation for coding interviews and competitions.
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/ 7
■ Linked List (15)
■ Reverse a Linked List
■ Detect Cycle in Linked List ■ Merge Two Sorted Lists ■ Intersection of Two Linked Lists ■ Remove Nth Node From End ■ Add Two Numbers ■ Palindrome Linked List ■ Copy List with Random Pointer ■ Rotate List ■ Sort List ■ Linked List Cycle II ■ Reorder List ■ Swap Nodes in Pairs ■ Flatten Multilevel Doubly Linked List ■ Odd Even Linked List ■ Binary Trees (15) ■ Inorder Traversal ■ Preorder Traversal ■ Postorder Traversal ■ Level Order Traversal ■ Maximum Depth of Binary Tree ■ Diameter of Binary Tree ■ Check if Tree is Balanced ■ Invert Binary Tree ■ Lowest Common Ancestor ■ Serialize and Deserialize ■ Construct Binary Tree from Inorder and Preorder ■ Path Sum ■ Symmetric Tree ■ Zigzag Level Order ■ Tree from Postorder and Inorder ■ Recursion & Backtracking (15) ■ Subsets ■ Permutations ■ Combination Sum ■ Letter Combinations of a Phone Number ■ Sudoku Solver ■ N-Queens ■ Word Search ■ Generate Parentheses ■ Palindrome Partitioning ■ Rat in a Maze ■ Tug of War ■ Combination Sum II ■ All Unique Permutations ■ Word Break ■ Generate Subsets with Duplicates ■ Sliding Window & Two Pointers (15) ■ Longest Substring Without Repeating Characters ■ Minimum Window Substring ■ Maximum Points from Cards ■ Longest Repeating Character Replacement ■ Sliding Window Maximum ■ Subarray Product Less Than K ■ Container With Most Water ■ Trapping Rain Water ■ Remove Duplicates ■ 3Sum ■ 4Sum ■ Merge Sorted Array ■ Find All Anagrams ■ Move Zeroes ■ Find Minimum in Rotated Sorted Array ■ Dynamic Programming (20) ■ Fibonacci Sequence ■ Climbing Stairs ■ House Robber ■ House Robber II ■ Coin Change ■ Longest Increasing Subsequence ■ Longest Common Subsequence ■ Edit Distance ■ 0/1 Knapsack ■ Partition Equal Subset Sum ■ Decode Ways ■ Jump Game ■ Word Break ■ Maximal Square ■ Palindromic Substrings ■ Unique Paths ■ Burst Balloons ■ Wildcard Matching ■ Interleaving String ■ Paint House ■ Greedy Algorithms (10) ■ Jump Game ■ Gas Station ■ Candy Distribution ■ Meeting Rooms ■ Activity Selection ■ Fractional Knapsack ■ Job Scheduling ■ Minimum Platforms ■ Reorganize String ■ Minimum Number of Arrows to Burst Balloons ■ Sorting & Searching (10) ■ Merge Sort ■ Quick Sort ■ Binary Search ■ Search in Rotated Sorted Array ■ Kth Largest Element ■ Peak Element ■ Find First and Last Position ■ Search Insert Position ■ Median of Two Sorted Arrays ■ Count Inversions ■ Binary Search Trees (10) ■ Validate BST ■ Insert into BST ■ Delete Node in BST ■ Kth Smallest Element in BST ■ Convert BST to Greater Tree ■ Lowest Common Ancestor in BST ■ Recover Binary Search Tree ■ Range Sum of BST ■ Trim a BST ■ BST Iterator ■ Graphs (20) ■ BFS & DFS of Graph ■ Cycle Detection (Undirected & Directed) ■ Topological Sort ■ Course Schedule ■ Number of Islands ■ Flood Fill ■ Clone Graph ■ Word Ladder ■ Alien Dictionary ■ Safe States ■ Detect Bridges ■ Tarjan’s Algorithm ■ Articulation Points ■ Bicolored Graph ■ Rotten Oranges ■ Count Components ■ Water Jug Problem ■ Graph Coloring ■ Critical Connections ■ Bellman-Ford ■■ Shortest Paths (10) ■ Dijkstra’s Algorithm ■ Bellman-Ford ■ Floyd-Warshall ■ Cheapest Flights Within K Stops ■ Network Delay Time ■ Shortest Path in Binary Matrix ■ Path with Minimum Effort ■ Minimum Cost Path ■ Fuel Stops ■ Shortest Path in DAG ■ Bit Manipulation (10) ■ Single Number I & II ■ Count Set Bits ■ Power of Two ■ Bitmask Subsets ■ XOR of All Subsets ■ Divide Without Operators ■ Bitwise AND Range ■ Max XOR ■ Duplicate Number ■ Min XOR Pair ■ Mathematics (10) ■ GCD/LCM ■ Sieve of Eratosthenes ■ Count Primes ■ Fast Power ■ Prime Factorization ■ Mod Inverse ■ Wilson’s Theorem ■ Chinese Remainder Theorem ■ Factorial Digits ■ Trailing Zeroes ■ Tries & Strings (10) ■ Implement Trie ■ Word Search II ■ Longest Word ■ Replace Words ■ Suffix Trie ■ Count Distinct Substrings ■ Aho-Corasick ■ Rabin-Karp ■ KMP Algorithm ■ Longest Repeated Substring ■■ Heaps (10) ■ Kth Largest Element ■ K Closest Points ■ Top K Frequent Words ■ Merge K Lists ■ Median from Stream ■ Sliding Window Median ■ Reorganize String ■ Task Scheduler ■ Ugly Number II ■ Min Cost to Connect Ropes ■ Disjoint Set (10) ■ Union by Rank + Path Compression ■ Cycle Detection ■ Count Components ■ Redundant Connection ■ Accounts Merge ■ Stones Removed ■ Kruskal’s Algorithm ■ Equation Satisfiability ■ Longest Consecutive DSU ■ Island Counting DSU ■ Segment Trees & BIT (10) ■ Segment Tree Build ■ Range Sum Query ■ Range Min Query ■ Lazy Propagation ■ Fenwick Tree ■ 2D BIT ■ Kth Order Statistic ■ Inversion Count ■ Count Smaller After Self ■ Dynamic Range Sum ■ Simulation & Design (15) ■ Game of Life ■ Snake Game ■ LRU Cache ■ Twitter Clone ■ Tic Tac Toe ■ Browser History ■ Battleship Game ■ Maze Solver ■ Elevator System ■ Parking Lot ■ Spreadsheet Parser ■ File System ■ Snake Ladder ■ Knight Moves ■ Sudoku Generator ■ HackWithInfy 2025 – 275 Problem Practice Roadmap ■ Arrays & Strings (20) ■ Two Sum ■ Best Time to Buy and Sell Stock ■ Merge Intervals ■ Majority Element ■ Rotate Array ■ Kadane’s Algorithm ■ Longest Consecutive Sequence ■ Set Matrix Zeroes ■ Group Anagrams ■ Longest Substring Without Repeating Characters ■ Palindrome Check ■ Sliding Window Maximum ■ Move Zeroes ■ Trapping Rain Water ■ Product of Array Except Self ■ Valid Anagram ■ Longest Common Prefix ■ Zigzag Conversion ■ Spiral Matrix ■ Word Search ■ Hashing & Maps (15) ■ Subarray Sum Equals K ■ Longest Subarray with Sum K ■ Count Distinct Elements in Every Window ■ Top K Frequent Elements ■ Isomorphic Strings ■ Longest Palindromic Substring ■ Minimum Window Substring ■ Four Sum ■ Ransom Note ■ Group Shifted Strings ■ Repeated DNA Sequences ■ Anagrams in a String ■ Custom Sort String ■ Max Points on a Line ■ Count Pairs with Given Sum ■ Stack & Queue (15) ■ Valid Parentheses ■ Min Stack ■ Next Greater Element ■ Daily Temperatures ■ Evaluate Reverse Polish Notation ■ Sliding Window Maximum ■ Implement Queue using Stacks ■ Design Circular Queue ■ Decode String ■ Remove K Digits ■ Basic Calculator ■ Histogram Area ■ Stack Using Queues ■ Largest Rectangle in Histogram ■ Reverse Polish Notation