Difficulty,Title,Frequency,Acceptance Rate,Link,Topics HARD,Trapping Rain Water II,100.0,0.006432132552120841,https://leetcode.com/problems/trapping-rain-water-ii,"Array, Breadth-First Search, Heap (Priority Queue), Matrix" HARD,Difference Between Maximum and Minimum Price Sum,88.4,0.0034683565275016566,https://leetcode.com/problems/difference-between-maximum-and-minimum-price-sum,"Array, Dynamic Programming, Tree, Depth-First Search, DP on Trees" MEDIUM,Count the Number of Square-Free Subsets,86.4,0.0027108259009498946,https://leetcode.com/problems/count-the-number-of-square-free-subsets,"Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask" MEDIUM,Minimum Total Space Wasted With K Resizing Operations,81.8,0.004460762498145676,https://leetcode.com/problems/minimum-total-space-wasted-with-k-resizing-operations,"Array, Dynamic Programming, Prefix Sum" HARD,Maximum Genetic Difference Query,79.2,0.0048599295583852615,https://leetcode.com/problems/maximum-genetic-difference-query,"Array, Hash Table, Bit Manipulation, Depth-First Search, Trie" MEDIUM,Minimum Cost to Buy Apples,79.2,0.006739933180938984,https://leetcode.com/problems/minimum-cost-to-buy-apples,"Array, Graph Theory, Heap (Priority Queue), Shortest Path" HARD,Maximum XOR of Two Non-Overlapping Subtrees,79.2,0.005162882527147088,https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees,"Tree, Depth-First Search, Graph Theory, Trie" MEDIUM,Sum of Remoteness of All Cells,79.2,0.007084125977594589,https://leetcode.com/problems/sum-of-remoteness-of-all-cells,"Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix" MEDIUM,Maximum Value of an Ordered Triplet II,79.2,0.005622838876372411,https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii,"Array, Prefix Sum" EASY,Maximum Value of an Ordered Triplet I,79.2,0.0058076202791278375,https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i,"Array, Prefix Sum" MEDIUM,Furthest Building You Can Reach,79.2,0.005120214163959792,https://leetcode.com/problems/furthest-building-you-can-reach,"Array, Greedy, Heap (Priority Queue)" MEDIUM,Queens That Can Attack the King,79.2,0.007297939885173927,https://leetcode.com/problems/queens-that-can-attack-the-king,"Array, Matrix, Simulation" EASY,Minimum Time Visiting All Points,79.2,0.008485714971285972,https://leetcode.com/problems/minimum-time-visiting-all-points,"Array, Math, Geometry" HARD,Make the XOR of All Segments Equal to Zero,79.2,0.004156032171581769,https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero,"Array, Hash Table, Dynamic Programming, Bit Manipulation, Counting" HARD,Minimum XOR Sum of Two Arrays,79.2,0.005245222714893425,https://leetcode.com/problems/minimum-xor-sum-of-two-arrays,"Array, Dynamic Programming, Bit Manipulation, Bitmask, Hungarian Algorithm, Bipartite Graph, Successive Shortest Path Algorithm" HARD,Minimum Operations to Form Subsequence With Target Sum,79.2,0.003267272408041436,https://leetcode.com/problems/minimum-operations-to-form-subsequence-with-target-sum,"Array, Greedy, Bit Manipulation" MEDIUM,Jump Game IX,79.2,0.00462788420021694,https://leetcode.com/problems/jump-game-ix,"Array, Dynamic Programming" HARD,Count Subarrays with Distant Sums,79.2,0.003319025375583891,https://leetcode.com/problems/count-subarrays-with-distant-sums,"Array, Binary Search, Binary Indexed Tree, Segment Tree, Prefix Sum" HARD,Lexicographically Largest Power Array,79.2,0.0024974423782872963,https://leetcode.com/problems/lexicographically-largest-power-array,"Array, Greedy, Bit Manipulation" HARD,Trapping Rain Water,76.1,0.006842252878749917,https://leetcode.com/problems/trapping-rain-water,"Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack" HARD,Russian Doll Envelopes,76.1,0.003833089964475047,https://leetcode.com/problems/russian-doll-envelopes,"Array, Binary Search, Dynamic Programming, Sorting, Longest Increasing Subsequence" MEDIUM,Most Stones Removed with Same Row or Column,68.5,0.006355737735655841,https://leetcode.com/problems/most-stones-removed-with-same-row-or-column,"Hash Table, Depth-First Search, Union-Find, Graph Theory, Bipartite Graph" HARD,Maximum Segment Sum After Removals,56.9,0.005052921884317233,https://leetcode.com/problems/maximum-segment-sum-after-removals,"Array, Union-Find, Prefix Sum, Ordered Set" HARD,Kth Smallest Number in Multiplication Table,56.9,0.00552493700991358,https://leetcode.com/problems/kth-smallest-number-in-multiplication-table,"Math, Binary Search" HARD,Find Maximum Non-decreasing Array Length,56.9,0.0019354165579842453,https://leetcode.com/problems/find-maximum-non-decreasing-array-length,"Array, Binary Search, Dynamic Programming, Stack, Queue, Monotonic Stack, Prefix Sum, Monotonic Queue" MEDIUM,Minimum Number of Valid Strings to Form Target I,56.9,0.002229781736214195,https://leetcode.com/problems/minimum-number-of-valid-strings-to-form-target-i,"Array, String, Binary Search, Dynamic Programming, Greedy, Trie, Segment Tree, Rolling Hash, String Matching, Hash Function" EASY,Climbing Stairs,56.9,0.0054406508987833325,https://leetcode.com/problems/climbing-stairs,"Math, Dynamic Programming, Memoization" MEDIUM,Longest Substring Without Repeating Characters,56.9,0.004001910272620233,https://leetcode.com/problems/longest-substring-without-repeating-characters,"Hash Table, String, Sliding Window" MEDIUM,Time Needed to Inform All Employees,47.8,0.006063130038050241,https://leetcode.com/problems/time-needed-to-inform-all-employees,"Tree, Depth-First Search, Breadth-First Search" MEDIUM,Queue Reconstruction by Height,47.8,0.0075135848811832915,https://leetcode.com/problems/queue-reconstruction-by-height,"Array, Binary Indexed Tree, Segment Tree, Sorting" HARD,The Number of Good Subsets,47.8,0.003817087698933929,https://leetcode.com/problems/the-number-of-good-subsets,"Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Counting, Number Theory, Bitmask, Sieve Theory" HARD,Making A Large Island,47.8,0.0057322122140222795,https://leetcode.com/problems/making-a-large-island,"Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix" MEDIUM,Recover Binary Search Tree,47.8,0.0061240959885303994,https://leetcode.com/problems/recover-binary-search-tree,"Tree, Depth-First Search, Binary Search Tree, Binary Tree" MEDIUM,Maximum Subarray,47.8,0.0053993570917912,https://leetcode.com/problems/maximum-subarray,"Array, Divide and Conquer, Dynamic Programming" EASY,Best Time to Buy and Sell Stock,47.8,0.005752124186244199,https://leetcode.com/problems/best-time-to-buy-and-sell-stock,"Array, Dynamic Programming" MEDIUM,Add Two Numbers,47.8,0.004955378735927721,https://leetcode.com/problems/add-two-numbers,"Linked List, Math, Recursion" MEDIUM,Construct Binary Tree from Preorder and Inorder Traversal,47.8,0.0069727998900589215,https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal,"Array, Hash Table, Divide and Conquer, Tree, Binary Tree" MEDIUM,Permutation in String,47.8,0.004992713135564909,https://leetcode.com/problems/permutation-in-string,"Hash Table, Two Pointers, String, Sliding Window" EASY,Remove Outermost Parentheses,47.8,0.00883800581514525,https://leetcode.com/problems/remove-outermost-parentheses,"String, Stack, Bracket Sequences"