# Status Problem Level Completes Likes
211

Backtracking - Rat In A Maze Puzzle

Hard % 0
212

Backtracking - SUDOKU Solver

Hard % 0
213

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 1
214

Dynamic Programming - Minimum Coin Change Problem

Medium % 1
215

Merge K Sorted Arrays

Hard % 0
216

Find a Number occurring odd number of times in a Given array

Beginner % 1
217

Rearrange the Array of Given Range N, such that A[i]=i

Medium % 0
218

Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method

Beginner % 1
219

Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node

Hard % 0
221

Diameter Of a Binary Tree

Hard % 1
222

Do the Reverse Level Order Traversal in a binary tree

Medium % 0
223

Find the Deepest Node in a Binary Tree.

Medium % 1
225

Binary Min-Max Heap Implementation

Hard % 0
226

Find numbers that are palindrome in the decimal and octal Representations

Beginner % 0
227

Find All the Well Ordered Permutations of a Given String.

Medium % 0
228

Construct a Special Triangle from a Given Array

Beginner % 0
229

Colorful Numbers

Hard % 1
230

Goldbach's Conjecture

Beginner % 0
232

Convert Decimal into Irreducible Fraction

Beginner % 0
233

Clock Angle Problem

Beginner % 1
235

Track the Maximum Element in a Stack.

Medium % 1
237

Towers Of Hanoi

Beginner % 0
238

Generate All Strings of n bits.

Medium % 1
239

Find The Missing Duplicate in a Given Array.

Beginner % 1
240

Alternate Splitting of a given Linked List

Medium % 0
241

Reverse The Doubly Linked List

Medium % 0
242

Swap Kth Node from the front with the Kth Node from the End

Medium % 0
244

Delete X Nodes After Y Nodes In a Linked List

Beginner % 0
245

Merge Sort in a Linked list

Medium % 0

Backtracking - Rat In A Maze Puzzle

Backtracking - SUDOKU Solver

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Merge K Sorted Arrays

Find a Number occurring odd number of times in a Given array

Rearrange the Array of Given Range N, such that A[i]=i

Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method

Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node

Diameter Of a Binary Tree

Do the Reverse Level Order Traversal in a binary tree

Find the Deepest Node in a Binary Tree.

Binary Min-Max Heap Implementation

Find numbers that are palindrome in the decimal and octal Representations

Find All the Well Ordered Permutations of a Given String.

Construct a Special Triangle from a Given Array

Colorful Numbers

Goldbach's Conjecture

Convert Decimal into Irreducible Fraction

Clock Angle Problem

Track the Maximum Element in a Stack.

Towers Of Hanoi

Generate All Strings of n bits.

Find The Missing Duplicate in a Given Array.

Alternate Splitting of a given Linked List

Reverse The Doubly Linked List

Swap Kth Node from the front with the Kth Node from the End

Delete X Nodes After Y Nodes In a Linked List

Merge Sort in a Linked list