| 1. | Totally Normal – Determine if Two Strings Are Close – 1657 | 9 | |
|
| 2. | Balls Fall Up – Where Will the Ball Fall – Leetcode 1706 | 5 | |
|
| 3. | Goodbye | 3 | |
|
| 4. | Dit dah dit dit dah – Unique Morse Code Words – Leetcode 804 | 3 | |
|
| 5. | SHOT THROUGH THE HEART – Minimum Number of Arrows to Burst Balloons – Leetcode 452 | 3 | |
|
| 6. | Déjà Vu – Remove Duplicates from Sorted Array – Leetcode 26 | 2 | |
|
| 7. | Funny sliding windows – Leetcode 729 – My Calendar I | 2 | |
|
| 8. | This MEDIUM stumped me! – Perfect Squares – Leetcode 279 | 2 | |
|
| 9. | r1c1 – Valid Sudoku – Leetcode 36 | 2 | |
|
| 10. | Noice. – Maximum 69 Number – Leetcode 1323 | 2 | |
|
| 11. | Yuck! – Ugly Number – Leetcode 263 | 2 | |
|
| 12. | 100 SUBS! – Odd Even Linked List –Leetcode 328 | 1 | |
|
| 13. | INTERNET, MY BELOVED – Non-decreasing Subsequences – Leetcode 491 | 1 | |
|
| 14. | A star solution – Shortest Path in a Grid with Obstacles Elimination – Leetcode 1293 | 1 | |
|
| 15. | Counting mirrors – Longest Palindrome by Concatenating Two Letter Words – Leetcode 2131 | 1 | |
|
| 16. | Only a little googling! – Minimum Window Substring – Leetcode 76 | 1 | |
|
| 17. | Bit twiddling shenanigans! – Power of Four – Leetcode 342 | 1 | |
|
| 18. | Lazy Leaf Crunching – Leaf-Similar Trees – Leetcode 872 | 0 | |
|
| 19. | Overlapper! – Insert Interval – Leetcode 57 | 0 | |
|
| 20. | Balancing Act – Determine if String Halves Are Alike – Leetcode 1704 | 0 | |
|
| 21. | Easy Sneazy – Count Odd Numbers in an Interval Range – Leetcode 1523 | 0 | |
|
| 22. | Mutating Graphs! – Minimum Genetic Mutation – Leetcode 433 | 0 | |
|
| 23. | A jump to the left! – N-ary Tree Level Order Traversal – Leetcode 429 | 0 | |
|
| 24. | Recursively recursing – Path Sum – Leetcode 112 | 0 | |
|
| 25. | Speedy Turtles – Delete the Middle Node of a Linked List – Leetcode 2095 | 0 | |
|
| 26. | Probably correct... – Insert Delete GetRandom O(1) – Leetcode 380 | 0 | |
|
| 27. | Indexing madness! – Zigzag Conversion – Leetcode 6 | 0 | |
|
| 28. | No trees at all! – Binary Trees with Factors – Leetcode 823 | 0 | |
|
| 29. | To recurse, or not to recurse... – Search in a Binary Search Tree – Leetcode 700 | 0 | |
|
| 30. | No, it's not LISP – Construct String from Binary Tree – Leetcode 606 | 0 | |
|
| 31. | A bit of clever counting... – Leetcode 62 – Unique paths | 0 | |
|
| 32. | Binary searching a tree?! – Count Complete Tree Nodes – Leetcode 222 | 0 | |
|
| 33. | Euclid-ish...? – Greatest Common Divisor of Strings – Leetcode 1071 | 0 | |
|
| 34. | MinMaxing FTW – Maximum Difference Between Node and Ancestor – Leetcode 1026 | 0 | |
|
| 35. | Stringy Pancakes – Make The String Great – Leetcode 1544 | 0 | |
|
| 36. | Party Popper – Minimum Time to Make Rope Colorful – Leetcode 1578 | 0 | |
|
| 37. | Yet Another Graph Search – Minimum Time to Collect All Apples in a Tree – Leetcode 1443 | 0 | |
|
| 38. | Matrix madness! – Maximum Length of Repeated Subarray – Leetcode 718 | 0 | |
|
| 39. | Judgey McJudgerson – Find the Town Judge – Leetcode 997 | 0 | |
|
| 40. | Let's go chunk-hunting... – Shortest Unsorted Continuous Subarray – Leetcode 581 | 0 | |
|
| 41. | Complexity Progression – Contains Duplicate II – Leetcode 219 | 0 | |
|
| 42. | Don't be cheeky now – Encode and Decode TinyURL – Leetcode 535 | 0 | |
|
| 43. | Gettin' Mathsy – Minimum Rounds to Complete All Tasks – Leetcode 2244 | 0 | |
|
| 44. | Recursive index management – Convert Sorted Array to Binary Search Tree – Leetcode 108 | 0 | |
|
| 45. | I'm Back! – Detect Capital – Leetcodee 520 | 0 | |
|
| 46. | Is this actually medium? – Peeking Iterator – Leetcode 284 | 0 | |
|
| 47. | APL hacking – Increasing Triplet Subsequence – Leetcode 334 | 0 | |
|
| 48. | Left or right!? – Convert BST to Greater Tree – Leetcode 538 | 0 | |
|
| 49. | First try!? – Nearest Exist from Entrance in Maze – Leetcode 1926 | 0 | |
|
| 50. | I think this might be a graph problem... – Smallest String With Swaps – Leetcode 1202 | 0 | |
|
| 51. | Speak up! – Count and Say – Leetcode 38 | 0 | |
|
| 52. | Tri-way Tribonacci – N-th Tribonacci Number – Leetcode 1137 | 0 | |
|
| 53. | Racing Rabbit – Middle of the Linked List – Leetcode 876 | 0 | |
|
| 54. | Mixing methods! – Range Sum of BST – Leetcode 938 | 0 | |
|
| 55. | Special cases... – Word Search – Leetcode 79 | 0 | |
|
| 56. | Push-up trees? – Add One Row to Tree – Leetcode 623 | 0 | |
|
| 57. | Gettin' sneaky with the stack – Palindrome Linked List – Leetcode 234 | 0 | |
|
| 58. | Scanning and swapping... – Reverse Vowels of a String – Leetcode 345 | 0 | |
|
| 59. | Fire the Canon! – Group Anagrams – Leetcode 49 | 0 | |
|
| 60. | I'm SO confused... – Find Closest Node to Given Two Nodes – Leetcode 2359 | 0 | |
|
| 61. | BONUS: Using actually O(1) space! – Palindrome Linked List – Leetcode 234 | 0 | |
|
| 62. | Colouring in time! – Is Graph Bipartite? – Leetcode 785 | 0 | |
|
| 63. | It's basically inverting a dict, right? – Find Duplicate File in System – Leetcode 609 | 0 | |
|
| 64. | Dynamically going up – Longest Increasing Subsequence – Leetcode 300 | 0 | |
|
| 65. | I made that look difficult... – Counting Bits – Leetcode 338 | 0 | |
|
| 66. | Stacking Branches – Binary Tree Preorder Traversal – Leetcode 144 | 0 | |
|
| 67. | Snip, snip! – Trim a Binary Search Tree – Leetcode 669 | 0 | |
|
| 68. | Quick Maths – Power of Three – Leetcode 326 | 0 | |
|
| 69. | Pointing in all the wrong directions – Recover Binary Search Tree – Leetcode 99 | 0 | |
|
| 70. | Transpositionality! – Delete Columns to Make Sorted – Leetcode 944 | 0 | |
|
| 71. | This sliding window was hard! – Continuous Subarray Sum – Leetcode 523 | 0 | |
|
| 72. | Funky Tree Climbing – Longest Path With Different Adjacent Characters – Leetcode 2246 | 0 | |
|
| 73. | Roman backstroke! – Roman to Integer – Leetcode 13 | 0 | |
|
| 74. | Short and sweet! – Shuffle the Array – Leetcode 1470 | 0 | |
|
| 75. | Python makes it TOO easy! – Check If Two String Arrays are Equivalent – Leetcode 1662 | 0 | |
|
| 76. | A proto-quicksort? – Sort Array By Parity – Leetcode 905 | 0 | |
|
| 77. | Setting stones – Most Stones Removed with Same Row or Column – Leetocde 947 | 0 | |
|
| 78. | All about that trace – Lowest Common Ancestor of a Binary Search Tree – Leetcode 235 | 0 | |
|
| 79. | Sneaky Evens... – Longest Palindromic Substring – Leetcode 5 | 0 | |
|
| 80. | Keep marching rightward! – Increasing Order Search Tree – Leetcode 897 | 0 | |
|
| 81. | Sneaky A's – Break a Palindrome – Leetcode 1328 | 0 | |
|
| 82. | Skips and Jumps – Online Stock Span – Leetcode 901 | 0 | |
|
| 83. | Absolute madness – Minimum Average Difference – Leetcode 2256 | 0 | |
|
| 84. | We create LIFE! - Game of Life - Leetcode 289 | 0 | |
|
| 85. | It's not what I thought! – Image Overlap – Leetcode 835 | 0 | |
|
| 86. | Maybe INCORRECT? – Longest Consecutive Sequence – Leetcode 128 | 0 | |
|
| 87. | Interval... Trees...? – My Calendar III – Leetcode 732 | 0 | |
|
| 88. | Stack Pointers – Remove All Adjacent Duplicates In String – Leetcode 1047 | 0 | |
|
| 89. | BONUS – Solved! – Valid Sudoku – Leetcode 36 | 0 | |
|
| 90. | Using the right data structure helps... – Min Cost to Connect All Points – Leetcode 1584 | 0 | |
|
| 91. | Sneaky Sorts! – Rectangle Area – Leetcode 223 | 0 | |
|
| 92. | Spinning rings! – Rotate Image – Leetcode 48 | 0 | |
|
| 93. | Smart Indices – Toeplitz Matrix – Leetcode 766 | 0 | |
|
| 94. | Good Vs Evil! – Count the Good Nodes in Binary Tree – Leetcode 1448 | 0 | |
|
| 95. | Counting counts – Unique Number of Occurrences – Leetcode 1207 | 0 | |
|
| 96. | It's always too slow... – Concatenation of Consecutive Binary Numbers – Leetcode 1680 | 0 | |
|
| 97. | Adding carefully! – Set Mismatch – Leetcode 645 | 0 | |
|
| 98. | Pan-language Pangrams – Check if the Sentence Is Pangram – Leetcode 1832 | 0 | |
|
| 99. | Gotta go fast – Design HashMap – Leetcode 706 | 0 | |
|
| 100. | Boustrophedonning – Snakes and Ladders – Leetcode 909 | 0 | |
|
