# Status Problem video Level Completes Likes 172 Dynamic Programming - Longest Common Substring Medium % 0 171 Dynamic Programming - Longest Common Subsequence Medium % 0 170 Dynamic Programming - Rod Cutting Problem Medium % 1 169 Dynamic Programming - Coin Change Problem Medium % 1 168 Dynamic Programming - Minimum Cost Path Problem Medium % 1 167 Generate Well Ordered Passwords of a Given Length K Medium % 0 166 All N Length Strings from Given String of Length K Medium % 0 163 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 160 Dynamic Programming - Longest Increasing Subsequence Medium % 1 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 142 Locate the Farthest Left Node on the Bottom Level Medium % 0 140 Rearrange Array Elements (A[i] = i) | In-place Approach Medium % 0 135 Find Paths with Sum in Binary Tree Medium % 0 133 Reverse Level Order Traversal of Binary Trees Medium % 0 132 Find the Deepest Node in a Binary Tree Medium % 1 131 Find the Height of a tree without using Recursion Medium % 0 126 Generate All Permutations of a String (Well-Ordered) Medium % 0 125 Find the Increasing Triplet Sub-sequence in an array Medium % 0 117 Stack with Max Tracking: Find the Largest Element (Optimized) Medium % 1 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 114 Counting Sort Algorithm Medium % 0 112 Generate All n-Bit Binary Strings Medium % 1 108 Queue with Stacks: Efficient Implementation Using Stack Operations Medium % 0 107 Alternate Splitting of a given Linked List Medium % 0 106 Reverse a Doubly-Linked List (In-place Algorithm) Medium % 0 105 Swapping Nodes in a Linked List (Kth Position) Medium % 0 104 Print the Bottom View of a Binary Tree Medium % 0 102 Merge Sort for Linked Lists (In-place Algorithm) Medium % 0 101 Merge a Linked list into another Linked List at Alternate Positions Medium % 0 96 Print The Top View of a Binary Tree Medium % 0 92 Check if Array Contains All Elements Of Some Given Range Medium % 0 90 Find Subarray with Sum Equal to a Target Value Medium % 0 89 Find Smallest Subarray Exceeding a Target Sum Medium % 0 86 Find Kth Smallest or Largest element in an Array Medium % 0 85 Find Maximum Distance Between Increasing Elements in Array Medium % 0 Dynamic Programming - Longest Common Substring Dynamic Programming - Longest Common Subsequence Dynamic Programming - Rod Cutting Problem Dynamic Programming - Coin Change Problem Dynamic Programming - Minimum Cost Path Problem Generate Well Ordered Passwords of a Given Length K All N Length Strings from Given String of Length K Dynamic Programming - Maximum size square sub-matrix with all 1s Dynamic Programming - Longest Increasing Subsequence Dynamic Programming - Minimum Coin Change Problem Locate the Farthest Left Node on the Bottom Level Rearrange Array Elements (A[i] = i) | In-place Approach Find Paths with Sum in Binary Tree Reverse Level Order Traversal of Binary Trees Find the Deepest Node in a Binary Tree Find the Height of a tree without using Recursion Generate All Permutations of a String (Well-Ordered) Find the Increasing Triplet Sub-sequence in an array Stack with Max Tracking: Find the Largest Element (Optimized) Generate All Balanced Parentheses Combinations (N Pairs) Counting Sort Algorithm Generate All n-Bit Binary Strings Queue with Stacks: Efficient Implementation Using Stack Operations Alternate Splitting of a given Linked List Reverse a Doubly-Linked List (In-place Algorithm) Swapping Nodes in a Linked List (Kth Position) Print the Bottom View of a Binary Tree Merge Sort for Linked Lists (In-place Algorithm) Merge a Linked list into another Linked List at Alternate Positions Print The Top View of a Binary Tree Check if Array Contains All Elements Of Some Given Range Find Subarray with Sum Equal to a Target Value Find Smallest Subarray Exceeding a Target Sum Find Kth Smallest or Largest element in an Array Find Maximum Distance Between Increasing Elements in Array 1 2 3 4 5 6 7
