# Status Problem video Level Completes Likes
222

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Hard % 0
221

Identifying Maximum Gain from Sequential Elements

Medium % 0
219

Find the two repeating elements in a given array | 6 Approaches

Medium % 1
217

Find two elements whose sum is closest to zero

Medium % 1
214

Find the last non repeating character in a given string.

Beginner % 0
213

Find the last repeating character in a given string

Beginner % 0
211

Find the first repeating character in a given string

Beginner % 0
209

Find longest Snake sequence in a given matrix

Medium % 1
208

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Medium % 1
207

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Medium % 1
206

Reverse the given Array without using built in function

Beginner % 0
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
194

Introduction to Threaded Binary Tree

Medium % 0
193

Implement Stack Using Linked List

Beginner % 0
192

Doubly Linked List Complete Implementation

Beginner % 0
191

Circular Linked List Complete Implementation

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
183

Convert binary tree to its Sum tree

Medium % 1
182

Binary Tree-Postorder Traversal - Non Recursive Approach

Beginner % 0

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Identifying Maximum Gain from Sequential Elements

Find the two repeating elements in a given array | 6 Approaches

Find two elements whose sum is closest to zero

Find the last non repeating character in a given string.

Find the last repeating character in a given string

Find the first repeating character in a given string

Find longest Snake sequence in a given matrix

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Reverse the given Array without using built in function

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

Introduction to Threaded Binary Tree

Implement Stack Using Linked List

Doubly Linked List Complete Implementation

Circular Linked List Complete Implementation

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

Convert binary tree to its Sum tree

Binary Tree-Postorder Traversal - Non Recursive Approach