# Status Problem video Level Completes Likes 186 Reverse a Linked List in groups of given size 'K' Medium % 0 175 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 171 Dynamic Programming - Longest Common Subsequence Medium % 0 165 Generate all combinations of length N Hard % 0 163 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 161 The Word Break Problem Hard % 0 160 Dynamic Programming - Longest Increasing Subsequence Medium % 1 158 Backtracking - Search a Word In a Matrix Hard % 0 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 142 Locate the Farthest Left Node on the Bottom Level Medium % 0 135 Find Paths with Sum in Binary Tree Medium % 0 132 Find the Deepest Node in a Binary Tree Medium % 1 117 Stack with Max Tracking: Find the Largest Element (Optimized) Medium % 1 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 108 Queue with Stacks: Efficient Implementation Using Stack Operations Medium % 0 107 Alternate Splitting of a given Linked List Medium % 0 102 Merge Sort for Linked Lists (In-place Algorithm) Medium % 0 89 Find Smallest Subarray Exceeding a Target Sum Medium % 0 85 Find Maximum Distance Between Increasing Elements in Array Medium % 0 Reverse a Linked List in groups of given size 'K' Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Longest Common Subsequence Generate all combinations of length N Dynamic Programming - Maximum size square sub-matrix with all 1s The Word Break Problem Dynamic Programming - Longest Increasing Subsequence Backtracking - Search a Word In a Matrix Dynamic Programming - Minimum Coin Change Problem Locate the Farthest Left Node on the Bottom Level Find Paths with Sum in Binary Tree Find the Deepest Node in a Binary Tree Stack with Max Tracking: Find the Largest Element (Optimized) Generate All Balanced Parentheses Combinations (N Pairs) Queue with Stacks: Efficient Implementation Using Stack Operations Alternate Splitting of a given Linked List Merge Sort for Linked Lists (In-place Algorithm) Find Smallest Subarray Exceeding a Target Sum Find Maximum Distance Between Increasing Elements in Array 1 2
