| 1 | Two Sum | Easy | solution.py |
| 2 | Add Two Numbers | Medium | solution.py |
| 3 | Longest Substring Without Repeating Characters | Medium | solution.py |
| 4 | Median of Two Sorted Arrays | Hard | solution.py |
| 5 | Longest Palindromic Substring | Medium | solution.py |
| 6 | Zigzag Conversion | Medium | solution.py |
| 7 | Reverse Integer | Medium | solution.py |
| 9 | Palindrome Number | Easy | solution.py |
| 10 | Regular Expression Matching | Hard | solution.py |
| 11 | Container With Most Water | Medium | solution.py |
| 12 | Integer to Roman | Medium | solution.py |
| 13 | Roman to Integer | Easy | solution.py |
| 14 | Longest Common Prefix | Easy | solution.py |
| 15 | 3Sum | Medium | solution.py |
| 17 | Letter Combinations of a Phone Number | Medium | solution.py |
| 18 | 4Sum | Medium | solution.py |
| 19 | Remove Nth Node From End of List | Medium | solution.py |
| 20 | Valid Parentheses | Easy | solution.py |
| 21 | Merge Two Sorted Lists | Easy | solution.py |
| 22 | Generate Parentheses | Medium | solution.py |
| 23 | Merge k Sorted Lists | Hard | solution.py |
| 24 | Swap Nodes in Pairs | Medium | solution.py |
| 25 | Reverse Nodes in k-Group | Hard | solution.py |
| 26 | Remove Duplicates From Sorted Array | Easy | solution.py |
| 27 | Remove Element | Easy | solution.py |
| 28 | Find the Index of the First Occurrence in a String | Easy | solution.py |
| 31 | Next Permutation | Medium | solution.py |
| 33 | Search in Rotated Sorted Array | Medium | solution.py |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | solution.py |
| 35 | Search Insert Position | Easy | solution.py |
| 36 | Valid Sudoku | Medium | solution.py |
| 39 | Combination Sum | Medium | solution.py |
| 40 | Combination Sum II | Medium | solution.py |
| 41 | First Missing Positive | Hard | solution.py |
| 42 | Trapping Rain Water | Hard | solution.py |
| 43 | Multiply Strings | Medium | solution.py |
| 45 | Jump Game II | Medium | solution.py |
| 46 | Permutations | Medium | solution.py |
| 47 | Permutations II | Medium | solution.py |
| 48 | Rotate Image | Medium | solution.py |
| 49 | Group Anagrams | Medium | solution.py |
| 50 | Pow(x, n) | Medium | solution.py |
| 51 | N-Queens | Hard | solution.py |
| 52 | N-Queens II | Hard | solution.py |
| 53 | Maximum Subarray | Medium | solution.py |
| 54 | Spiral Matrix | Medium | solution.py |
| 55 | Jump Game | Medium | solution.py |
| 56 | Merge Intervals | Medium | solution.py |
| 57 | Insert Interval | Medium | solution.py |
| 58 | Length of Last Word | Easy | solution.py |
| 59 | Spiral Matrix II | Medium | solution.py |
| 61 | Rotate List | Medium | solution.py |
| 62 | Unique Paths | Medium | solution.py |
| 63 | Unique Paths II | Medium | solution.py |
| 64 | Minimum Path Sum | Medium | solution.py |
| 66 | Plus One | Easy | solution.py |
| 67 | Add Binary | Easy | solution.py |
| 68 | Text Justification | Hard | solution.py |
| 69 | Sqrt(x) | Easy | solution.py |
| 70 | Climbing Stairs | Easy | solution.py |
| 71 | Simplify Path | Medium | solution.py |
| 72 | Edit Distance | Hard | solution.py |
| 73 | Set Matrix Zeroes | Medium | solution.py |
| 74 | Search a 2D Matrix | Medium | solution.py |
| 75 | Sort Colors | Medium | solution.py |
| 76 | Minimum Window Substring | Hard | solution.py |
| 77 | Combinations | Medium | solution.py |
| 78 | Subsets | Medium | solution.py |
| 79 | Word Search | Medium | solution.py |
| 80 | Remove Duplicates from Sorted Array II | Medium | solution.py |
| 81 | Search in Rotated Sorted Array II | Medium | solution.py |
| 83 | Remove Duplicates from Sorted List | Easy | solution.py |
| 84 | Largest Rectangle in Histogram | Hard | solution.py |
| 86 | Partition List | Medium | solution.py |
| 88 | Merge Sorted Array | Easy | solution.py |
| 90 | Subsets II | Medium | solution.py |
| 91 | Decode Ways | Medium | solution.py |
| 92 | Reverse Linked List II | Medium | solution.py |
| 93 | Restore IP Addresses | Medium | solution.py |
| 94 | Binary Tree Inorder Traversal | Easy | solution.py |
| 95 | Unique Binary Search Trees II | Medium | solution.py |
| 96 | Unique Binary Search Trees | Medium | solution.py |
| 97 | Interleaving String | Medium | solution.py |
| 98 | Validate Binary Search Tree | Medium | solution.py |
| 99 | Recover Binary Search Tree | Medium | solution.py |
| 100 | Same Tree | Easy | solution.py |
| 101 | Symmetric Tree | Easy | solution.py |
| 102 | Binary Tree Level Order Traversal | Medium | solution.py |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | solution.py |
| 104 | Maximum Depth of Binary Tree | Easy | solution.py |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | solution.py |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | solution.py |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | solution.py |
| 110 | Balanced Binary Tree | Easy | solution.py |
| 112 | Path Sum | Easy | solution.py |
| 115 | Distinct Subsequences | Hard | solution.py |
| 116 | Populating Next Right Pointers In Each Node | Medium | solution.py |
| 118 | Pascal’s Triangle | Easy | solution.py |
| 119 | Pascal’s Triangle II | Easy | solution.py |
| 120 | Triangle | Medium | solution.py |
| 121 | Best Time to Buy and Sell Stock | Easy | solution.py |
| 122 | Best Time to Buy and Sell Stock II | Medium | solution.py |
| 124 | Binary Tree Maximum Path Sum | Hard | solution.py |
| 125 | Valid Palindrome | Easy | solution.py |
| 127 | Word Ladder | Hard | solution.py |
| 128 | Longest Consecutive Sequence | Medium | solution.py |
| 129 | Sum Root to Leaf Numbers | Medium | solution.py |
| 130 | Surrounded Regions | Medium | solution.py |
| 131 | Palindrome Partitioning | Medium | solution.py |
| 133 | Clone Graph | Medium | solution.py |
| 134 | Gas Station | Medium | solution.py |
| 135 | Candy | Hard | solution.py |
| 136 | Single Number | Easy | solution.py |
| 138 | Copy List with Random Pointer | Medium | solution.py |
| 139 | Word Break | Medium | solution.py |
| 140 | Word Break II | Hard | solution.py |
| 141 | Linked List Cycle | Easy | solution.py |
| 143 | Reorder List | Medium | solution.py |
| 144 | Binary Tree Preorder Traversal | Easy | solution.py |
| 145 | Binary Tree Postorder Traversal | Easy | solution.py |
| 146 | LRU Cache | Medium | solution.py |
| 147 | Insertion Sort List | Medium | solution.py |
| 148 | Sort List | Medium | solution.py |
| 149 | Max Points on a Line | Hard | solution.py |
| 150 | Evaluate Reverse Polish Notation | Medium | solution.py |
| 152 | Maximum Product Subarray | Medium | solution.py |
| 153 | Find Minimum in Rotated Sorted Array | Medium | solution.py |
| 155 | Min Stack | Medium | solution.py |
| 156 | Binary Tree Upside Down | Medium | solution.py |
| 159 | Longest Substring with At Most Two Distinct Characters | Medium | solution.py |
| 160 | Intersection of Two Linked Lists | Easy | solution.py |
| 161 | One Edit Distance | Medium | solution.py |
| 162 | Find Peak Element | Medium | solution.py |
| 163 | Missing Ranges | Easy | solution.py |
| 167 | Two Sum II - Input Array Is Sorted | Medium | solution.py |
| 168 | Excel Sheet Column Title | Easy | solution.py |
| 169 | Majority Element | Easy | solution.py |
| 173 | Binary Search Tree Iterator | Medium | solution.py |
| 179 | Largest Number | Medium | solution.py |
| 186 | Reverse Words in a String II | Medium | solution.py |
| 187 | Repeated DNA Sequences | Medium | solution.py |
| 189 | Rotate Array | Medium | solution.py |
| 190 | Reverse Bits | Easy | solution.py |
| 191 | Number of 1 Bits | Easy | solution.py |
| 198 | House Robber | Medium | solution.py |
| 199 | Binary Tree Right Side View | Medium | solution.py |
| 200 | Number of Islands | Medium | solution.py |
| 201 | Bitwise AND of Numbers Range | Medium | solution.py |
| 202 | Happy Number | Easy | solution.py |
| 203 | Remove Linked List Elements | Easy | solution.py |
| 204 | Count Primes | Medium | solution.py |
| 205 | Isomorphic Strings | Easy | solution.py |
| 206 | Reverse Linked List | Easy | solution.py |
| 207 | Course Schedule | Medium | solution.py |
| 208 | Implement Trie (Prefix Tree) | Medium | solution.py |
| 209 | Minimum Size Subarray Sum | Medium | solution.py |
| 210 | Course Schedule II | Medium | solution.py |
| 211 | Design Add and Search Words Data Structure | Medium | solution.py |
| 212 | Word Search II | Hard | solution.py |
| 213 | House Robber II | Medium | solution.py |
| 214 | Shortest Palindrome | Hard | solution.py |
| 215 | Kth Largest Element in an Array | Medium | solution.py |
| 217 | Contains Duplicate | Easy | solution.py |
| 219 | Contains Duplicate II | Easy | solution.py |
| 221 | Maximal Square | Medium | solution.py |
| 225 | Implement Stack using Queues | Easy | solution.py |
| 226 | Invert Binary Tree | Easy | solution.py |
| 227 | Basic Calculator II | Medium | solution.py |
| 229 | Majority Element II | Medium | solution.py |
| 230 | Kth Smallest Element in a BST | Medium | solution.py |
| 231 | Power of Two | Easy | solution.py |
| 232 | Implement Queue using Stacks | Easy | solution.py |
| 234 | Palindrome Linked List | Easy | solution.py |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | solution.py |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | solution.py |
| 238 | Product of Array Except Self | Medium | solution.py |
| 239 | Sliding Window Maximum | Hard | solution.py |
| 241 | Different Ways to Add Parentheses | Medium | solution.py |
| 242 | Valid Anagram | Easy | solution.py |
| 243 | Shortest Word Distance | Easy | solution.py |
| 244 | Shortest Word Distance II | Medium | solution.py |
| 246 | Strobogrammatic Number | Easy | solution.py |
| 247 | Strobogrammatic Number II | Medium | solution.py |
| 249 | Group Shifted Strings | Medium | solution.py |
| 250 | Count Univalue Subtrees | Medium | solution.py |
| 252 | Meeting Rooms | Easy | solution.py |
| 253 | Meeting Rooms II | Medium | solution.py |
| 254 | Factor Combinations | Medium | solution.py |
| 255 | Verify Preorder Sequence in Binary Search Tree | Medium | solution.py |
| 256 | Paint House | Medium | solution.py |
| 259 | 3Sum Smaller | Medium | solution.py |
| 260 | Single Number III | Medium | solution.py |
| 261 | Graph Valid Tree | Medium | solution.py |
| 263 | Ugly Number | Easy | solution.py |
| 264 | Ugly Number II | Medium | solution.py |
| 265 | Paint House II | Hard | solution.py |
| 266 | Palindrome Permutation | Easy | solution.py |
| 268 | Missing Number | Easy | solution.py |
| 269 | Alien Dictionary | Hard | solution.py |
| 270 | Closest Binary Search Tree Value | Easy | solution.py |
| 271 | Encode and Decode Strings | Medium | solution.py |
| 272 | Closest Binary Search Tree Value II | Hard | solution.py |
| 273 | Integer to English Words | Hard | solution.py |
| 276 | Paint Fence | Medium | solution.py |
| 277 | Find the Celebrity | Medium | solution.py |
| 279 | Perfect Squares | Medium | solution.py |
| 280 | Wiggle Sort | Medium | solution.py |
| 281 | Zigzag Iterator | Medium | solution.py |
| 283 | Move Zeroes | Easy | solution.py |
| 286 | Walls And Gates | Medium | solution.py |
| 287 | Find the Duplicate Number | Medium | solution.py |
| 290 | Word Pattern | Easy | solution.py |
| 291 | Word Pattern II | Medium | solution.py |
| 295 | Find Median from Data Stream | Hard | solution.py |
| 296 | Best Meeting Point | Hard | solution.py |
| 297 | Serialize and Deserialize Binary Tree | Hard | solution.py |
| 298 | Binary Tree Longest Consecutive Sequence | Medium | solution.py |
| 300 | Longest Increasing Subsequence | Medium | solution.py |
| 303 | Range Sum Query - Immutable | Easy | solution.py |
| 304 | Range Sum Query 2D - Immutable | Medium | solution.py |
| 305 | Number of Islands II | Hard | solution.py |
| 308 | Range Sum Query 2D - Mutable | Medium | solution.py |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Medium | solution.py |
| 310 | Minimum Height Trees | Medium | solution.py |
| 311 | Sparse Matrix Multiplication | Medium | solution.py |
| 312 | Burst Balloons | Hard | solution.py |
| 314 | Binary Tree Vertical Order Traversal | Medium | solution.py |
| 317 | Shortest Distance from All Buildings | Hard | solution.py |
| 322 | Coin Change | Medium | solution.py |
| 323 | Number of Connected Components in an Undirected Graph | Medium | solution.py |
| 329 | Longest Increasing Path in a Matrix | Hard | solution.py |
| 332 | Reconstruct Itinerary | Hard | solution.py |
| 333 | Largest BST Subtree | Medium | solution.py |
| 337 | House Robber III | Medium | solution.py |
| 338 | Counting Bits | Easy | solution.py |
| 339 | Nested List Weight Sum | Medium | solution.py |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | solution.py |
| 341 | Flatten Nested List Iterator | Medium | solution.py |
| 342 | Power of Four | Easy | solution.py |
| 343 | Integer Break | Medium | solution.py |
| 344 | Reverse String | Easy | solution.py |
| 346 | Moving Average from Data Stream | Easy | solution.py |
| 347 | Top K Frequent Elements | Medium | solution.py |
| 348 | Design Tic-Tac-Toe | Medium | solution.py |
| 349 | Intersection of Two Arrays | Easy | solution.py |
| 351 | Android Unlock Patterns | Medium | solution.py |
| 352 | Data Stream as Disjoint Intervals | Hard | solution.py |
| 354 | Russian Doll Envelopes | Hard | solution.py |
| 355 | Design Twitter | Medium | solution.py |
| 362 | Design Hit Counter | Medium | solution.py |
| 367 | Valid Perfect Square | Easy | solution.py |
| 368 | Largest Divisible Subset | Medium | solution.py |
| 371 | Sum of Two Integers | Medium | solution.py |
| 374 | Guess Number Higher or Lower | Easy | solution.py |
| 377 | Combination Sum IV | Medium | solution.py |
| 380 | Insert Delete GetRandom O(1) | Medium | solution.py |
| 383 | Ransom Note | Easy | solution.py |
| 386 | Lexicographical Numbers | Medium | solution.py |
| 387 | First Unique Character in a String | Easy | solution.py |
| 389 | Find the Difference | Easy | solution.py |
| 392 | Is Subsequence | Easy | solution.py |
| 394 | Decode String | Medium | solution.py |
| 399 | Evaluate Division | Medium | solution.py |
| 402 | Remove K Digits | Medium | solution.py |
| 407 | Trapping Rain Water II | Hard | solution.py |
| 409 | Longest Palindrome | Easy | solution.py |
| 410 | Split Array Largest Sum | Hard | solution.py |
| 416 | Partition Equal Subset Sum | Medium | solution.py |
| 417 | Pacific Atlantic Water Flow | Medium | solution.py |
| 424 | Longest Repeating Character Replacement | Medium | solution.py |
| 427 | Construct Quad Tree | Medium | solution.py |
| 435 | Non-overlapping Intervals | Medium | solution.py |
| 438 | Find All Anagrams in a String | Medium | solution.py |
| 440 | K-th Smallest in Lexicographical Order | Hard | solution.py |
| 441 | Arranging Coins | Easy | solution.py |
| 442 | Find All Duplicates in an Array | Medium | solution.py |
| 443 | String Compression | Medium | solution.py |
| 445 | Add Two Numbers II | Medium | solution.py |
| 446 | Arithmetic Slices II - Subsequence | Hard | solution.py |
| 448 | Find All Numbers Disappeared in an Array | Easy | solution.py |
| 450 | Delete Node in a BST | Medium | solution.py |
| 451 | Sort Characters By Frequency | Medium | solution.py |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | solution.py |
| 455 | Assign Cookies | Easy | solution.py |
| 456 | 132 Pattern | Medium | solution.py |
| 460 | LFU Cache | Hard | solution.py |
| 463 | Island Perimeter | Easy | solution.py |
| 472 | Concatenated Words | Hard | solution.py |
| 473 | Matchsticks to Square | Medium | solution.py |
| 474 | Ones and Zeroes | Medium | solution.py |
| 485 | Max Consecutive Ones | Easy | solution.py |
| 494 | Target Sum | Medium | solution.py |
| 496 | Next Greater Element I | Easy | solution.py |
| 502 | IPO | Hard | solution.py |
| 513 | Find Bottom Left Tree Value | Medium | solution.py |
| 514 | Freedom Trail | Hard | solution.py |
| 515 | Find Largest Value in Each Tree Row | Medium | solution.py |
| 516 | Longest Palindromic Subsequence | Medium | solution.py |
| 518 | Coin Change II | Medium | solution.py |
| 523 | Continuous Subarray Sum | Medium | solution.py |
| 525 | Contiguous Array | Medium | solution.py |
| 528 | Random Pick with Weight | Medium | solution.py |
| 535 | Encode and Decode TinyURL | Medium | solution.py |
| 538 | Convert BST to Greater Tree | Medium | solution.py |
| 539 | Minimum Time Difference | Medium | solution.py |
| 540 | Single Element in a Sorted Array | Medium | solution.py |
| 543 | Diameter of Binary Tree | Easy | solution.py |
| 547 | Number of Provinces | Medium | solution.py |
| 552 | Student Attendance Record II | Hard | solution.py |
| 554 | Brick Wall | Medium | solution.py |
| 557 | Reverse Words in a String III | Easy | solution.py |
| 560 | Subarray Sum Equals K | Medium | solution.py |
| 567 | Permutation in String | Medium | solution.py |
| 572 | Subtree of Another Tree | Easy | solution.py |
| 576 | Out of Boundary Paths | Medium | solution.py |
| 588 | Design In-Memory File System | Hard | solution.py |
| 590 | N-ary Tree Postorder Traversal | Easy | solution.py |
| 605 | Can Place Flowers | Easy | solution.py |
| 606 | Construct String from Binary Tree | Medium | solution.py |
| 617 | Merge Two Binary Trees | Easy | solution.py |
| 621 | Task Scheduler | Medium | solution.py |
| 622 | Design Circular Queue | Medium | solution.py |
| 624 | Maximum Distance in Arrays | Medium | solution.py |
| 629 | K Inverse Pairs Array | Hard | solution.py |
| 632 | Smallest Range Covering Elements from K Lists | Hard | solution.py |
| 633 | Sum of Square Numbers | Medium | solution.py |
| 645 | Set Mismatch | Easy | solution.py |
| 646 | Maximum Length of Pair Chain | Medium | solution.py |
| 647 | Palindromic Substrings | Medium | solution.py |
| 649 | Dota2 Senate | Medium | solution.py |
| 650 | 2 Keys Keyboard | Medium | solution.py |
| 652 | Find Duplicate Subtrees | Medium | solution.py |
| 658 | Find K Closest Elements | Medium | solution.py |
| 661 | Image Smoother | Easy | solution.py |
| 662 | Maximum Width of Binary Tree | Medium | solution.py |
| 665 | Non-decreasing Array | Medium | solution.py |
| 669 | Trim a Binary Search Tree | Medium | solution.py |
| 670 | Maximum Swap | Medium | solution.py |
| 673 | Number of Longest Increasing Subsequence | Medium | solution.py |
| 678 | Valid Parenthesis String | Medium | solution.py |
| 680 | Valid Palindrome II | Easy | solution.py |
| 682 | Baseball Game | Easy | solution.py |
| 684 | Redundant Connection | Medium | solution.py |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | solution.py |
| 691 | Stickers to Spell Word | Hard | solution.py |
| 695 | Max Area of Island | Medium | solution.py |
| 698 | Partition to K Equal Sum Subsets | Medium | solution.py |
| 701 | Insert into a Binary Search Tree | Medium | solution.py |
| 703 | Kth Largest Element in a Stream | Easy | solution.py |
| 704 | Binary Search | Easy | solution.py |
| 705 | Design HashSet | Easy | solution.py |
| 706 | Design HashMap | Easy | solution.py |
| 707 | Design Linked List | Medium | solution.py |
| 713 | Subarray Product Less Than K | Medium | solution.py |
| 719 | Find K-th Smallest Pair Distance | Hard | solution.py |
| 721 | Accounts Merge | Medium | solution.py |
| 724 | Find Pivot Index | Easy | solution.py |
| 725 | Split Linked List in Parts | Medium | solution.py |
| 726 | Number of Atoms | Hard | solution.py |
| 729 | My Calendar I | Medium | solution.py |
| 731 | My Calendar II | Medium | solution.py |
| 733 | Flood Fill | Easy | solution.py |
| 735 | Asteroid Collision | Medium | solution.py |
| 739 | Daily Temperatures | Medium | solution.py |
| 740 | Delete and Earn | Medium | solution.py |
| 741 | Cherry Pickup | Hard | solution.py |
| 743 | Network Delay Time | Medium | solution.py |
| 746 | Min Cost Climbing Stairs | Easy | solution.py |
| 752 | Open the Lock | Medium | solution.py |
| 759 | Employee Free Time | Hard | solution.py |
| 763 | Partition Labels | Medium | solution.py |
| 767 | Reorganize String | Medium | solution.py |
| 769 | Max Chunks To Make Sorted | Medium | solution.py |
| 773 | Sliding Puzzle | Hard | solution.py |
| 778 | Swim in Rising Water | Hard | solution.py |
| 779 | K-th Symbol in Grammar | Medium | solution.py |
| 783 | Minimum Distance Between BST Nodes | Easy | solution.py |
| 785 | Is Graph Bipartite? | Medium | solution.py |
| 787 | Cheapest Flights Within K Stops | Medium | solution.py |
| 791 | Custom Sort String | Medium | solution.py |
| 799 | Champagne Tower | Medium | solution.py |
| 802 | Find Eventual Safe States | Medium | solution.py |
| 805 | Split Array With Same Average | Hard | solution.py |
| 815 | Bus Routes | Hard | solution.py |
| 827 | Making A Large Island | Hard | solution.py |
| 837 | New 21 Game | Medium | solution.py |
| 838 | Push Dominoes | Medium | solution.py |
| 840 | Magic Squares In Grid | Medium | solution.py |
| 844 | Backspace String Compare | Easy | solution.py |
| 846 | Hand of Straights | Medium | solution.py |
| 853 | Car Fleet | Medium | solution.py |
| 857 | Minimum Cost to Hire K Workers | Hard | solution.py |
| 860 | Lemonade Change | Easy | solution.py |
| 861 | Score After Flipping Matrix | Medium | solution.py |
| 862 | Shortest Subarray with Sum at Least K | Hard | solution.py |
| 867 | Transpose Matrix | Easy | solution.py |
| 872 | Leaf-Similar Trees | Easy | solution.py |
| 873 | Length of Longest Fibonacci Subsequence | Medium | solution.py |
| 874 | Walking Robot Simulation | Medium | solution.py |
| 875 | Koko Eating Bananas | Medium | solution.py |
| 876 | Middle of the Linked List | Easy | solution.py |
| 877 | Stone Game | Medium | solution.py |
| 879 | Profitable Schemes | Hard | solution.py |
| 881 | Boats to Save People | Medium | solution.py |
| 884 | Uncommon Words from Two Sentences | Easy | solution.py |
| 885 | Spiral Matrix III | Medium | solution.py |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | solution.py |
| 894 | All Possible Full Binary Trees | Medium | solution.py |
| 895 | Maximum Frequency Stack | Hard | solution.py |
| 896 | Monotonic Array | Easy | solution.py |
| 901 | Online Stock Span | Medium | solution.py |
| 904 | Fruit Into Baskets | Medium | solution.py |
| 905 | Sort Array By Parity | Easy | solution.py |
| 907 | Sum of Subarray Minimums | Medium | solution.py |
| 909 | Snakes and Ladders | Medium | solution.py |
| 912 | Sort an Array | Medium | solution.py |
| 916 | Word Subsets | Medium | solution.py |
| 918 | Maximum Sum Circular Subarray | Medium | solution.py |
| 920 | Number of Music Playlists | Hard | solution.py |
| 921 | Minimum Add to Make Parentheses Valid | Medium | solution.py |
| 926 | Flip String to Monotone Increasing | Medium | solution.py |
| 929 | Unique Email Addresses | Easy | solution.py |
| 930 | Binary Subarrays With Sum | Medium | solution.py |
| 931 | Minimum Falling Path Sum | Medium | solution.py |
| 934 | Shortest Bridge | Medium | solution.py |
| 935 | Knight Dialer | Medium | solution.py |
| 938 | Range Sum of BST | Easy | solution.py |
| 945 | Minimum Increment to Make Array Unique | Medium | solution.py |
| 946 | Validate Stack Sequences | Medium | solution.py |
| 948 | Bag of Tokens | Medium | solution.py |
| 950 | Reveal Cards In Increasing Order | Medium | solution.py |
| 951 | Flip Equivalent Binary Trees | Medium | solution.py |
| 953 | Verifying an Alien Dictionary | Easy | solution.py |
| 958 | Check Completeness of a Binary Tree | Medium | solution.py |
| 959 | Regions Cut By Slashes | Medium | solution.py |
| 962 | Maximum Width Ramp | Medium | solution.py |
| 973 | K Closest Points to Origin | Medium | solution.py |
| 974 | Subarray Sums Divisible by K | Medium | solution.py |
| 977 | Squares of a Sorted Array | Easy | solution.py |
| 978 | Longest Turbulent Subarray | Medium | solution.py |
| 979 | Distribute Coins in Binary Tree | Medium | solution.py |
| 981 | Time Based Key-Value Store | Medium | solution.py |
| 983 | Minimum Cost For Tickets | Medium | solution.py |
| 986 | Interval List Intersections | Medium | solution.py |
| 988 | Smallest String Starting From Leaf | Medium | solution.py |
| 989 | Add to Array-Form of Integer | Easy | solution.py |
| 992 | Subarrays with K Different Integers | Hard | solution.py |
| 994 | Rotting Oranges | Medium | solution.py |
| 995 | Minimum Number of K Consecutive Bit Flips | Hard | solution.py |
| 997 | Find the Town Judge | Easy | solution.py |
| 1002 | Find Common Characters | Easy | solution.py |
| 1004 | Max Consecutive Ones III | Medium | solution.py |
| 1011 | Capacity To Ship Packages Within D Days | Medium | solution.py |
| 1014 | Best Sightseeing Pair | Medium | solution.py |
| 1020 | Number of Enclaves | Medium | solution.py |
| 1028 | Recover a Tree From Preorder Traversal | Hard | solution.py |
| 1029 | Two City Scheduling | Medium | solution.py |
| 1035 | Uncrossed Lines | Medium | solution.py |
| 1041 | Robot Bounded In Circle | Medium | solution.py |
| 1043 | Partition Array for Maximum Sum | Medium | solution.py |
| 1046 | Last Stone Weight | Easy | solution.py |
| 1048 | Longest String Chain | Medium | solution.py |
| 1049 | Last Stone Weight II | Medium | solution.py |
| 1051 | Height Checker | Easy | solution.py |
| 1052 | Grumpy Bookstore Owner | Medium | solution.py |
| 1071 | Greatest Common Divisor of Strings | Easy | solution.py |
| 1072 | Flip Columns For Maximum Number of Equal Rows | Medium | solution.py |
| 1074 | Number of Submatrices That Sum to Target | Hard | solution.py |
| 1079 | Letter Tile Possibilities | Medium | solution.py |
| 1091 | Shortest Path in Binary Matrix | Medium | solution.py |
| 1092 | Shortest Common Supersequence | Hard | solution.py |
| 1094 | Car Pooling | Medium | solution.py |
| 1095 | Find in Mountain Array | Hard | solution.py |
| 1105 | Filling Bookcase Shelves | Medium | solution.py |
| 1106 | Parsing A Boolean Expression | Hard | solution.py |
| 1110 | Delete Nodes And Return Forest | Medium | solution.py |
| 1122 | Relative Sort Array | Easy | solution.py |
| 1129 | Shortest Path with Alternating Colors | Medium | solution.py |
| 1137 | N-th Tribonacci Number | Easy | solution.py |
| 1140 | Stone Game II | Medium | solution.py |
| 1143 | Longest Common Subsequence | Medium | solution.py |
| 1197 | Minimum Knight Moves | Medium | solution.py |
| 1235 | Maximum Profit in Job Scheduling | Hard | solution.py |
| 1325 | Delete Leaves With a Given Value | Medium | solution.py |
| 1405 | Longest Happy String | Medium | solution.py |
| 1406 | Stone Game III | Hard | solution.py |
| 1448 | Count Good Nodes in Binary Tree | Medium | solution.py |
| 1462 | Course Schedule IV | Medium | solution.py |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | solution.py |
| 1584 | Min Cost to Connect All Points | Medium | solution.py |
| 1631 | Path With Minimum Effort | Medium | solution.py |
| 1768 | Merge Strings Alternately | Easy | solution.py |
| 1834 | Single-Threaded CPU | Medium | solution.py |
| 1851 | Minimum Interval to Include Each Query | Hard | solution.py |
| 1863 | Sum of All Subset XOR Totals | Easy | solution.py |
| 1871 | Jump Game VII | Medium | solution.py |
| 1899 | Merge Triplets to Form Target Triplet | Medium | solution.py |
| 1929 | Concatenation of Array | Easy | solution.py |
| 2013 | Detect Squares | Medium | solution.py |
| 2392 | Build a Matrix With Conditions | Hard | solution.py |
| 2402 | Meeting Rooms III | Hard | solution.py |
| 2707 | Extra Characters in a String | Medium | solution.py |
| 2709 | Greatest Common Divisor Traversal | Hard | solution.py |
| 2807 | Insert Greatest Common Divisors in Linked List | Medium | solution.py |
| 3133 | Minimum Array End | Medium | solution.py |