# Status Problem video Level Completes Likes
246

Dynamic programming – Minimum Jumps to reach to end

Hard % 0
245

Dynamic programming – Printer Problem | Leetcode

Hard % 0
233

Find the local minima in a given array

Medium % 0
203

Dynamic Programming - Coin In a Line Game Problem

Hard % 0
201

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

Hard % 0
198

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
188

Shortest Range in K-sorted Lists

Hard % 1
173

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

Hard % 0
162

Dynamic Programming - Subset Sum Problem

Hard % 0
161

The Word Break Problem

Hard % 0
159

Solve the Knight's Tour with Backtracking

Hard % 0
157

Backtracking - N Queens Problem - Better Solution

Hard % 0
156

Backtracking - N Queens Problem

Hard % 0
149

Backtracking - Rat In A Maze Puzzle

Hard % 0
148

Solve Sudoku Puzzles with Backtracking

Hard % 0
146

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 1

Dynamic programming – Minimum Jumps to reach to end

Dynamic programming – Printer Problem | Leetcode

Find the local minima in a given array

Dynamic Programming - Coin In a Line Game Problem

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

Kadane's Algorithm - Maximum Subarray Problem

Shortest Range in K-sorted Lists

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

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Solve the Knight's Tour with Backtracking

Backtracking - N Queens Problem - Better Solution

Backtracking - N Queens Problem

Backtracking - Rat In A Maze Puzzle

Solve Sudoku Puzzles with Backtracking

Dynamic Programming - Stairs Climbing Puzzle