| 1. | Stacking Branches – Binary Tree Preorder Traversal – Leetcode 144 | 0 | |
|
| 2. | Python makes it TOO easy! – Check If Two String Arrays are Equivalent – Leetcode 1662 | 0 | |
|
| 3. | MinMaxing FTW – Maximum Difference Between Node and Ancestor – Leetcode 1026 | 0 | |
|
| 4. | BONUS – Solved! – Valid Sudoku – Leetcode 36 | 0 | |
|
| 5. | Catcatcatcat... – Concatenated Words – Leetcode 472 | 0 | |
|
| 6. | I Scream for... – Maximum Ice Cream Bars – Leetcode 1833 | 0 | |
|
| 7. | A proto-quicksort? – Sort Array By Parity – Leetcode 905 | 0 | |
|
| 8. | Keep marching rightward! – Increasing Order Search Tree – Leetcode 897 | 0 | |
|
| 9. | Let's go chunk-hunting... – Shortest Unsorted Continuous Subarray – Leetcode 581 | 0 | |
|
| 10. | Good Vs Evil! – Count the Good Nodes in Binary Tree – Leetcode 1448 | 0 | |
|
| 11. | I HATE this question! – Delete Node in a Linked List – Leetcode 237 | 0 | |
|
| 12. | Pure. Instinct. – Binary Tree Pruning – Leetcode 814 | 0 | |
|
| 13. | Lazy Leaf Crunching – Leaf-Similar Trees – Leetcode 872 | 0 | |
|
| 14. | Short and sweet! – Shuffle the Array – Leetcode 1470 | 0 | |
|
| 15. | Gotta go fast – Design HashMap – Leetcode 706 | 0 | |
|
| 16. | Packing those bits!– Design HashSet – Leetcode 705 | 0 | |
|
| 17. | All for the want of two lines – Path With Minimum Effort – Leetcode 1631 | 0 | |
|
| 18. | Recursively recursing – Path Sum – Leetcode 112 | 0 | |
|
| 19. | Sneaky Evens... – Longest Palindromic Substring – Leetcode 5 | 0 | |
|
| 20. | Overlapper! – Insert Interval – Leetcode 57 | 0 | |
|
| 21. | I'm SO confused... – Find Closest Node to Given Two Nodes – Leetcode 2359 | 0 | |
|
| 22. | Mixing methods! – Range Sum of BST – Leetcode 938 | 0 | |
|
| 23. | Confused by iterators! – Binary Search Tree Iterator – Leetcode 173 | 0 | |
|
| 24. | No, it's not LISP – Construct String from Binary Tree – Leetcode 606 | 0 | |
|
| 25. | Feature-length coding session! – Word Search II – Leetcode 212 | 0 | |
|
| 26. | The Hitchhikers Guide to Spelling – Verifying an Alien Dictionary – Leetcode 953 | 0 | |
|
| 27. | I made that look difficult... – Counting Bits – Leetcode 338 | 0 | |
|
| 28. | Dynamically going up – Longest Increasing Subsequence – Leetcode 300 | 0 | |
|
| 29. | Easy Sneazy – Count Odd Numbers in an Interval Range – Leetcode 1523 | 0 | |
|
| 30. | Going AROUND AND AROUND – Spiral Matrix II – Leetcode 59 | 0 | |
|
| 31. | Galloping challenge – Guess Number Higher or Lower – Leetcode 374 | 0 | |
|
| 32. | Party Popper – Minimum Time to Make Rope Colorful – Leetcode 1578 | 0 | |
|
| 33. | Pointing in all the wrong directions – Recover Binary Search Tree – Leetcode 99 | 0 | |
|
| 34. | Indexing madness! – Zigzag Conversion – Leetcode 6 | 0 | |
|
| 35. | I guess I can't be that lazy... – Time Based Key-Value Store – Leetcode 981 | 0 | |
|
| 36. | Don't be cheeky now – Encode and Decode TinyURL – Leetcode 535 | 0 | |
|
| 37. | Euclid-ish...? – Greatest Common Divisor of Strings – Leetcode 1071 | 0 | |
|
| 38. | Colouring in time! – Is Graph Bipartite? – Leetcode 785 | 0 | |
|
| 39. | Yet Another Graph Search – Minimum Time to Collect All Apples in a Tree – Leetcode 1443 | 0 | |
|
| 40. | Skips and Jumps – Online Stock Span – Leetcode 901 | 0 | |
|
| 41. | Short and Sweet – Sort Characters By Frequency – Leetcode 451 | 0 | |
|
| 42. | Left or right!? – Convert BST to Greater Tree – Leetcode 538 | 0 | |
|
| 43. | Speak up! – Count and Say – Leetcode 38 | 0 | |
|
| 44. | Snip, snip! – Trim a Binary Search Tree – Leetcode 669 | 0 | |
|
| 45. | Push-up trees? – Add One Row to Tree – Leetcode 623 | 0 | |
|
| 46. | Too many combinations! – Reordered Power of 2 – Leetcode 869 | 0 | |
|
| 47. | Polish Parsing – Basic Calculator – Leetcode 224 | 0 | |
|
| 48. | SemiQuickSelectSort – Top K Frequent Words – Leetcode 692 | 0 | |
|
| 49. | A bit of clever counting... – Leetcode 62 – Unique paths | 0 | |
|
| 50. | Absolute madness – Minimum Average Difference – Leetcode 2256 | 0 | |
|
| 51. | Asterix Mathematix– Integer to Roman – Leetcode 12 | 0 | |
|
| 52. | Binary searching a tree?! – Count Complete Tree Nodes – Leetcode 222 | 0 | |
|
| 53. | Stack Pointers – Remove All Adjacent Duplicates In String – Leetcode 1047 | 0 | |
|
| 54. | GOLF IT – Reverse Words in a String III – Leetcode 557 | 0 | | Golf It!
|
| 55. | Matrix madness! – Maximum Length of Repeated Subarray – Leetcode 718 | 0 | |
|
| 56. | Smart Indices – Toeplitz Matrix – Leetcode 766 | 0 | |
|
| 57. | Up and Down – Sum of Even Numbers After Queries – Leetcode 985 | 0 | |
|
| 58. | Recursive index management – Convert Sorted Array to Binary Search Tree – Leetcode 108 | 0 | |
|
| 59. | Pan-language Pangrams – Check if the Sentence Is Pangram – Leetcode 1832 | 0 | |
|
| 60. | Racing Rabbit – Middle of the Linked List – Leetcode 876 | 0 | |
|
| 61. | Funky Tree Climbing – Longest Path With Different Adjacent Characters – Leetcode 2246 | 0 | |
|
| 62. | Maybe INCORRECT? – Longest Consecutive Sequence – Leetcode 128 | 0 | |
|
| 63. | Sneaky A's – Break a Palindrome – Leetcode 1328 | 0 | |
|
| 64. | I think this might be a graph problem... – Smallest String With Swaps – Leetcode 1202 | 0 | |
|
| 65. | It's basically inverting a dict, right? – Find Duplicate File in System – Leetcode 609 | 0 | |
|
| 66. | Setting stones – Most Stones Removed with Same Row or Column – Leetocde 947 | 0 | |
|
| 67. | It's always too slow... – Concatenation of Consecutive Binary Numbers – Leetcode 1680 | 0 | |
|
| 68. | Complexity Progression – Contains Duplicate II – Leetcode 219 | 0 | |
|
| 69. | All about that trace – Lowest Common Ancestor of a Binary Search Tree – Leetcode 235 | 0 | |
|
| 70. | It's not what I thought! – Image Overlap – Leetcode 835 | 0 | |
|
| 71. | Is this actually medium? – Peeking Iterator – Leetcode 284 | 0 | |
|
| 72. | APL hacking – Increasing Triplet Subsequence – Leetcode 334 | 0 | |
|
| 73. | Beware the flood... – Number of Islands – Leetcode 200 | 0 | |
|
| 74. | Using the right data structure helps... – Min Cost to Connect All Points – Leetcode 1584 | 0 | |
|
| 75. | A jump to the left! – N-ary Tree Level Order Traversal – Leetcode 429 | 0 | |
|
| 76. | Phantom matrices? – Design Underground System – Leetcode 1396 | 0 | |
|
| 77. | Futzing with pointers – Kth Smallest Element in a BST – Leetcode 230 | 0 | |
|
| 78. | Transpositionality! – Delete Columns to Make Sorted – Leetcode 944 | 1 | |
|
| 79. | Hop-stopping – Cheapest Flights Within K Stops – Leetcode 787 | 1 | |
|
| 80. | Easy Win – Find Players With Zero or One Losses – Leetcode 2225 | 1 | |
|
| 81. | Adding carefully! – Set Mismatch – Leetcode 645 | 1 | |
|
| 82. | Mutating Graphs! – Minimum Genetic Mutation – Leetcode 433 | 1 | |
|
| 83. | The OTHER big end – Reduce Array Size to The Half – Leetcode 1338 | 1 | |
|
| 84. | One-handed puzzling – Validate Binary Search Tree – Leetcode 98 | 1 | |
|
| 85. | To recurse, or not to recurse... – Search in a Binary Search Tree – Leetcode 700 | 1 | |
|
| 86. | INTERNET, MY BELOVED – Non-decreasing Subsequences – Leetcode 491 | 1 | |
|
| 87. | Bit twiddling shenanigans! – Power of Four – Leetcode 342 | 1 | |
|
| 88. | No trees at all! – Binary Trees with Factors – Leetcode 823 | 1 | |
|
| 89. | SHOT THROUGH THE HEART – Minimum Number of Arrows to Burst Balloons – Leetcode 452 | 1 | |
|
| 90. | Special cases... – Word Search – Leetcode 79 | 1 | |
|
| 91. | False start! – Average of Levels in Binary Tree – Leetcode 637 | 1 | |
|
| 92. | Counting counts – Unique Number of Occurrences – Leetcode 1207 | 1 | |
|
| 93. | Merge then discard!? – Leetcode 378 – Kth smallest element in a sorted matrix | 1 | |
|
| 94. | Funny sliding windows – Leetcode 729 – My Calendar I | 1 | |
|
| 95. | Dit dah dit dit dah – Unique Morse Code Words – Leetcode 804 | 1 | |
|
| 96. | This MEDIUM stumped me! – Perfect Squares – Leetcode 279 | 1 | |
|
| 97. | Judgey McJudgerson – Find the Town Judge – Leetcode 997 | 1 | |
|
| 98. | Gettin' Mathsy – Minimum Rounds to Complete All Tasks – Leetcode 2244 | 1 | |
|
| 99. | I'm Back! – Detect Capital – Leetcodee 520 | 1 | |
|
| 100. | First try!? – Nearest Exist from Entrance in Maze – Leetcode 1926 | 1 | |
|
