Problems

# Status Problem Level Completes Likes
211

Backtracking - SUDOKU Solver

Hard % 0
212

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 0
213

Dynamic Programming - Minimum Coin Change Problem

Medium % 0
214

Merge K Sorted Arrays

Hard % 0
215

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

Beginner % 0
216

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

Medium % 1
217

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

Beginner % 0
218

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

Hard % 0
220

Diameter Of a Binary Tree

Hard % 1
221

Do the Reverse Level Order Traversal in a binary tree

Medium % 0
222

Find the Deepest Node in a Binary Tree.

Medium % 0
224

Binary Min-Max Heap Implementation

Hard % 0
225

Find numbers that are palindrome in the decimal and octal Representations

Beginner % 0
226

Find All the Well Ordered Permutations of a Given String.

Medium % 0
227

Construct a Special Triangle from a Given Array

Beginner % 0
228

Colorful Numbers

Hard % 0
229

Goldbach's Conjecture

Beginner % 0
231

Convert Decimal into Irreducible Fraction

Beginner % 0
232

Clock Angle Problem

Beginner % 1
234

Track the Maximum Element in a Stack.

Medium % 0
236

Towers Of Hanoi

Beginner % 0
237

Generate All Strings of n bits.

Medium % 0
238

Find The Missing Duplicate in a Given Array.

Beginner % 0
239

Alternate Splitting of a given Linked List

Medium % 0
240

Reverse The Doubly Linked List

Medium % 0
241

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

Medium % 0
243

Delete X Nodes After Y Nodes In a Linked List

Beginner % 0
244

Merge Sort in a Linked list

Medium % 0
245

Merge a Linked list into another Linked List at Alternate Positions.

Medium % 0

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

Merge a Linked list into another Linked List at Alternate Positions.