Problems

# Status Problem Level Completes Likes
71

Dynamic Programming - Subset Sum Problem

Hard % 0
72

The Word Break Problem

Hard % 0
73

Backtracking - Knight's Tour Problem

Hard % 0
74

Backtracking - Search a Word In a Matrix

Hard % 0
75

Backtracking - N Queens Problem - Better Solution

Hard % 0
76

Backtracking - N Queens Problem

Hard % 0
77

Breadth-First Search/Traversal in a Graph.

Hard % 0
78

Backtracking - Rat In A Maze Puzzle

Hard % 0
79

Backtracking - SUDOKU Solver

Hard % 0
80

Merge K Sorted Arrays

Hard % 0
81

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

Hard % 0
82

Diameter Of a Binary Tree

Hard % 1
83

Binary Min-Max Heap Implementation

Hard % 0
84

Colorful Numbers

Hard % 0
88

AVL Tree - Insertion

Hard % 0
89

Construct a binary tree from given Inorder and Level Order Traversal

Hard % 0
90

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)

Hard % 0
91

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Hard % 0
93

Inorder Predecessor and Successor in Binary Search Tree

Hard % 0
94

Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space

Hard % 0
95

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.

Hard % 0
97

Find the Distance between Two Nodes of a Binary Tree.

Hard % 0
98

Construct a binary tree from given Inorder and Postorder Traversal

Hard % 0
99

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Hard % 0
100

Make a Binary Tree from Given Inorder and Preorder Traveral.

Hard % 0
102

Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern

Hard % 0
105

In a Binary Tree, Create Linked Lists of all the nodes at each depth.

Hard % 0

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Backtracking - Knight's Tour Problem

Backtracking - Search a Word In a Matrix

Backtracking - N Queens Problem - Better Solution

Backtracking - N Queens Problem

Breadth-First Search/Traversal in a Graph.

Backtracking - Rat In A Maze Puzzle

Backtracking - SUDOKU Solver

Merge K Sorted Arrays

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

Diameter Of a Binary Tree

Binary Min-Max Heap Implementation

Colorful Numbers

AVL Tree - Insertion

Construct a binary tree from given Inorder and Level Order Traversal

Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion)

Construct Binary Search Tree from a given Preorder Traversal using Recursion

Inorder Predecessor and Successor in Binary Search Tree

Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.

Find the Distance between Two Nodes of a Binary Tree.

Construct a binary tree from given Inorder and Postorder Traversal

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Make a Binary Tree from Given Inorder and Preorder Traveral.

Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern

In a Binary Tree, Create Linked Lists of all the nodes at each depth.