@study_cloud

Question Difficulty Topics Likes Dislikes Wilson Score Done Notes / Something to remember
Edit Distance Hard String, Dynamic Programming, 3934 56 98.182
Longest Common Subsequence Medium Dynamic Programming, 1475 18 98.102
Trapping Rain Water Hard Array, Two Pointers, Stack, 7103 122 97.988
Minimum Swaps to Group All 1's Together Medium Array, Sliding Window, 187 0 97.987
Implement Trie (Prefix Tree) Medium Design, Trie, 3178 50 97.964
Invert Binary Tree Easy Tree, 3362 55 97.911
Meeting Rooms II Medium Heap, Greedy, Sort, 2575 42 97.838
Reverse Linked List Easy Linked List, 4511 90 97.602
Walls and Gates Medium Breadth-first Search, 1160 18 97.598
Find Median from Data Stream Hard Heap, Design, 2587 48 97.593
Satisfiability of Equality Equations Medium Union Find, Graph, 475 5 97.585
Find the Kth Smallest Sum of a Matrix With Sorted Rows Hard Heap, 294 2 97.57
Find Leaves of Binary Tree Medium Tree, Depth-first Search, 1018 16 97.501
House Robber III Medium Tree, Depth-first Search, 2657 52 97.492
Longest Increasing Path in a Matrix Hard Depth-first Search, Topological Sort, Memoization, 1908 36 97.447
Minimum Path Sum Medium Hash Table, Stack, 3034 63 97.406
Maximum Frequency Stack Hard Array, Dynamic Programming, 933 15 97.406
Subsets Medium Array, Backtracking, Bit Manipulation, 3776 82 97.37
Largest Rectangle in Histogram Hard Array, Stack, 3640 81 97.303
Longest Increasing Subsequence Medium Binary Search, Dynamic Programming, 4731 109 97.291
All Nodes Distance K in Binary Tree Medium Tree, Depth-first Search, Breadth-first Search, 2006 42 97.24
Check Completeness of a Binary Tree Medium Tree, 783 13 97.226
Construct Binary Tree from Inorder and Postorder Traversal Medium Array, Tree, Depth-first Search, 1610 33 97.193
Symmetric Tree Easy Tree, Depth-first Search, Breadth-first Search, 4120 98 97.177
Longest Substring with At Most Two Distinct Characters Medium Hash Table, Two Pointers, String, Sliding Window, 898 16 97.175
Count Square Submatrices with All Ones Medium Array, Dynamic Programming, 975 18 97.153
Number of Ways to Wear Different Hats to Each Other Hard Dynamic Programming, Bit Manipulation, 249 2 97.142
Max Consecutive Ones II Medium Two Pointers, 538 8 97.136
Search a 2D Matrix II Medium Binary Search, Divide and Conquer, 3120 75 97.068
Subarrays with K Different Integers Hard Hash Table, Two Pointers, Sliding Window, 970 19 97.019
Minimum Cost For Tickets Medium Dynamic Programming, 1427 31 96.998
Binary Tree Level Order Traversal Medium Tree, Breadth-first Search, 3001 74 96.99
Max Consecutive Ones III Medium Two Pointers, Sliding Window, 1075 22 96.982
Maximal Square Medium Dynamic Programming, 3068 77 96.951
Maximal Rectangle Hard Array, Hash Table, Dynamic Programming, Stack, 2759 69 96.924
Kth Smallest Element in a BST Medium Binary Search, Tree, 2544 63 96.92
Maximum Profit in Job Scheduling Hard Binary Search, Dynamic Programming, Sort, 414 6 96.919
Stone Game III Hard Dynamic Programming, 277 3 96.898
Dungeon Game Hard Binary Search, Dynamic Programming, 1668 39 96.892
Shortest Path in a Grid with Obstacles Elimination Hard Breadth-first Search, 357 5 96.808
Minimum Number of Refueling Stops Hard Dynamic Programming, Heap, 675 13 96.794
Permutations Medium Backtracking, 3871 106 96.787
Number of Operations to Make Network Connected Medium Depth-first Search, Breadth-first Search, Union Find, 388 6 96.718
Trapping Rain Water II Hard Heap, Breadth-first Search, 1264 30 96.71
Smallest Range Covering Elements from K Lists Hard Hash Table, Two Pointers, String, 1050 24 96.696
Construct Binary Tree from Preorder and Inorder Traversal Medium Array, Tree, Depth-first Search, 3338 93 96.691
Partition Equal Subset Sum Medium Dynamic Programming, 2588 70 96.686
Burst Balloons Hard Divide and Conquer, Dynamic Programming, 2351 63 96.675
Delete Operation for Two Strings Medium String, 1066 26 96.534
House Robber Easy Dynamic Programming, 4775 146 96.521
Combination Sum Medium Array, Backtracking, 3808 116 96.466
Same Tree Easy Tree, Depth-first Search, 2068 59 96.439
Maximum Depth of Binary Tree Easy Tree, Depth-first Search, 2516 74 96.428
Binary Tree Cameras Hard Dynamic Programming, Tree, Depth-first Search, 705 16 96.426
Valid Parenthesis String Medium String, 1815 51 96.424
Daily Temperatures Medium Hash Table, Stack, 2817 85 96.393
House Robber II Medium Dynamic Programming, 1725 49 96.367
Uncrossed Lines Medium Array, 851 21 96.346
Number of Substrings Containing All Three Characters Medium String, 347 6 96.342
Sum Root to Leaf Numbers Medium Tree, Depth-first Search, 1495 42 96.327
Minimum Number of Days to Make m Bouquets Medium Array, Binary Search, 413 8 96.296
Coin Change Medium Dynamic Programming, 4142 135 96.276
Subarray Sum Equals K Medium Array, Hash Table, 4696 155 96.272
Climbing Stairs Easy Dynamic Programming, 4330 142 96.269
Number of Connected Components in an Undirected Graph Medium Depth-first Search, Breadth-first Search, Union Find, Graph,737 18 96.263
Move Zeroes Easy Array, Two Pointers, 3807 124 96.252
Two Sum Easy Array, Hash Table, 15643 563 96.233
Number of Islands Medium Depth-first Search, Breadth-first Search, Union Find, 5642 193 96.202
Coin Change 2 Medium 1996 62 96.157
Shortest Subarray with Sum at Least K Hard Binary Search, Queue, 1105 31 96.153
Number of Islands II Hard Union Find, 829 22 96.117
Best Time to Buy and Sell Stock with Transaction Fee Medium Array, Dynamic Programming, Greedy, 1514 46 96.089
Permutations II Medium Backtracking, 1913 61 96.051
Interval List Intersections Medium Two Pointers, 1403 43 96.018
Construct Binary Search Tree from Preorder Traversal Medium Tree, 1233 37 96.01
Single Number Easy Hash Table, Bit Manipulation, 4475 161 95.96
Kill Process Medium Tree, Queue, 469 11 95.943
Possible Bipartition Medium Depth-first Search, 929 27 95.922
Cheapest Flights Within K Stops Medium Dynamic Programming, Heap, Breadth-first Search, 2003 67 95.91
Capacity To Ship Packages Within D Days Medium Array, Binary Search, 1091 33 95.906
Delete Leaves With a Given Value Medium Tree, 339 7 95.883
Unique Binary Search Trees Medium Dynamic Programming, Tree, 3394 122 95.873
Palindrome Partitioning II Hard Dynamic Programming, 1105 34 95.858
Bus Routes Hard Breadth-first Search, 745 21 95.845
Best Time to Buy and Sell Stock with Cooldown Medium Dynamic Programming, 2323 82 95.788
Maximum Product Subarray Medium Array, Dynamic Programming, 4121 155 95.772
Best Time to Buy and Sell Stock III Hard Array, Dynamic Programming, 2078 73 95.754
Count of Smaller Numbers After Self Hard 2323Segment Tree,
Binary Search, Divide and Conquer, Sort, Binary Indexed Tree, 83 95.744
Minimum Remove to Make Valid Parentheses Medium String, Stack, 825 25 95.694
Pizza With 3n Slices Hard Dynamic Programming, 228 4 95.651
Form Largest Integer With Digits That Add up to Target Hard String, Dynamic Programming, 227 4 95.633
Palindrome Partitioning III Hard Dynamic Programming, 257 5 95.611
Minimum Insertion Steps to Make a String Palindrome Hard Dynamic Programming, 287 6 95.605
Palindrome Partitioning Medium Backtracking, 1832 66 95.6
Allocate Mailboxes Hard Math, Dynamic Programming, 193 3 95.597
Longest Valid Parentheses Hard String, Stack, 3438 134 95.574
Score of Parentheses Medium String, Dynamic Programming, 1107 37 95.574
Minimum Cost to Make at Least One Valid Path in a Grid Hard Breadth-first Search, 223 4 95.558
Smallest Sufficient Team Hard Dynamic Programming, Bit Manipulation, 312 7 95.54
Path Sum II Medium Tree, Depth-first Search, 1752 64 95.525
Remove All Adjacent Duplicates in String II Medium Stack, 502 14 95.498
Longest Continuous Subarray With Absolute Diff Less Than or Equal
Medium
to Limit Array, Sliding Window, 496 14 95.445
Combination Sum II Medium Array, Backtracking, 1737 65 95.429
Validate Stack Sequences Medium Stack, 770 25 95.399
Russian Doll Envelopes Hard Binary Search, Dynamic Programming, 1128 40 95.37
Non-overlapping Intervals Medium Greedy, 1032 36 95.369
How Many Numbers Are Smaller Than the Current Number Easy Array, Hash Table, 659 21 95.325
Graph Valid Tree Medium Depth-first Search, Breadth-first Search, Union Find, Graph,998 35 95.324
N-Queens Hard Backtracking, 1874 73 95.312
Binary Tree Preorder Traversal Medium Stack, Tree, 1501 57 95.289
Delete Nodes And Return Forest Medium Tree, Depth-first Search, 1060 38 95.285
Remove Invalid Parentheses Hard Depth-first Search, Breadth-first Search, 2531 103 95.28
Maximum Length of Repeated Subarray Medium Array, Hash Table, Binary Search, Dynamic Programming, 1243 46 95.273
Cherry Pickup II Hard Dynamic Programming, 179 3 95.266
Valid Parentheses Easy String, Stack, 5062 220 95.262
Flip String to Monotone Increasing Medium Array, 575 18 95.253
Find First and Last Position of Element in Sorted Array Medium Array, Binary Search, 3473 147 95.246
LRU Cache Medium Design, 5885 260 95.236
Sliding Puzzle Hard Breadth-first Search, 670 22 95.233
Permutation in String Medium Two Pointers, Sliding Window, 1550 60 95.232
Best Time to Buy and Sell Stock Easy Array, Dynamic Programming, 5157 226 95.232
Binary Tree Inorder Traversal Medium Hash Table, Stack, Tree, 3115 131 95.231
Maximum Width Ramp Medium Array, 547 17 95.226
Longest ZigZag Path in a Binary Tree Medium Dynamic Programming, Tree, 263 6 95.22
Closest Binary Search Tree Value II Hard Stack, Tree, 615 20 95.185
Restore The Array Hard Dynamic Programming, 145 2 95.175
Longest Substring with At Most K Distinct Characters Hard Hash Table, String, Sliding Window, 1099 41 95.157
Maximum Size Subarray Sum Equals k Medium Hash Table, 911 33 95.131
Last Stone Weight Easy Heap, Greedy, 816 29 95.115
Target Sum Medium Dynamic Programming, Depth-first Search, 2566 109 95.108
Max Area of Island Medium Array, Depth-first Search, 1917 79 95.095
Making A Large Island Hard Depth-first Search, 432 13 95.066
Maximum Subarray Easy Array, Divide and Conquer, Dynamic Programming, 7952 374 95.042
Make Array Strictly Increasing Hard Dynamic Programming, 279 7 95.035
Find K-th Smallest Pair Distance Hard Array, Binary Search, Heap, 914 34 95.03
Palindromic Substrings Medium String, Dynamic Programming, 2621 114 95.016
Word Search II Hard Backtracking, Trie, 2533 110 95.008