# Status Problem video Level Completes Likes
204

Dynamic Programming - Edit Distance Problem

Hard % 2
203

Dynamic Programming - Coin In a Line Game Problem

Hard % 0
202

Dynamic Programming - Box Stacking Problem

Hard % 0
201

Dynamic Programming - Split the String into Minimum number of Palindromes.

Hard % 0
200

Dynamic Programming - Highway Billboard Problem

Hard % 0
199

Dynamic Programming - Maximum Subarray Problem

Medium % 0
198

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
197

Convert Binary Tree into Threaded Binary Tree

Hard % 0
196

Double Threaded Binary Tree Complete Implementation

Hard % 0
195

Single Threaded Binary Tree Complete Implementation

Hard % 0
193

Implement Stack Using Linked List

Beginner % 0
189

Convert BST to Greater Sum Tree

Medium % 0
188

Shortest Range in K-sorted Lists

Hard % 1
187

Reverse Alternative 'k' nodes in a Linked List.

Medium % 0
186

Reverse a Linked List in groups of given size 'K'

Medium % 0
185

Generate Maximum revenue by selling K tickets from N windows

Medium % 0
184

Get the Sum of all left leaves in a Binary tree

Beginner % 1
175

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
174

Dynamic Programming - Maximum Product Cutting Problem

Medium % 1
173

Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming)

Hard % 0
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
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
159

Solve the Knight's Tour with Backtracking

Hard % 0
158

Backtracking - Search a Word In a Matrix

Hard % 0

Dynamic Programming - Edit Distance Problem

Dynamic Programming - Coin In a Line Game Problem

Dynamic Programming - Box Stacking Problem

Dynamic Programming - Split the String into Minimum number of Palindromes.

Dynamic Programming - Highway Billboard Problem

Dynamic Programming - Maximum Subarray Problem

Kadane's Algorithm - Maximum Subarray Problem

Convert Binary Tree into Threaded Binary Tree

Double Threaded Binary Tree Complete Implementation

Single Threaded Binary Tree Complete Implementation

Implement Stack Using Linked List

Convert BST to Greater Sum Tree

Shortest Range in K-sorted Lists

Reverse Alternative 'k' nodes in a Linked List.

Reverse a Linked List in groups of given size 'K'

Generate Maximum revenue by selling K tickets from N windows

Get the Sum of all left leaves in a Binary tree

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Maximum Product Cutting Problem

Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming)

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

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

Solve the Knight's Tour with Backtracking

Backtracking - Search a Word In a Matrix