# Status Problem video Level Completes Likes
175

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
171

Dynamic Programming - Longest Common Subsequence

Medium % 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

Find the Deepest Left Node in a Binary Tree.

Medium % 0
132

Find the Deepest Node in a Binary Tree.

Medium % 1
117

Track the Maximum Element in a Stack.

Medium % 1
108

Implement Queue Using Stacks

Medium % 0
107

Alternate Splitting of a given Linked List

Medium % 0
102

Merge Sort in a Linked list

Medium % 0
89

In an Array, find the Smallest Subarray with Sum Greater than the Given Value

Medium % 0
85

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

Medium % 0

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Longest Common Subsequence

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

Find the Deepest Left Node in a Binary Tree.

Find the Deepest Node in a Binary Tree.

Track the Maximum Element in a Stack.

Implement Queue Using Stacks

Alternate Splitting of a given Linked List

Merge Sort in a Linked list

In an Array, find the Smallest Subarray with Sum Greater than the Given Value

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].