Some of the problems I solved and the scores I achieved are listed below.
| Difficulty | Problem name | Language | Best Runtime (faster than)* | Best Memory Usage (less than)* |
|---|---|---|---|---|
| * Hard | 23. Merge k Sorted Lists | C++ | * 96.91% | * 98.33% |
| * Hard | 25. Reverse Nodes in k-Group | C++ | * 96.42% | * 77.62% |
| * Hard | 903. Valid Permutations for DI Sequence | C++ | * 100% | 60.91% |
| Medium | 2. Add Two Numbers | C | * 99.84% | * 99.79% |
| Medium | 2. Add Two Numbers | C++ | * 96.27% | * 93.47% |
| Medium | 22. Generate Parentheses | C++ | * 100.00% | * 95.88% |
| Medium | 31. Next Permutation | C++ | * 100.00% | * 73.87% |
| Medium | 46. Permutations | C++ | * 100.00% | * 74.02% |
| Medium | 94. Binary Tree Inorder Traversal(iterative, destructive) | C++ | * 100.00% | * 99.71% |
| Medium | 94. Binary Tree Inorder Traversal(iterative, dynamic) | C++ | * 100.00% | * 97.08% |
| Medium | 94. Binary Tree Inorder Traversal(recursive) | C++ | * 100.00% | 5.69% |
| Medium | 59. Spiral Matrix II | Kotlin | * 100.00% | 57.78 % |
| Medium | 78. Subsets | Kotlin | * 98.74% | * 77.36% |
| Medium | 144. Binary Tree Preorder Traversal | C++ | * 100.00% | * 94.75% |
| Medium | 208. Implement Trie (Prefix Tree) | Java | * 95.50% | * 92.99% |
| Medium | 241. Different Ways to Add Parentheses | C++ | 39.96% | 7.49% |
| Medium | 450. Delete Node in a BST | C++ | * 97.52% | * 95.46% |
| Medium | 701. Insert into a Binary Search Tree | C++ | * 74.15% | 5.18% |
| Easy | 13. Roman to Integer | C | * 100.00% | * 98.65% |
| Easy | 83. Remove Duplicates from Sorted List(iterative) | C++ | * 98.56% | * 99.78% |
| Easy | 83. Remove Duplicates from Sorted List(recursive) | C++ | * 98.56% | * 99.78% |
| Easy | 121. Best Time to Buy and Sell Stock | C++ | * 99.74% | * 99.03% |
| Easy | 141. Linked List Cycle.kt | Kotlin | * 98.50% | 40.00% |
| Easy | 160. Intersection of Two Linked Lists | C++ | * 95.01% | * 85.32% |
| Easy | 203. Remove Linked List Elements | C++ | * 98.71% | * 99.75% |
| Easy | 206. Reverse Linked List | Kotlin | * 98.40% | 32.37% |
| Easy | 234. Palindrome Linked List | C++ | * 99.95% | * 97.36% |
| Easy | 237. Delete Node in a Linked List.kt | Kotlin | * 100.00% | 15.25% |
| Easy | 876. Middle of the Linked List | C++ | * 100.00% | * 100.00% |
| Easy | 1290. Convert Binary Number in a Linked List to Integer | Kotlin | * 89.87% | 16.03 |
*Runtime: Faster than xx.xx% of online submissions (of the language used) for the problem. Higher % is better.
*Memory Usage: Less than xx.xx% of online submissions (of the language used) for the problem. Higher % is better.