| S. No | Problem | Solutions |
|---|---|---|
| 1 | Two Sum. | O(n) |
| 2 | add-two-numbers. | <-> |
| 103 | Binary Tree Zigzag Level Order Traversal. | <-> |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal. | <-> |
| 108 | Convert Sorted Array to Binary Search Tree. | <-> |
| 143 | Reorder List. | <-> |
| 2154 | Keep Multiplying Found Values by Two. | <-> |
| 24 | Swap Nodes in Pairs. | <-> |
| 25 | Reverse Nodes in k-Group. | <-> |
| 344 | reverse-string. | <-> |
| 707 | Design Linked List. | <-> |
| 82 | Remove Duplicates from Sorted List II. | <-> |
| 199 | Binary Tree Right Side View. | <-> |
| 113 | Path Sum II. | <-> |
| 450 | Delete Node in a BST. | <-> |