| # | Status | Problem | video | Level | Completes | Likes |
|---|---|---|---|---|---|---|
| 161 |
|
The Word Break Problem |
Hard | % | 0 | |
| 158 |
|
Backtracking - Search a Word In a Matrix |
Hard | % | 0 | |
| 116 |
|
Generate All Balanced Parentheses Combinations (N Pairs) |
Medium | % | 1 | |
| 106 |
|
Reverse a Doubly-Linked List (In-place Algorithm) |
Medium | % | 0 | |
| 99 |
|
Construct a binary tree from given Inorder and Level Order Traversal |
Hard | % | 0 | |
| 48 |
|
Determining Whether a Given Binary Tree is a Binary Search Tree (BST) |
Medium | % | 1 |
