The document lists commonly asked graph and dynamic programming (DP) problems from LeetCode, categorized by topic and difficulty level. It includes a total of 75 problems, with various challenges ranging from easy to hard. The problems cover a wide array of concepts in graphs and DP, making it a useful resource for coding practice.
The document lists commonly asked graph and dynamic programming (DP) problems from LeetCode, categorized by topic and difficulty level. It includes a total of 75 problems, with various challenges ranging from easy to hard. The problems cover a wide array of concepts in graphs and DP, making it a useful resource for coding practice.
1 Course Schedule Graphs Medium 2 Course Schedule II Graphs Medium 3 Redundant Connection Graphs Medium 4 Number of Connected Components In An Undirected Graph Graphs Medium 5 Graph Valid Tree Graphs Medium 6 Word Ladder Graphs Hard 7 Reconstruct Itinerary Graphs Hard 8 Number of Islands Graphs Medium 9 Clone Graph Graphs Medium 10 Max Area of Island Graphs Medium 11 Pacific Atlantic Water Flow Graphs Medium 12 Surrounded Regions Graphs Medium 13 Rotting Oranges Graphs Medium 14 Walls And Gates Graphs Medium 15 Min Cost to Connect All Points Graphs Medium 16 Network Delay Time Graphs Medium 17 Swim In Rising Water Graphs Hard 18 Alien Dictionary Graphs Hard 19 Cheapest Flights Within K Stops Graphs Medium
20 Coin Change DP Medium
21 Coin Change II DP Medium 22 Climbing Stairs DP Easy 23 House Robber DP Medium 24 House Robber II DP Medium 25 Jump Game DP Medium 26 Jump Game II DP Medium 27 Longest Increasing Subsequence DP Medium 28 Longest Common Subsequence DP Medium 29 Word Break Problem DP Medium 30 Combination Sum DP Medium 34 Decode Ways DP Medium 35 Unique Paths DP Medium 36 Pascal's Triangle DP Easy 37 Regular Expression Matching DP Hard 38 Race Car DP Hard 39 Min Cost Climbing Stairs DP Easy 40 Palindromic Substrings DP Medium 45 Maximum Product Subarray DP Medium 46 Longest Increasing Path In a Matrix DP Hard 47 Generate Parentheses DP Medium 48 Longest Valid Paranthesis DP Hard 49 Valid Parenthesis String DP Medium 50 Edit Distance DP Medium 51 Partition Equal Subset Sum DP Medium 52 Unique Paths DP Medium 53 Best Time To Buy and Sell Stocks DP Easy 54 Best Time To Buy and Sell Stocks II DP Medium 55 Best Time To Buy and Sell Stocks III DP Hard 56 Best Time To Buy and Sell Stocks IV DP Hard 57 Target Sum DP Medium 58 Interleaving String DP Medium 59 Regular Expression Matching DP Hard 60 Partition Labels DP Medium 61 Distinct Subsequences DP Hard 62 Burst Balloons DP Hard 63 Maximum Subarray DP Medium 64 Gas Station DP Medium 65 Hand of Straights DP Medium 66 Merge Triplets to Form Target Triplet DP Medium 67 Uncrossed Lines DP Hard 68 Split Array Largest Sum DP Hard 69 Minimum Number of Removals to Make Mountain Array DP Hard 70 Minimum Difference in Sums After Removal of Elements DP Hard 71 Number Of Dice Rolls With Target Sum DP Medium 72 WildCard Matching DP Hard 73 Perfect Squares DP Medium 74 Partition Array Into Two Arrays to Minimize Sum Difference DP Hard 75 Minimum insertions to make string palindrome DP Hard