README
¶
LeetCode in Java Solutions
Clone this repository
- Read doc.
Solved Problems
| Easy | Medium | Hard | Total | |
|---|---|---|---|---|
| Accepted | 174 | 388 | 111 | 673 |
| Total | 575 | 1198 | 530 | 2303 |
| Coverage | 30.26 % | 32.39 % | 20.94 % | 29.22 % |
Solutions
| Number | Acceptance | Title | Difficulty | Favorite |
|---|---|---|---|---|
| 3049 | * Earliest Second to Mark Indices II | 13% | Hard | |
| 3048 | * Earliest Second to Mark Indices I | 24% | Medium | |
| 3047 | * Find the Largest Area of Square Inside Two Rectangles | 42% | Medium | |
| 3046 | * Split the Array | 53% | Easy | |
| 3045 | * Count Prefix and Suffix Pairs II | 21% | Hard | |
| 3044 | * Most Frequent Prime | 47% | Medium | |
| 3043 | * Find the Length of the Longest Common Prefix | 30% | Medium | |
| 3042 | * Count Prefix and Suffix Pairs I | 62% | Easy | |
| 3041 | * Maximize Consecutive Elements in an Array After Modification | 28% | Hard | |
| 3040 | * Maximum Number of Operations With the Same Score II | 30% | Medium | |
| 3039 | * Apply Operations to Make String Empty | 55% | Medium | |
| 3038 | * Maximum Number of Operations With the Same Score I | 50% | Easy | |
| 3036 | * Number of Subarrays That Match a Pattern II | 31% | Hard | |
| 3035 | * Maximum Palindromes After Operations | 41% | Medium | |
| 3034 | * Number of Subarrays That Match a Pattern I | 65% | Medium | |
| 3033 | * Modify the Matrix | 67% | Easy | |
| 3031 | * Minimum Time to Revert Word to Initial State II | 35% | Hard | |
| 3030 | * Find the Grid of Region Average | 43% | Medium | |
| 3029 | * Minimum Time to Revert Word to Initial State I | 39% | Medium | |
| 3028 | * Ant on the Boundary | 75% | Easy | |
| 3027 | * Find the Number of Ways to Place People II | 47% | Hard | |
| 3026 | * Maximum Good Subarray Sum | 17% | Medium | |
| 3025 | * Find the Number of Ways to Place People I | 40% | Medium | |
| 3024 | * Type of Triangle | 38% | Easy | |
| 3022 | * Minimize OR of Remaining Elements Using Operations | 30% | Hard | |
| 3021 | * Alice and Bob Playing Flower Game | 46% | Medium | |
| 3020 | * Find the Maximum Number of Elements in Subset | 24% | Medium | |
| 3019 | * Number of Changing Keys | 79% | Easy | |
| 3017 | * Count the Number of Houses at a Certain Distance II | 19% | Hard | |
| 3016 | * Minimum Number of Pushes to Type Word II | 69% | Medium | |
| 3015 | * Count the Number of Houses at a Certain Distance I | 53% | Medium | |
| 3014 | * Minimum Number of Pushes to Type Word I | 62% | Easy | |
| 3013 | * Divide an Array Into Subarrays With Minimum Cost II | 29% | Hard | |
| 3012 | * Minimize Length of Array Using Operations | 34% | Medium | |
| 3011 | * Find if Array Can Be Sorted | 50% | Medium | |
| 3010 | * Divide an Array Into Subarrays With Minimum Cost I | 64% | Easy | |
| 3008 | * Find Beautiful Indices in the Given Array II | 22% | Hard | |
| 3007 | * Maximum Number That Sum of the Prices Is Less Than or Equal to K | 34% | Medium | |
| 3006 | * Find Beautiful Indices in the Given Array I | 35% | Medium | |
| 3005 | * Count Elements With Maximum Frequency | 72% | Easy | |
| 3003 | * Maximize the Number of Partitions After Operations | 27% | Hard | |
| 3002 | * Maximum Size of a Set After Removals | 43% | Medium | |
| 3001 | * Minimum Moves to Capture The Queen | 19% | Medium | |
| 3000 | * Maximum Area of Longest Diagonal Rectangle | 35% | Easy | |
| 2999 | * Count the Number of Powerful Integers | 25% | Hard | |
| 2998 | * Minimum Number of Operations to Make X and Y Equal | 42% | Medium | |
| 2997 | * Minimum Number of Operations to Make Array XOR Equal to K | 77% | Medium | |
| 2996 | * Smallest Missing Integer Greater Than Sequential Prefix Sum | 31% | Easy | |
| 2983 | * Palindrome Rearrangement Queries | 24% | Hard | |
| 2982 | * Find Longest Special Substring That Occurs Thrice II | 32% | Medium | |
| 2981 | * Find Longest Special Substring That Occurs Thrice I | 41% | Medium | |
| 2980 | * Check if Bitwise OR Has Trailing Zeros | 69% | Easy | |
| 2977 | * Minimum Cost to Convert String II | 23% | Hard | |
| 2976 | * Minimum Cost to Convert String I | 38% | Medium | |
| 2975 | * Maximum Square Area by Removing Fences From a Field | 22% | Medium | |
| 2974 | * Minimum Number Game | 85% | Easy | |
| 2973 | * Find Number of Coins to Place in Tree Nodes | 34% | Hard | |
| 2972 | * Count the Number of Incremovable Subarrays II | 38% | Hard | |
| 2971 | Find Polygon With the Largest Perimeter | 66% | Medium | |
| 2970 | * Count the Number of Incremovable Subarrays I | 49% | Easy | |
| 2968 | * Apply Operations to Maximize Frequency Score | 38% | Hard | |
| 2967 | * Minimum Cost to Make Array Equalindromic | 21% | Medium | |
| 2966 | Divide Array Into Arrays With Max Difference | 71% | Medium | |
| 2965 | * Find Missing and Repeated Values | 74% | Easy | |
| 2963 | * Count the Number of Good Partitions | 48% | Hard | |
| 2962 | * Count Subarrays Where Max Element Appears at Least K Times | 44% | Medium | |
| 2961 | * Double Modular Exponentiation | 46% | Medium | |
| 2960 | * Count Tested Devices After Test Operations | 80% | Easy | |
| 2959 | * Number of Possible Sets of Closing Branches | 49% | Hard | |
| 2958 | * Length of Longest Subarray With at Most K Frequency | 42% | Medium | |
| 2957 | * Remove Adjacent Almost-Equal Characters | 51% | Medium | |
| 2956 | * Find Common Elements Between Two Arrays | 82% | Easy | |
| 2954 | * Count the Number of Infection Sequences | 35% | Hard | |
| 2953 | * Count Complete Substrings | 25% | Hard | |
| 2952 | * Minimum Number of Coins to be Added | 53% | Medium | |
| 2951 | * Find the Peaks | 76% | Easy | |
| 2949 | * Count Beautiful Substrings II | 24% | Hard | |
| 2948 | * Make Lexicographically Smallest Array by Swapping Elements | 38% | Medium | |
| 2947 | * Count Beautiful Substrings I | 61% | Medium | |
| 2946 | * Matrix Similarity After Cyclic Shifts | 57% | Easy | |
| 2945 | * Find Maximum Non-decreasing Array Length | 14% | Hard | |
| 2944 | * Minimum Number of Coins for Fruits | 43% | Medium | |
| 2943 | * Maximize Area of Square Hole in Grid | 35% | Medium | |
| 2942 | * Find Words Containing Character | 88% | Easy | |
| 2940 | * Find Building Where Alice and Bob Can Meet | 34% | Hard | |
| 2939 | * Maximum Xor Product | 24% | Medium | |
| 2938 | * Separate Black and White Balls | 52% | Medium | |
| 2937 | * Make Three Strings Equal | 41% | Easy | |
| 2935 | * Maximum Strong Pair XOR II | 29% | Hard | |
| 2934 | * Minimum Operations to Maximize Last Elements in Arrays | 44% | Medium | |
| 2933 | * High-Access Employees | 43% | Medium | |
| 2932 | * Maximum Strong Pair XOR I | 75% | Easy | |
| 2931 | * Maximum Spending After Buying Items | 64% | Hard | |
| 2930 | * Number of Strings Which Can Be Rearranged to Contain Substring | 54% | Medium | |
| 2929 | * Distribute Candies Among Children II | 34% | Medium | |
| 2928 | * Distribute Candies Among Children I | 73% | Easy | |
| 2926 | * Maximum Balanced Subsequence Sum | 22% | Hard | |
| 2925 | * Maximum Score After Applying Operations on a Tree | 48% | Medium | |
| 2924 | * Find Champion II | 56% | Medium | |
| 2923 | * Find Champion I | 72% | Easy | |
| 2920 | * Maximum Points After Collecting Coins From All Nodes | 36% | Hard | |
| 2919 | * Minimum Increment Operations to Make Array Beautiful | 33% | Medium | |
| 2918 | * Minimum Equal Sum of Two Arrays After Replacing Zeros | 33% | Medium | |
| 2917 | * Find the K-or of an Array | 74% | Easy | |
| 2916 | * Subarrays Distinct Element Sum of Squares II | 18% | Hard | |
| 2915 | * Length of the Longest Subsequence That Sums to Target | 34% | Medium | |
| 2914 | * Minimum Number of Changes to Make Binary String Beautiful | 59% | Medium | |
| 2913 | * Subarrays Distinct Element Sum of Squares I | 82% | Easy | |
| 2911 | * Minimum Changes to Make K Semi-palindromes | 34% | Hard | |
| 2910 | * Minimum Number of Groups to Create a Valid Assignment | 25% | Medium | |
| 2909 | * Minimum Sum of Mountain Triplets II | 53% | Medium | |
| 2908 | * Minimum Sum of Mountain Triplets I | 63% | Easy | |
| 2906 | * Construct Product Matrix | 30% | Medium | |
| 2905 | * Find Indices With Index and Value Difference II | 32% | Medium | |
| 2904 | * Shortest and Lexicographically Smallest Beautiful String | 37% | Medium | |
| 2903 | * Find Indices With Index and Value Difference I | 62% | Easy | |
| 2902 | * Count of Sub-Multisets With Bounded Sum | 19% | Hard | |
| 2901 | * Longest Unequal Adjacent Groups Subsequence II | 26% | Medium | |
| 2900 | * Longest Unequal Adjacent Groups Subsequence I | 65% | Easy | |
| 2899 | * Last Visited Integers | 65% | Easy | |
| 2897 | * Apply Operations on Array to Maximize Sum of Squares | 46% | Hard | |
| 2896 | * Apply Operations to Make Two Strings Equal | 25% | Medium | |
| 2895 | * Minimum Processing Time | 68% | Medium | |
| 2894 | * Divisible and Non-divisible Sums Difference | 88% | Easy | |
| 2876 | * Count Visited Nodes in a Directed Graph | 32% | Hard | |
| 2875 | * Minimum Size Subarray in Infinite Array | 30% | Medium | |
| 2874 | * Maximum Value of an Ordered Triplet II | 41% | Medium | |
| 2873 | * Maximum Value of an Ordered Triplet I | 44% | Easy | |
| 2872 | * Maximum Number of K-Divisible Components | 58% | Hard | |
| 2871 | * Split Array Into Maximum Number of Subarrays | 43% | Medium | |
| 2870 | Minimum Number of Operations to Make Array Empty | 61% | Medium | |
| 2869 | * Minimum Operations to Collect Elements | 59% | Easy | |
| 2867 | * Count Valid Paths in a Tree | 34% | Hard | |
| 2866 | * Beautiful Towers II | 33% | Medium | |
| 2865 | * Beautiful Towers I | 43% | Medium | |
| 2864 | * Maximum Odd Binary Number | 73% | Easy | |
| 2862 | * Maximum Element-Sum of a Complete Subset of Indices | 42% | Hard | |
| 2861 | * Maximum Number of Alloys | 37% | Medium | |
| 2860 | * Happy Students | 51% | Medium | |
| 2859 | * Sum of Values at Indices With K Set Bits | 86% | Easy | |
| 2858 | * Minimum Edge Reversals So Every Node Is Reachable | 58% | Hard | |
| 2857 | * Count Pairs of Points With Distance k | 31% | Medium | |
| 2856 | * Minimum Array Length After Pair Removals | 20% | Medium | |
| 2855 | * Minimum Right Shifts to Sort the Array | 57% | Easy | |
| 2851 | * String Transformation | 29% | Hard | |
| 2850 | * Minimum Moves to Spread Stones Over Grid | 42% | Medium | |
| 2849 | Determine if a Cell Is Reachable at a Given Time | 35% | Medium | |
| 2848 | * Points That Intersect With Cars | 74% | Easy | |
| 2846 | * Minimum Edge Weight Equilibrium Queries in a Tree | 43% | Hard | |
| 2845 | * Count of Interesting Subarrays | 34% | Medium | |
| 2844 | * Minimum Operations to Make a Special Number | 37% | Medium | |
| 2843 | * Count Symmetric Integers | 74% | Easy | |
| 2842 | * Count K-Subsequences of a String With Maximum Beauty | 28% | Hard | |
| 2841 | * Maximum Sum of Almost Unique Subarray | 37% | Medium | |
| 2840 | * Check if Strings Can be Made Equal With Operations II | 55% | Medium | |
| 2839 | * Check if Strings Can be Made Equal With Operations I | 46% | Easy | |
| 2836 | * Maximize Value of Function in a Ball Passing Game | 29% | Hard | |
| 2835 | * Minimum Operations to Form Subsequence With Target Sum | 31% | Hard | |
| 2834 | * Find the Minimum Possible Sum of a Beautiful Array | 39% | Medium | |
| 2833 | * Furthest Point From Origin | 63% | Easy | |
| 2831 | * Find the Longest Equal Subarray | 34% | Medium | |
| 2830 | * Maximize the Profit as the Salesman | 35% | Medium | |
| 2829 | * Determine the Minimum Sum of a k-avoiding Array | 60% | Medium | |
| 2828 | * Check if a String Is an Acronym of Words | 82% | Easy | |
| 2827 | * Number of Beautiful Integers in the Range | 17% | Hard | |
| 2826 | * Sorting Three Groups | 41% | Medium | |
| 2825 | * Make String a Subsequence Using Cyclic Increments | 48% | Medium | |
| 2824 | * Count Pairs Whose Sum is Less than Target | 86% | Easy | |
| 2818 | * Apply Operations to Maximize Score | 31% | Hard | |
| 2817 | * Minimum Absolute Difference Between Elements With Constraint | 32% | Medium | |
| 2816 | * Double a Number Represented as a Linked List | 49% | Medium | |
| 2815 | * Max Pair Sum in an Array | 57% | Easy | |
| 2813 | * Maximum Elegance of a K-Length Subsequence | 31% | Hard | |
| 2812 | * Find the Safest Path in a Grid | 30% | Medium | |
| 2811 | * Check if it is Possible to Split Array | 33% | Medium | |
| 2810 | * Faulty Keyboard | 82% | Easy | |
| 2809 | * Minimum Time to Make Array Sum At Most x | 24% | Hard | |
| 2808 | * Minimum Seconds to Equalize a Circular Array | 26% | Medium | |
| 2807 | * Insert Greatest Common Divisors in Linked List | 88% | Medium | |
| 2806 | * Account Balance After Rounded Purchase | 51% | Easy | |
| 2801 | * Count Stepping Numbers in Range | 27% | Hard | |
| 2800 | * Shortest String That Contains Three Strings | 29% | Medium | |
| 2799 | * Count Complete Subarrays in an Array | 63% | Medium | |
| 2798 | * Number of Employees Who Met the Target | 87% | Easy | |
| 2791 | * Count Paths That Can Form a Palindrome in a Tree | 45% | Hard | |
| 2790 | * Maximum Number of Groups With Increasing Length | 19% | Hard | |
| 2789 | Largest Element in an Array after Merge Operations | 46% | Medium | |
| 2788 | Split Strings by Separator | 73% | Easy | |
| 2787 | * Ways to Express an Integer as Sum of Powers | 33% | Medium | |
| 2786 | * Visit Array Positions to Maximize Score | 35% | Medium | |
| 2785 | Sort Vowels in a String | 81% | Medium | |
| 2784 | Check if Array is Good | 49% | Easy | |
| 2781 | * Length of the Longest Valid Substring | 35% | Hard | |
| 2780 | * Minimum Index of a Valid Split | 61% | Medium | |
| 2779 | * Maximum Beauty of an Array After Applying Operation | 37% | Medium | |
| 2778 | * Sum of Squares of Special Elements | 79% | Easy | |
| 2772 | * Apply Operations to Make All Array Elements Equal to Zero | 32% | Medium | |
| 2771 | * Longest Non-decreasing Subarray From Two Arrays | 28% | Medium | |
| 2770 | * Maximum Number of Jumps to Reach the Last Index | 29% | Medium | |
| 2769 | * Find the Maximum Achievable Number | 89% | Easy | |
| 2768 | * Number of Black Blocks | 35% | Medium | |
| 2767 | * Partition String Into Minimum Beautiful Substrings | 52% | Medium | |
| 2766 | * Relocate Marbles | 51% | Medium | |
| 2765 | * Longest Alternating Subarray | 33% | Easy | |
| 2763 | * Sum of Imbalance Numbers of All Subarrays | 45% | Hard | |
| 2762 | * Continuous Subarrays | 40% | Medium | |
| 2761 | Prime Pairs With Target Sum | 33% | Medium | |
| 2760 | Longest Even Odd Subarray With Threshold | 29% | Easy | |
| 2751 | * Robot Collisions | 40% | Hard | |
| 2750 | Ways to Split Array Into Good Subarrays | 33% | Medium | |
| 2749 | * Minimum Operations to Make the Integer Zero | 28% | Medium | |
| 2748 | Number of Beautiful Pairs | 49% | Easy | |
| 2747 | * Count Zero Request Servers | 31% | Medium | |
| 2746 | * Decremental String Concatenation | 25% | Medium | |
| 2745 | Construct the Longest New String | 53% | Medium | |
| 2744 | Find Maximum Number of String Pairs | 80% | Easy | |
| 2742 | Painting the Walls | 51% | Hard | |
| 2741 | * Special Permutations | 27% | Medium | |
| 2740 | Find the Value of the Partition | 64% | Medium | |
| 2739 | Total Distance Traveled | 38% | Easy | |
| 2736 | * Maximum Sum Queries | 28% | Hard | |
| 2735 | * Collecting Chocolates | 32% | Medium | |
| 2734 | Lexicographically Smallest String After Substring Operation | 30% | Medium | |
| 2733 | Neither Minimum nor Maximum | 76% | Easy | |
| 2732 | * Find a Good Subset of the Matrix | 44% | Hard | |
| 2731 | * Movement of Robots | 27% | Medium | |
| 2730 | * Find the Longest Semi-Repetitive Substring | 35% | Medium | |
| 2729 | * Check if The Number is Fascinating | 51% | Easy | |
| 2719 | * Count of Integers | 34% | Hard | |
| 2718 | * Sum of Matrix After Queries | 30% | Medium | |
| 2717 | * Semi-Ordered Permutation | 63% | Easy | |
| 2716 | * Minimize String Length | 75% | Easy | |
| 2713 | * Maximum Strictly Increasing Cells in a Matrix | 29% | Hard | |
| 2712 | * Minimum Cost to Make All Characters Equal | 53% | Medium | |
| 2711 | * Difference of Number of Distinct Values on Diagonals | 70% | Medium | |
| 2710 | * Remove Trailing Zeros From a String | 78% | Easy | |
| 2709 | Greatest Common Divisor Traversal | 42% | Hard | |
| 2708 | * Maximum Strength of a Group | 23% | Medium | |
| 2707 | Extra Characters in a String | 52% | Medium | |
| 2706 | Buy Two Chocolates | 69% | Easy | |
| 2699 | * Modify Graph Edge Weights | 23% | Hard | |
| 2698 | * Find the Punishment Number of an Integer | 61% | Medium | |
| 2697 | * Lexicographically Smallest Palindrome | 80% | Easy | |
| 2696 | * Minimum String Length After Removing Substrings | 68% | Easy | |
| 2685 | * Count the Number of Complete Components | 65% | Medium | |
| 2684 | * Maximum Number of Moves in a Grid | 45% | Medium | |
| 2683 | * Neighboring Bitwise XOR | 61% | Medium | |
| 2682 | * Find the Losers of the Circular Game | 48% | Easy | |
| 2681 | * Power of Heroes | 30% | Hard | |
| 2680 | * Maximum OR | 40% | Medium | |
| 2679 | * Sum in a Matrix | 59% | Medium | |
| 2678 | * Number of Senior Citizens | 76% | Easy | |
| 2673 | * Make Costs of Paths Equal in a Binary Tree | 58% | Medium | |
| 2672 | * Number of Adjacent Elements With the Same Color | 54% | Medium | |
| 2671 | * Frequency Tracker | 29% | Medium | |
| 2670 | * Find the Distinct Difference Array | 76% | Easy | |
| 2663 | * Lexicographically Smallest Beautiful String | 36% | Hard | |
| 2662 | * Minimum Cost of a Path With Special Roads | 37% | Medium | |
| 2661 | * First Completely Painted Row or Column | 50% | Medium | |
| 2660 | * Determine the Winner of a Bowling Game | 34% | Easy | |
| 2659 | * Make Array Empty | 24% | Hard | |
| 2658 | * Maximum Number of Fish in a Grid | 59% | Medium | |
| 2657 | * Find the Prefix Common Array of Two Arrays | 80% | Medium | |
| 2656 | * Maximum Sum With Exactly K Elements | 81% | Easy | |
| 2654 | * Minimum Number of Operations to Make All Array Elements Equal to 1 | 34% | Medium | |
| 2653 | * Sliding Subarray Beauty | 32% | Medium | |
| 2652 | * Sum Multiples | 84% | Easy | |
| 2651 | * Calculate Delayed Arrival Time | 78% | Easy | |
| 2646 | * Minimize the Total Price of the Trips | 44% | Hard | |
| 2645 | * Minimum Additions to Make Valid String | 49% | Medium | |
| 2644 | * Find the Maximum Divisibility Score | 48% | Easy | |
| 2643 | * Row With Maximum Ones | 75% | Easy | |
| 2642 | Design Graph With Shortest Path Calculator | 70% | Hard | |
| 2641 | * Cousins in Binary Tree II | 68% | Medium | |
| 2640 | * Find the Score of All Prefixes of an Array | 69% | Medium | |
| 2639 | * Find the Width of Columns of a Grid | 66% | Easy | |
| 2617 | * Minimum Number of Visited Cells in a Grid | 24% | Hard | |
| 2616 | Minimize the Maximum Difference of Pairs | 43% | Medium | |
| 2615 | * Sum of Distances | 30% | Medium | |
| 2614 | * Prime In Diagonal | 33% | Easy | |
| 2612 | * Minimum Reverse Operations | 16% | Hard | |
| 2611 | * Mice and Cheese | 43% | Medium | |
| 2610 | Convert an Array Into a 2D Array With Conditions | 87% | Medium | |
| 2609 | * Find the Longest Balanced Substring of a Binary String | 45% | Easy | |
| 2608 | * Shortest Cycle in a Graph | 36% | Hard | |
| 2607 | * Make K-Subarray Sums Equal | 35% | Medium | |
| 2606 | * Find the Substring With Maximum Cost | 56% | Medium | |
| 2605 | * Form Smallest Number From Two Digit Arrays | 53% | Easy | |
| 2603 | * Collect Coins in a Tree | 36% | Hard | |
| 2602 | * Minimum Operations to Make All Array Elements Equal | 34% | Medium | |
| 2601 | * Prime Subtraction Operation | 37% | Medium | |
| 2600 | * K Items With the Maximum Sum | 61% | Easy | |
| 2598 | * Smallest Missing Non-negative Integer After Operations | 38% | Medium | |
| 2597 | * The Number of Beautiful Subsets | 33% | Medium | |
| 2596 | * Check Knight Tour Configuration | 56% | Medium | |
| 2595 | * Number of Even and Odd Bits | 72% | Easy | |
| 2594 | * Minimum Time to Repair Cars | 42% | Medium | |
| 2593 | * Find Score of an Array After Marking All Elements | 52% | Medium | |
| 2592 | * Maximize Greatness of an Array | 56% | Medium | |
| 2591 | * Distribute Money to Maximum Children | 19% | Easy | |
| 2589 | * Minimum Time to Complete All Tasks | 38% | Hard | |
| 2588 | * Count the Number of Beautiful Subarrays | 49% | Medium | |
| 2587 | * Rearrange Array to Maximize Prefix Score | 40% | Medium | |
| 2586 | * Count the Number of Vowel Strings in Range | 74% | Easy | |
| 2585 | * Number of Ways to Earn Points | 57% | Hard | |
| 2584 | * Split the Array to Make Coprime Products | 22% | Hard | |
| 2583 | * Kth Largest Sum in a Binary Tree | 47% | Medium | |
| 2582 | * Pass the Pillow | 45% | Easy | |
| 2581 | * Count Number of Possible Root Nodes | 45% | Hard | |
| 2580 | * Count Ways to Group Overlapping Ranges | 35% | Medium | |
| 2579 | * Count Total Number of Colored Cells | 57% | Medium | |
| 2578 | * Split With Minimum Sum | 69% | Easy | |
| 2577 | * Minimum Time to Visit a Cell In a Grid | 35% | Hard | |
| 2576 | * Find the Maximum Number of Marked Indices | 37% | Medium | |
| 2575 | * Find the Divisibility Array of a String | 32% | Medium | |
| 2574 | * Left and Right Sum Differences | 86% | Easy | |
| 2573 | * Find the String with LCP | 31% | Hard | |
| 2572 | * Count the Number of Square-Free Subsets | 22% | Medium | |
| 2571 | * Minimum Operations to Reduce an Integer to 0 | 53% | Medium | |
| 2570 | * Merge Two 2D Arrays by Summing Values | 73% | Easy | |
| 2569 | * Handling Sum Queries After Update | 26% | Hard | |
| 2568 | * Minimum Impossible OR | 57% | Medium | |
| 2567 | * Minimum Score by Changing Two Elements | 47% | Medium | |
| 2566 | * Maximum Difference by Remapping a Digit | 59% | Easy | |
| 2565 | * Subsequence With the Minimum Score | 31% | Hard | |
| 2564 | * Substring XOR Queries | 33% | Medium | |
| 2563 | * Count the Number of Fair Pairs | 32% | Medium | |
| 2562 | * Find the Array Concatenation Value | 69% | Easy | |
| 2561 | * Rearranging Fruits | 33% | Hard | |
| 2560 | * House Robber IV | 42% | Medium | |
| 2559 | * Count Vowel Strings in Ranges | 51% | Medium | |
| 2558 | * Take Gifts From the Richest Pile | 66% | Easy | |
| 2556 | * Disconnect Path in a Binary Matrix by at Most One Flip | 27% | Medium | |
| 2555 | * Maximize Win From Two Segments | 32% | Medium | |
| 2554 | * Maximum Number of Integers to Choose From a Range I | 52% | Medium | |
| 2553 | * Separate the Digits in an Array | 78% | Easy | |
| 2552 | * Count Increasing Quadruplets | 33% | Hard | |
| 2551 | Put Marbles in Bags | 66% | Hard | |
| 2550 | * Count Collisions of Monkeys on a Polygon | 27% | Medium | |
| 2549 | * Count Distinct Numbers on Board | 59% | Easy | |
| 2547 | * Minimum Cost to Split an Array | 39% | Hard | |
| 2546 | * Apply Bitwise Operations to Make Strings Equal | 40% | Medium | |
| 2545 | * Sort the Students by Their Kth Score | 84% | Medium | |
| 2544 | * Alternating Digit Sum | 68% | Easy | |
| 2543 | * Check if Point Is Reachable | 41% | Hard | |
| 2542 | Maximum Subsequence Score | 53% | Medium | |
| 2541 | * Minimum Operations to Make Array Equal II | 31% | Medium | |
| 2540 | * Minimum Common Value | 50% | Easy | |
| 2538 | * Difference Between Maximum and Minimum Price Sum | 32% | Hard | |
| 2537 | * Count the Number of Good Subarrays | 49% | Medium | |
| 2536 | * Increment Submatrices by One | 48% | Medium | |
| 2535 | * Difference Between Element Sum and Digit Sum of an Array | 83% | Easy | |
| 2532 | * Time to Cross a Bridge | 45% | Hard | |
| 2531 | * Make Number of Distinct Characters Equal | 26% | Medium | |
| 2530 | * Maximal Score After Applying K Operations | 45% | Medium | |
| 2529 | * Maximum Count of Positive Integer and Negative Integer | 71% | Easy | |
| 2528 | * Maximize the Minimum Powered City | 32% | Hard | |
| 2527 | * Find Xor-Beauty of Array | 67% | Medium | |
| 2526 | * Find Consecutive Integers from a Data Stream | 48% | Medium | |
| 2525 | * Categorize Box According to Criteria | 34% | Easy | |
| 2523 | * Closest Prime Numbers in Range | 36% | Medium | |
| 2522 | * Partition String Into Substrings With Values at Most K | 46% | Medium | |
| 2521 | * Distinct Prime Factors of Product of Array | 50% | Medium | |
| 2520 | * Count the Digits That Divide a Number | 83% | Easy | |
| 2518 | * Number of Great Partitions | 31% | Hard | |
| 2517 | * Maximum Tastiness of Candy Basket | 62% | Medium | |
| 2516 | * Take K of Each Character From Left and Right | 34% | Medium | |
| 2515 | * Shortest Distance to Target String in a Circular Array | 48% | Easy | |
| 2514 | * Count Anagrams | 32% | Hard | |
| 2513 | * Minimize the Maximum of Two Arrays | 29% | Medium | |
| 2512 | * Reward Top K Students | 44% | Medium | |
| 2511 | * Maximum Enemy Forts That Can Be Captured | 37% | Easy | |
| 2509 | * Cycle Length Queries in a Tree | 55% | Hard | |
| 2508 | * Add Edges to Make Degrees of All Nodes Even | 31% | Hard | |
| 2507 | * Smallest Value After Replacing With Sum of Prime Factors | 48% | Medium | |
| 2506 | * Count Pairs Of Similar Strings | 69% | Easy | |
| 2503 | * Maximum Number of Points From Grid Queries | 36% | Hard | |
| 2502 | * Design Memory Allocator | 52% | Medium | |
| 2501 | * Longest Square Streak in an Array | 39% | Medium | |
| 2500 | * Delete Greatest Value in Each Row | 77% | Easy | |
| 2499 | * Minimum Total Cost to Make Arrays Unequal | 42% | Hard | |
| 2498 | * Frog Jump II | 61% | Medium | |
| 2497 | * Maximum Star Sum of a Graph | 38% | Medium | |
| 2496 | * Maximum Value of a String in an Array | 71% | Easy | |
| 2493 | * Divide Nodes Into the Maximum Number of Groups | 38% | Hard | |
| 2492 | Minimum Score of a Path Between Two Cities | 57% | Medium | |
| 2491 | * Divide Players Into Teams of Equal Skill | 59% | Medium | |
| 2490 | * Circular Sentence | 62% | Easy | |
| 2488 | * Count Subarrays With Median K | 44% | Hard | |
| 2487 | * Remove Nodes From Linked List | 65% | Medium | |
| 2486 | * Append Characters to String to Make Subsequence | 65% | Medium | |
| 2485 | * Find the Pivot Integer | 79% | Easy | |
| 2484 | * Count Palindromic Subsequences | 37% | Hard | |
| 2483 | Minimum Penalty for a Shop | 67% | Medium | |
| 2482 | Difference Between Ones and Zeros in Row and Column | 84% | Medium | |
| 2481 | * Minimum Cuts to Divide a Circle | 52% | Easy | |
| 2478 | * Number of Beautiful Partitions | 30% | Hard | |
| 2477 | Minimum Fuel Cost to Report to the Capital | 65% | Medium | |
| 2476 | * Closest Nodes Queries in a Binary Search Tree | 41% | Medium | |
| 2475 | * Number of Unequal Triplets in Array | 70% | Easy | |
| 2472 | * Maximum Number of Non-overlapping Palindrome Substrings | 39% | Hard | |
| 2471 | * Minimum Number of Operations to Sort a Binary Tree by Level | 61% | Medium | |
| 2470 | * Number of Subarrays With LCM Equal to K | 38% | Medium | |
| 2469 | * Convert the Temperature | 89% | Easy | |
| 2468 | * Split Message Based on Limit | 43% | Hard | |
| 2467 | * Most Profitable Path in a Tree | 48% | Medium | |
| 2466 | Count Ways To Build Good Strings | 54% | Medium | |
| 2465 | * Number of Distinct Averages | 57% | Easy | |
| 2463 | * Minimum Total Distance Traveled | 40% | Hard | |
| 2462 | Total Cost to Hire K Workers | 43% | Medium | |
| 2461 | * Maximum Sum of Distinct Subarrays With Length K | 33% | Medium | |
| 2460 | * Apply Operations to an Array | 67% | Easy | |
| 2458 | * Height of Binary Tree After Subtree Removal Queries | 39% | Hard | |
| 2457 | * Minimum Addition to Make Integer Beautiful | 37% | Medium | |
| 2456 | * Most Popular Video Creator | 43% | Medium | |
| 2455 | * Average Value of Even Numbers That Are Divisible by Three | 59% | Easy | |
| 2454 | * Next Greater Element IV | 38% | Hard | |
| 2453 | * Destroy Sequential Targets | 38% | Medium | |
| 2452 | * Words Within Two Edits of Dictionary | 60% | Medium | |
| 2451 | * Odd String Difference | 58% | Easy | |
| 2449 | * Minimum Number of Operations to Make Arrays Similar | 61% | Hard | |
| 2448 | Minimum Cost to Make Array Equal | 45% | Hard | |
| 2447 | * Number of Subarrays With GCD Equal to K | 49% | Medium | |
| 2446 | * Determine if Two Events Have Conflict | 50% | Easy | |
| 2444 | Count Subarrays With Fixed Bounds | 61% | Hard | |
| 2443 | * Sum of Number and Its Reverse | 46% | Medium | |
| 2442 | * Count Number of Distinct Integers After Reverse Operations | 78% | Medium | |
| 2441 | * Largest Positive Integer That Exists With Its Negative | 68% | Easy | |
| 2440 | * Create Components With Same Value | 53% | Hard | |
| 2439 | Minimize Maximum of Array | 46% | Medium | |
| 2438 | * Range Product Queries of Powers | 39% | Medium | |
| 2437 | * Number of Valid Clock Times | 45% | Easy | |
| 2435 | * Paths in Matrix Whose Sum Is Divisible by K | 42% | Hard | |
| 2434 | * Using a Robot to Print the Lexicographically Smallest String | 39% | Medium | |
| 2433 | Find The Original Array of Prefix Xor | 88% | Medium | |
| 2432 | * The Employee That Worked on the Longest Task | 49% | Easy | |
| 2430 | * Maximum Deletions on a String | 32% | Hard | |
| 2429 | * Minimize XOR | 43% | Medium | |
| 2428 | * Maximum Sum of an Hourglass | 74% | Medium | |
| 2427 | * Number of Common Factors | 78% | Easy | |
| 2426 | * Number of Pairs Satisfying Inequality | 43% | Hard | |
| 2425 | * Bitwise XOR of All Pairings | 58% | Medium | |
| 2424 | * Longest Uploaded Prefix | 54% | Medium | |
| 2423 | * Remove Letter To Equalize Frequency | 17% | Easy | |
| 2421 | Number of Good Paths | 56% | Hard | |
| 2420 | * Find All Good Indices | 38% | Medium | |
| 2419 | * Longest Subarray With Maximum Bitwise AND | 49% | Medium | |
| 2418 | * Sort the People | 79% | Easy | |
| 2416 | * Sum of Prefix Scores of Strings | 45% | Hard | |
| 2415 | * Reverse Odd Levels of Binary Tree | 77% | Medium | |
| 2414 | * Length of the Longest Alphabetical Continuous Substring | 57% | Medium | |
| 2413 | * Smallest Even Multiple | 87% | Easy | |
| 2412 | * Minimum Money Required Before Transactions | 39% | Hard | |
| 2411 | * Smallest Subarrays With Maximum Bitwise OR | 43% | Medium | |
| 2410 | * Maximum Matching of Players With Trainers | 62% | Medium | |
| 2409 | * Count Days Spent Together | 44% | Easy | |
| 2407 | * Longest Increasing Subsequence II | 22% | Hard | |
| 2406 | * Divide Intervals Into Minimum Number of Groups | 46% | Medium | |
| 2405 | Optimal Partition of String | 78% | Medium | |
| 2404 | * Most Frequent Even Element | 50% | Easy | |
| 2402 | Meeting Rooms III | 45% | Hard | |
| 2401 | * Longest Nice Subarray | 50% | Medium | |
| 2400 | * Number of Ways to Reach a Position After Exactly k Steps | 34% | Medium | |
| 2399 | * Check Distances Between Same Letters | 70% | Easy | |
| 2398 | * Maximum Number of Robots Within Budget | 33% | Hard | |
| 2397 | * Maximum Rows Covered by Columns | 54% | Medium | |
| 2396 | * Strictly Palindromic Number | 87% | Medium | |
| 2395 | * Find Subarrays With Equal Sum | 64% | Easy | |
| 2392 | * Build a Matrix With Conditions | 61% | Hard | |
| 2391 | Minimum Amount of Time to Collect Garbage | 85% | Medium | |
| 2390 | Removing Stars From a String | 74% | Medium | |
| 2389 | Longest Subsequence With Limited Sum | 71% | Easy | |
| 2386 | * Find the K-Sum of an Array | 38% | Hard | |
| 2385 | Amount of Time for Binary Tree to Be Infected | 63% | Medium | |
| 2384 | * Largest Palindromic Number | 33% | Medium | |
| 2383 | * Minimum Hours of Training to Win a Competition | 40% | Easy | |
| 2382 | * Maximum Segment Sum After Removals | 48% | Hard | |
| 2381 | * Shifting Letters II | 36% | Medium | |
| 2380 | * Time Needed to Rearrange a Binary String | 49% | Medium | |
| 2379 | * Minimum Recolors to Get K Consecutive Black Blocks | 58% | Easy | |
| 2376 | * Count Special Integers | 38% | Hard | |
| 2375 | * Construct Smallest Number From DI String | 75% | Medium | |
| 2374 | * Node With Highest Edge Score | 47% | Medium | |
| 2373 | * Largest Local Values in a Matrix | 83% | Easy | |
| 2370 | * Longest Ideal Subsequence | 37% | Medium | |
| 2369 | Check if There is a Valid Partition For The Array | 51% | Medium | |
| 2368 | * Reachable Nodes With Restrictions | 58% | Medium | |
| 2367 | * Number of Arithmetic Triplets | 83% | Easy | |
| 2366 | Minimum Replacements to Sort the Array | 53% | Hard | |
| 2365 | * Task Scheduler II | 50% | Medium | |
| 2364 | * Count Number of Bad Pairs | 41% | Medium | |
| 2363 | * Merge Similar Items | 75% | Easy | |
| 2360 | Longest Cycle in a Graph | 50% | Hard | |
| 2359 | Find Closest Node to Given Two Nodes | 45% | Medium | |
| 2358 | * Maximum Number of Groups Entering a Competition | 67% | Medium | |
| 2357 | * Make Array Zero by Subtracting Equal Amounts | 72% | Easy | |
| 2354 | * Number of Excellent Pairs | 46% | Hard | |
| 2353 | Design a Food Rating System | 45% | Medium | |
| 2352 | Equal Row and Column Pairs | 71% | Medium | |
| 2351 | * First Letter to Appear Twice | 73% | Easy | |
| 2350 | * Shortest Impossible Sequence of Rolls | 68% | Hard | |
| 2349 | * Design a Number Container System | 44% | Medium | |
| 2348 | Number of Zero-Filled Subarrays | 66% | Medium | |
| 2347 | * Best Poker Hand | 60% | Easy | |
| 2344 | * Minimum Deletions to Make Array Divisible | 56% | Hard | |
| 2343 | * Query Kth Smallest Trimmed Number | 43% | Medium | |
| 2342 | * Max Sum of a Pair With Equal Sum of Digits | 54% | Medium | |
| 2341 | * Maximum Number of Pairs in Array | 75% | Easy | |
| 2338 | * Count the Number of Ideal Arrays | 26% | Hard | |
| 2337 | * Move Pieces to Obtain a String | 47% | Medium | |
| 2336 | Smallest Number in Infinite Set | 72% | Medium | |
| 2335 | * Minimum Amount of Time to Fill Cups | 57% | Easy | |
| 2334 | * Subarray With Elements Greater Than Varying Threshold | 42% | Hard | |
| 2333 | * Minimum Sum of Squared Difference | 25% | Medium | |
| 2332 | * The Latest Time to Catch a Bus | 26% | Medium | |
| 2331 | * Evaluate Boolean Binary Tree | 77% | Easy | |
| 2328 | Number of Increasing Paths in a Grid | 58% | Hard | |
| 2327 | * Number of People Aware of a Secret | 45% | Medium | |
| 2326 | * Spiral Matrix IV | 75% | Medium | |
| 2325 | * Decode the Message | 83% | Easy | |
| 2322 | * Minimum Score After Removals on a Tree | 52% | Hard | |
| 2321 | * Maximum Score Of Spliced Array | 56% | Hard | |
| 2320 | * Count Number of Ways to Place Houses | 41% | Medium | |
| 2319 | * Check if Matrix Is X-Matrix | 65% | Easy | |
| 2318 | * Number of Distinct Roll Sequences | 56% | Hard | |
| 2317 | * Maximum XOR After Operations | 79% | Medium | |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | 49% | Medium | |
| 2315 | * Count Asterisks | 82% | Easy | |
| 2312 | * Selling Pieces of Wood | 49% | Hard | |
| 2311 | * Longest Binary Subsequence Less Than or Equal to K | 37% | Medium | |
| 2310 | * Sum of Numbers With Units Digit K | 26% | Medium | |
| 2309 | * Greatest English Letter in Upper and Lower Case | 69% | Easy | |
| 2306 | Naming a Company | 46% | Hard | |
| 2305 | Fair Distribution of Cookies | 69% | Medium | |
| 2304 | * Minimum Path Cost in a Grid | 66% | Medium | |
| 2303 | * Calculate Amount Paid in Taxes | 64% | Easy | |
| 2302 | * Count Subarrays With Score Less Than K | 53% | Hard | |
| 2301 | * Match Substring After Replacement | 40% | Hard | |
| 2300 | Successful Pairs of Spells and Potions | 42% | Medium | |
| 2299 | * Strong Password Checker II | 54% | Easy | |
| 2296 | * Design a Text Editor | 43% | Hard | |
| 2295 | * Replace Elements in an Array | 57% | Medium | |
| 2294 | * Partition Array Such That Maximum Difference Is K | 73% | Medium | |
| 2293 | * Min Max Game | 63% | Easy | |
| 2290 | * Minimum Obstacle Removal to Reach Corner | 52% | Hard | |
| 2289 | * Steps to Make Array Non-decreasing | 21% | Medium | |
| 2288 | * Apply Discount to Prices | 29% | Medium | |
| 2287 | * Rearrange Characters to Make Target String | 58% | Easy | |
| 2286 | * Booking Concert Tickets in Groups | 16% | Hard | |
| 2285 | * Maximum Total Importance of Roads | 60% | Medium | |
| 2284 | * Sender With Largest Word Count | 56% | Medium | |
| 2283 | * Check if Number Has Equal Digit Count and Digit Value | 72% | Easy | |
| 2281 | * Sum of Total Strength of Wizards | 27% | Hard | |
| 2280 | * Minimum Lines to Represent a Line Chart | 25% | Medium | |
| 2279 | Maximum Bags With Full Capacity of Rocks | 67% | Medium | |
| 2278 | * Percentage of Letter in String | 73% | Easy | |
| 2276 | * Count Integers in Intervals | 34% | Hard | |
| 2275 | * Largest Combination With Bitwise AND Greater Than Zero | 72% | Medium | |
| 2274 | * Maximum Consecutive Floors Without Special Floors | 51% | Medium | |
| 2273 | * Find Resultant Array After Removing Anagrams | 57% | Easy | |
| 2272 | Substring With Largest Variance | 46% | Hard | |
| 2271 | * Maximum White Tiles Covered by a Carpet | 33% | Medium | |
| 2270 | * Number of Ways to Split Array | 47% | Medium | |
| 2269 | * Find the K-Beauty of a Number | 59% | Easy | |
| 2267 | * Check if There Is a Valid Parentheses String Path | 38% | Hard | |
| 2266 | * Count Number of Texts | 47% | Medium | |
| 2265 | Count Nodes Equal to Average of Subtree | 86% | Medium | |
| 2264 | Largest 3-Same-Digit Number in String | 69% | Easy | |
| 2262 | * Total Appeal of A String | 55% | Hard | |
| 2261 | * K Divisible Elements Subarrays | 50% | Medium | |
| 2260 | * Minimum Consecutive Cards to Pick Up | 50% | Medium | |
| 2259 | * Remove Digit From Number to Maximize Result | 44% | Easy | |
| 2258 | * Escape the Spreading Fire | 34% | Hard | |
| 2257 | * Count Unguarded Cells in the Grid | 52% | Medium | |
| 2256 | Minimum Average Difference | 43% | Medium | |
| 2255 | * Count Prefixes of a Given String | 72% | Easy | |
| 2251 | Number of Flowers in Full Bloom | 56% | Hard | |
| 2250 | * Count Number of Rectangles Containing Each Point | 34% | Medium | |
| 2249 | * Count Lattice Points Inside a Circle | 51% | Medium | |
| 2248 | * Intersection of Multiple Arrays | 67% | Easy | |
| 2246 | Longest Path With Different Adjacent Characters | 54% | Hard | |
| 2245 | * Maximum Trailing Zeros in a Cornered Path | 35% | Medium | |
| 2244 | Minimum Rounds to Complete All Tasks | 62% | Medium | |
| 2243 | * Calculate Digit Sum of a String | 65% | Easy | |
| 2242 | * Maximum Score of a Node Sequence | 38% | Hard | |
| 2241 | * Design an ATM Machine | 40% | Medium | |
| 2240 | * Number of Ways to Buy Pens and Pencils | 56% | Medium | |
| 2239 | * Find Closest Number to Zero | 44% | Easy | |
| 2236 | * Root Equals Sum of Children | 83% | Easy | |
| 2235 | * Add Two Integers | 87% | Easy | |
| 2234 | * Maximum Total Beauty of the Gardens | 28% | Hard | |
| 2233 | * Maximum Product After K Increments | 41% | Medium | |
| 2232 | * Minimize Result by Adding Parentheses to Expression | 66% | Medium | |
| 2231 | * Largest Number After Digit Swaps by Parity | 61% | Easy | |
| 2227 | * Encrypt and Decrypt Strings | 40% | Hard | |
| 2226 | * Maximum Candies Allocated to K Children | 37% | Medium | |
| 2225 | Find Players With Zero or One Losses | 73% | Medium | |
| 2224 | * Minimum Number of Operations to Convert Time | 65% | Easy | |
| 2223 | * Sum of Scores of Built Strings | 39% | Hard | |
| 2222 | * Number of Ways to Select Buildings | 50% | Medium | |
| 2221 | * Find Triangular Sum of an Array | 78% | Medium | |
| 2220 | * Minimum Bit Flips to Convert Number | 83% | Easy | |
| 2218 | Maximum Value of K Coins From Piles | 60% | Hard | |
| 2217 | * Find Palindrome With Fixed Length | 35% | Medium | |
| 2216 | * Minimum Deletions to Make Array Beautiful | 47% | Medium | |
| 2215 | Find the Difference of Two Arrays | 78% | Easy | |
| 2213 | * Longest Substring of One Repeating Character | 31% | Hard | |
| 2212 | * Maximum Points in an Archery Competition | 49% | Medium | |
| 2211 | * Count Collisions on a Road | 43% | Medium | |
| 2210 | * Count Hills and Valleys in an Array | 59% | Easy | |
| 2209 | * Minimum White Tiles After Covering With Carpets | 35% | Hard | |
| 2208 | * Minimum Operations to Halve Array Sum | 46% | Medium | |
| 2207 | * Maximize Number of Subsequences in a String | 34% | Medium | |
| 2206 | * Divide Array Into Equal Pairs | 73% | Easy | |
| 2203 | * Minimum Weighted Subgraph With the Required Paths | 36% | Hard | |
| 2202 | * Maximize the Topmost Element After K Moves | 22% | Medium | |
| 2201 | * Count Artifacts That Can Be Extracted | 56% | Medium | |
| 2200 | * Find All K-Distant Indices in an Array | 65% | Easy | |
| 2197 | * Replace Non-Coprime Numbers in Array | 38% | Hard | |
| 2196 | * Create Binary Tree From Descriptions | 72% | Medium | |
| 2195 | * Append K Integers With Minimal Sum | 25% | Medium | |
| 2194 | * Cells in a Range on an Excel Sheet | 83% | Easy | |
| 2193 | * Minimum Number of Moves to Make Palindrome | 51% | Hard | |
| 2192 | * All Ancestors of a Node in a Directed Acyclic Graph | 51% | Medium | |
| 2191 | * Sort the Jumbled Numbers | 46% | Medium | |
| 2190 | * Most Frequent Number Following Key In an Array | 58% | Easy | |
| 2188 | * Minimum Time to Finish the Race | 41% | Hard | |
| 2187 | Minimum Time to Complete Trips | 38% | Medium | |
| 2186 | * Minimum Number of Steps to Make Two Strings Anagram II | 72% | Medium | |
| 2185 | * Counting Words With a Given Prefix | 77% | Easy | |
| 2183 | * Count Array Pairs Divisible by K | 29% | Hard | |
| 2182 | * Construct String With Repeat Limit | 53% | Medium | |
| 2181 | * Merge Nodes in Between Zeros | 85% | Medium | |
| 2180 | * Count Integers With Even Digit Sum | 66% | Easy | |
| 2179 | * Count Good Triplets in an Array | 40% | Hard | |
| 2178 | * Maximum Split of Positive Even Integers | 59% | Medium | |
| 2177 | * Find Three Consecutive Integers That Sum to a Given Number | 64% | Medium | |
| 2176 | * Count Equal and Divisible Pairs in an Array | 79% | Easy | |
| 2172 | * Maximum AND Sum of Array | 48% | Hard | |
| 2171 | * Removing Minimum Number of Magic Beans | 42% | Medium | |
| 2170 | * Minimum Operations to Make the Array Alternating | 33% | Medium | |
| 2169 | * Count Operations to Obtain Zero | 74% | Easy | |
| 2167 | * Minimum Time to Remove All Cars Containing Illegal Goods | 41% | Hard | |
| 2166 | * Design Bitset | 32% | Medium | |
| 2165 | * Smallest Value of the Rearranged Number | 51% | Medium | |
| 2164 | * Sort Even and Odd Indices Independently | 62% | Easy | |
| 2163 | * Minimum Difference in Sums After Removal of Elements | 47% | Hard | |
| 2162 | * Minimum Cost to Set Cooking Time | 40% | Medium | |
| 2161 | * Partition Array According to Given Pivot | 84% | Medium | |
| 2160 | * Minimum Sum of Four Digit Number After Splitting Digits | 86% | Easy | |
| 2157 | * Groups of Strings | 25% | Hard | |
| 2156 | * Find Substring With Given Hash Value | 23% | Hard | |
| 2155 | * All Divisions With the Highest Score of a Binary Array | 63% | Medium | |
| 2154 | * Keep Multiplying Found Values by Two | 71% | Easy | |
| 2151 | * Maximum Good People Based on Statements | 49% | Hard | |
| 2150 | * Find All Lonely Numbers in the Array | 60% | Medium | |
| 2149 | Rearrange Array Elements by Sign | 83% | Medium | |
| 2148 | * Count Elements With Strictly Smaller and Greater Elements | 59% | Easy | |
| 2147 | Number of Ways to Divide a Long Corridor | 49% | Hard | |
| 2146 | * K Highest Ranked Items Within a Price Range | 42% | Medium | |
| 2145 | * Count the Hidden Sequences | 37% | Medium | |
| 2144 | * Minimum Cost of Buying Candies With Discount | 60% | Easy | |
| 2141 | Maximum Running Time of N Computers | 50% | Hard | |
| 2140 | Solving Questions With Brainpower | 54% | Medium | |
| 2139 | * Minimum Moves to Reach Target Score | 49% | Medium | |
| 2138 | * Divide a String Into Groups of Size k | 66% | Easy | |
| 2136 | Earliest Possible Day of Full Bloom | 71% | Hard | |
| 2135 | * Count Words Obtained After Adding a Letter | 42% | Medium | |
| 2134 | * Minimum Swaps to Group All 1's Together II | 51% | Medium | |
| 2133 | * Check if Every Row and Column Contains All Numbers | 51% | Easy | |
| 2132 | * Stamping the Grid | 32% | Hard | |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | 48% | Medium | |
| 2130 | Maximum Twin Sum of a Linked List | 81% | Medium | |
| 2129 | * Capitalize the Title | 63% | Easy | |
| 2127 | * Maximum Employees to Be Invited to a Meeting | 36% | Hard | |
| 2126 | * Destroying Asteroids | 51% | Medium | |
| 2125 | Number of Laser Beams in a Bank | 85% | Medium | |
| 2124 | * Check if All A's Appears Before All B's | 71% | Easy | |
| 2122 | * Recover the Original Array | 38% | Hard | |
| 2121 | * Intervals Between Identical Elements | 44% | Medium | |
| 2120 | * Execution of All Suffix Instructions Staying in a Grid | 82% | Medium | |
| 2119 | * A Number After a Double Reversal | 79% | Easy | |
| 2117 | * Abbreviating the Product of a Range | 26% | Hard | |
| 2116 | * Check if a Parentheses String Can Be Valid | 31% | Medium | |
| 2115 | * Find All Possible Recipes from Given Supplies | 49% | Medium | |
| 2114 | * Maximum Number of Words Found in Sentences | 86% | Easy | |
| 2111 | * Minimum Operations to Make the Array K-Increasing | 38% | Hard | |
| 2110 | * Number of Smooth Descent Periods of a Stock | 58% | Medium | |
| 2109 | * Adding Spaces to a String | 57% | Medium | |
| 2108 | Find First Palindromic String in the Array | 84% | Easy | |
| 2106 | * Maximum Fruits Harvested After at Most K Steps | 35% | Hard | |
| 2105 | * Watering Plants II | 48% | Medium | |
| 2104 | * Sum of Subarray Ranges | 61% | Medium | |
| 2103 | * Rings and Rods | 80% | Easy | |
| 2102 | * Sequentially Ordinal Rank Tracker | 64% | Hard | |
| 2101 | Detonate the Maximum Bombs | 48% | Medium | |
| 2100 | * Find Good Days to Rob the Bank | 49% | Medium | |
| 2099 | * Find Subsequence of Length K With the Largest Sum | 43% | Easy | |
| 2097 | * Valid Arrangement of Pairs | 42% | Hard | |
| 2096 | * Step-By-Step Directions From a Binary Tree Node to Another | 48% | Medium | |
| 2095 | Delete the Middle Node of a Linked List | 58% | Medium | |
| 2094 | * Finding 3-Digit Even Numbers | 59% | Easy | |
| 2092 | Find All People With Secret | 46% | Hard | |
| 2091 | * Removing Minimum and Maximum From Array | 54% | Medium | |
| 2090 | K Radius Subarray Averages | 46% | Medium | |
| 2089 | * Find Target Indices After Sorting Array | 76% | Easy | |
| 2088 | * Count Fertile Pyramids in a Land | 64% | Hard | |
| 2087 | * Minimum Cost Homecoming of a Robot in a Grid | 50% | Medium | |
| 2086 | * Minimum Number of Food Buckets to Feed the Hamsters | 44% | Medium | |
| 2085 | * Count Common Words With One Occurrence | 69% | Easy | |
| 2081 | * Sum of k-Mirror Numbers | 42% | Hard | |
| 2080 | * Range Frequency Queries | 39% | Medium | |
| 2079 | * Watering Plants | 79% | Medium | |
| 2078 | * Two Furthest Houses With Different Colors | 66% | Easy | |
| 2076 | * Process Restricted Friend Requests | 54% | Hard | |
| 2075 | * Decode the Slanted Ciphertext | 49% | Medium | |
| 2074 | * Reverse Nodes in Even Length Groups | 56% | Medium | |
| 2073 | * Time Needed to Buy Tickets | 62% | Easy | |
| 2071 | * Maximum Number of Tasks You Can Assign | 33% | Hard | |
| 2070 | * Most Beautiful Item for Each Query | 49% | Medium | |
| 2069 | * Walking Robot Simulation II | 24% | Medium | |
| 2068 | * Check Whether Two Strings are Almost Equivalent | 63% | Easy | |
| 2065 | * Maximum Path Quality of a Graph | 57% | Hard | |
| 2064 | * Minimized Maximum of Products Distributed to Any Store | 51% | Medium | |
| 2063 | * Vowels of All Substrings | 54% | Medium | |
| 2062 | * Count Vowel Substrings of a String | 67% | Easy | |
| 2060 | * Check if an Original String Exists Given Two Encoded Strings | 42% | Hard | |
| 2059 | * Minimum Operations to Convert Number | 48% | Medium | |
| 2058 | * Find the Minimum and Maximum Number of Nodes Between Critical Points | 57% | Medium | |
| 2057 | * Smallest Index With Equal Value | 72% | Easy | |
| 2056 | * Number of Valid Move Combinations On Chessboard | 52% | Hard | |
| 2055 | * Plates Between Candles | 44% | Medium | |
| 2054 | * Two Best Non-Overlapping Events | 46% | Medium | |
| 2053 | * Kth Distinct String in an Array | 72% | Easy | |
| 2050 | Parallel Courses III | 67% | Hard | |
| 2049 | * Count Nodes With the Highest Score | 48% | Medium | |
| 2048 | * Next Greater Numerically Balanced Number | 47% | Medium | |
| 2047 | * Number of Valid Words in a Sentence | 28% | Easy | |
| 2045 | * Second Minimum Time to Reach Destination | 40% | Hard | |
| 2044 | * Count Number of Maximum Bitwise-OR Subsets | 76% | Medium | |
| 2043 | * Simple Bank System | 64% | Medium | |
| 2042 | * Check if Numbers Are Ascending in a Sentence | 69% | Easy | |
| 2040 | * Kth Smallest Product of Two Sorted Arrays | 28% | Hard | |
| 2039 | * The Time When the Network Becomes Idle | 51% | Medium | |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | 62% | Medium | |
| 2037 | * Minimum Number of Moves to Seat Everyone | 81% | Easy | |
| 2035 | * Partition Array Into Two Arrays to Minimize Sum Difference | 19% | Hard | |
| 2034 | * Stock Price Fluctuation | 48% | Medium | |
| 2033 | * Minimum Operations to Make a Uni-Value Grid | 52% | Medium | |
| 2032 | * Two Out of Three | 74% | Easy | |
| 2030 | * Smallest K-Length Subsequence With Occurrences of a Letter | 38% | Hard | |
| 2029 | * Stone Game IX | 27% | Medium | |
| 2028 | * Find Missing Observations | 46% | Medium | |
| 2027 | * Minimum Moves to Convert String | 54% | Easy | |
| 2025 | * Maximum Number of Ways to Partition an Array | 33% | Hard | |
| 2024 | Maximize the Confusion of an Exam | 67% | Medium | |
| 2023 | * Number of Pairs of Strings With Concatenation Equal to Target | 74% | Medium | |
| 2022 | * Convert 1D Array Into 2D Array | 60% | Easy | |
| 2019 | * The Score of Students Solving Math Expression | 33% | Hard | |
| 2018 | * Check if Word Can Be Placed In Crossword | 49% | Medium | |
| 2017 | * Grid Game | 45% | Medium | |
| 2016 | * Maximum Difference Between Increasing Elements | 55% | Easy | |
| 2014 | * Longest Subsequence Repeated k Times | 54% | Hard | |
| 2013 | * Detect Squares | 50% | Medium | |
| 2012 | * Sum of Beauty in the Array | 47% | Medium | |
| 2011 | * Final Value of Variable After Performing Operations | 88% | Easy | |
| 2009 | Minimum Number of Operations to Make Array Continuous | 53% | Hard | |
| 2008 | * Maximum Earnings From Taxi | 44% | Medium | |
| 2007 | Find Original Array From Doubled Array | 40% | Medium | |
| 2006 | * Count Number of Pairs With Absolute Difference K | 83% | Easy | |
| 2003 | * Smallest Missing Genetic Value in Each Subtree | 46% | Hard | |
| 2002 | * Maximum Product of the Length of Two Palindromic Subsequences | 58% | Medium | |
| 2001 | * Number of Pairs of Interchangeable Rectangles | 48% | Medium | |
| 2000 | * Reverse Prefix of Word | 80% | Easy | |
| 1998 | * GCD Sort of an Array | 45% | Hard | |
| 1997 | * First Day Where You Have Been in All the Rooms | 37% | Medium | |
| 1996 | The Number of Weak Characters in the Game | 43% | Medium | |
| 1995 | * Count Special Quadruplets | 60% | Easy | |
| 1994 | * The Number of Good Subsets | 34% | Hard | |
| 1993 | * Operations on Tree | 45% | Medium | |
| 1992 | * Find All Groups of Farmland | 68% | Medium | |
| 1991 | * Find the Middle Index in Array | 67% | Easy | |
| 1987 | * Number of Unique Good Subsequences | 52% | Hard | |
| 1986 | * Minimum Number of Work Sessions to Finish the Tasks | 33% | Medium | |
| 1985 | * Find the Kth Largest Integer in the Array | 45% | Medium | |
| 1984 | * Minimum Difference Between Highest and Lowest of K Scores | 56% | Easy | |
| 1982 | * Find Array Given Subset Sums | 48% | Hard | |
| 1981 | * Minimize the Difference Between Target and Chosen Elements | 34% | Medium | |
| 1980 | Find Unique Binary String | 74% | Medium | |
| 1979 | * Find Greatest Common Divisor of Array | 77% | Easy | |
| 1977 | * Number of Ways to Separate Numbers | 20% | Hard | |
| 1976 | * Number of Ways to Arrive at Destination | 28% | Medium | |
| 1975 | * Maximum Matrix Sum | 49% | Medium | |
| 1974 | * Minimum Time to Type Word Using Special Typewriter | 74% | Easy | |
| 1971 | Find if Path Exists in Graph | 51% | Easy | |
| 1970 | Last Day Where You Can Still Cross | 62% | Hard | |
| 1969 | * Minimum Non-Zero Product of the Array Elements | 35% | Medium | |
| 1968 | * Array With Elements Not Equal to Average of Neighbors | 49% | Medium | |
| 1967 | * Number of Strings That Appear as Substrings in Word | 80% | Easy | |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | 63% | Hard | |
| 1963 | * Minimum Number of Swaps to Make the String Balanced | 70% | Medium | |
| 1962 | Remove Stones to Minimize the Total | 61% | Medium | |
| 1961 | * Check If String Is a Prefix of Array | 52% | Easy | |
| 1960 | * Maximum Product of the Length of Two Palindromic Substrings | 30% | Hard | |
| 1959 | * Minimum Total Space Wasted With K Resizing Operations | 42% | Medium | |
| 1958 | * Check if Move is Legal | 47% | Medium | |
| 1957 | * Delete Characters to Make Fancy String | 57% | Easy | |
| 1955 | * Count Number of Special Subsequences | 51% | Hard | |
| 1954 | * Minimum Garden Perimeter to Collect Enough Apples | 53% | Medium | |
| 1953 | * Maximum Number of Weeks for Which You Can Work | 40% | Medium | |
| 1952 | * Three Divisors | 59% | Easy | |
| 1948 | * Delete Duplicate Folders in System | 56% | Hard | |
| 1947 | * Maximum Compatibility Score Sum | 61% | Medium | |
| 1946 | * Largest Number After Mutating Substring | 35% | Medium | |
| 1945 | * Sum of Digits of String After Convert | 62% | Easy | |
| 1944 | * Number of Visible People in a Queue | 68% | Hard | |
| 1943 | * Describe the Painting | 49% | Medium | |
| 1942 | * The Number of the Smallest Unoccupied Chair | 41% | Medium | |
| 1941 | * Check if All Characters Have Equal Number of Occurrences | 77% | Easy | |
| 1938 | * Maximum Genetic Difference Query | 41% | Hard | |
| 1937 | * Maximum Number of Points with Cost | 35% | Medium | |
| 1936 | * Add Minimum Number of Rungs | 43% | Medium | |
| 1935 | * Maximum Number of Words You Can Type | 72% | Easy | |
| 1932 | * Merge BSTs to Create Single BST | 36% | Hard | |
| 1931 | * Painting a Grid With Three Different Colors | 57% | Hard | |
| 1930 | Unique Length-3 Palindromic Subsequences | 66% | Medium | |
| 1929 | * Concatenation of Array | 89% | Easy | |
| 1928 | * Minimum Cost to Reach Destination in Time | 37% | Hard | |
| 1927 | * Sum Game | 47% | Medium | |
| 1926 | Nearest Exit from Entrance in Maze | 46% | Medium | |
| 1925 | * Count Square Sum Triples | 67% | Easy | |
| 1923 | * Longest Common Subpath | 27% | Hard | |
| 1922 | * Count Good Numbers | 43% | Medium | |
| 1921 | Eliminate Maximum Number of Monsters | 51% | Medium | |
| 1920 | * Build Array from Permutation | 89% | Easy | |
| 1916 | * Count Ways to Build Rooms in an Ant Colony | 48% | Hard | |
| 1915 | * Number of Wonderful Substrings | 46% | Medium | |
| 1914 | * Cyclically Rotating a Grid | 49% | Medium | |
| 1913 | Maximum Product Difference Between Two Pairs | 82% | Easy | |
| 1912 | * Design Movie Rental System | 36% | Hard | |
| 1911 | * Maximum Alternating Subsequence Sum | 59% | Medium | |
| 1910 | * Remove All Occurrences of a Substring | 76% | Medium | |
| 1909 | * Remove One Element to Make the Array Strictly Increasing | 27% | Easy | |
| 1906 | * Minimum Absolute Difference Queries | 44% | Medium | |
| 1905 | * Count Sub Islands | 67% | Medium | |
| 1904 | * The Number of Full Rounds You Have Played | 43% | Medium | |
| 1903 | Largest Odd Number in String | 63% | Easy | |
| 1901 | * Find a Peak Element II | 50% | Medium | |
| 1900 | * The Earliest and Latest Rounds Where Players Compete | 50% | Hard | |
| 1899 | * Merge Triplets to Form Target Triplet | 65% | Medium | |
| 1898 | * Maximum Number of Removable Characters | 43% | Medium | |
| 1897 | Redistribute Characters to Make All Strings Equal | 67% | Easy | |
| 1896 | * Minimum Cost to Change the Final Value of Expression | 54% | Hard | |
| 1895 | * Largest Magic Square | 52% | Medium | |
| 1894 | * Find the Student that Will Replace the Chalk | 45% | Medium | |
| 1893 | * Check if All the Integers in a Range Are Covered | 49% | Easy | |
| 1889 | * Minimum Space Wasted From Packaging | 31% | Hard | |
| 1888 | * Minimum Number of Flips to Make the Binary String Alternating | 39% | Medium | |
| 1887 | Reduction Operations to Make the Array Elements Equal | 73% | Medium | |
| 1886 | * Determine Whether Matrix Can Be Obtained By Rotation | 56% | Easy | |
| 1884 | * Egg Drop With 2 Eggs and N Floors | 72% | Medium | |
| 1883 | * Minimum Skips to Arrive at Meeting On Time | 37% | Hard | |
| 1882 | * Process Tasks Using Servers | 39% | Medium | |
| 1881 | * Maximum Value after Insertion | 37% | Medium | |
| 1880 | * Check if Word Equals Summation of Two Words | 73% | Easy | |
| 1879 | * Minimum XOR Sum of Two Arrays | 47% | Hard | |
| 1878 | * Get Biggest Three Rhombus Sums in a Grid | 47% | Medium | |
| 1877 | Minimize Maximum Pair Sum in Array | 81% | Medium | |
| 1876 | * Substrings of Size Three with Distinct Characters | 72% | Easy | |
| 1872 | * Stone Game VIII | 52% | Hard | |
| 1871 | * Jump Game VII | 24% | Medium | |
| 1870 | Minimum Speed to Arrive on Time | 46% | Medium | |
| 1869 | * Longer Contiguous Segments of Ones than Zeros | 60% | Easy | |
| 1866 | * Number of Ways to Rearrange Sticks With K Sticks Visible | 56% | Hard | |
| 1865 | * Finding Pairs With a Certain Sum | 50% | Medium | |
| 1864 | * Minimum Number of Swaps to Make the Binary String Alternating | 43% | Medium | |
| 1863 | * Sum of All Subset XOR Totals | 81% | Easy | |
| 1862 | * Sum of Floored Pairs | 28% | Hard | |
| 1861 | * Rotating the Box | 67% | Medium | |
| 1860 | * Incremental Memory Leak | 72% | Medium | |
| 1859 | * Sorting the Sentence | 83% | Easy | |
| 1857 | Largest Color Value in a Directed Graph | 50% | Hard | |
| 1856 | * Maximum Subarray Min-Product | 37% | Medium | |
| 1855 | * Maximum Distance Between a Pair of Values | 53% | Medium | |
| 1854 | * Maximum Population Year | 60% | Easy | |
| 1851 | * Minimum Interval to Include Each Query | 49% | Hard | |
| 1850 | * Minimum Adjacent Swaps to Reach the Kth Smallest Number | 71% | Medium | |
| 1849 | * Splitting a String Into Descending Consecutive Values | 34% | Medium | |
| 1848 | * Minimum Distance to the Target Element | 54% | Easy | |
| 1847 | * Closest Room | 37% | Hard | |
| 1846 | Maximum Element After Decreasing and Rearranging | 65% | Medium | |
| 1845 | Seat Reservation Manager | 69% | Medium | |
| 1844 | * Replace All Digits with Characters | 80% | Easy | |
| 1840 | * Maximum Building Height | 36% | Hard | |
| 1839 | * Longest Substring Of All Vowels in Order | 49% | Medium | |
| 1838 | Frequency of the Most Frequent Element | 45% | Medium | |
| 1837 | * Sum of Digits in Base K | 77% | Easy | |
| 1835 | * Find XOR Sum of All Pairs Bitwise AND | 61% | Hard | |
| 1834 | Single-Threaded CPU | 45% | Medium | |
| 1833 | Maximum Ice Cream Bars | 73% | Medium | |
| 1832 | Check if the Sentence Is Pangram | 83% | Easy | |
| 1830 | * Minimum Number of Operations to Make String Sorted | 49% | Hard | |
| 1829 | * Maximum XOR for Each Query | 77% | Medium | |
| 1828 | * Queries on Number of Points Inside a Circle | 86% | Medium | |
| 1827 | * Minimum Operations to Make the Array Increasing | 79% | Easy | |
| 1825 | * Finding MK Average | 36% | Hard | |
| 1824 | * Minimum Sideway Jumps | 49% | Medium | |
| 1823 | * Find the Winner of the Circular Game | 78% | Medium | |
| 1822 | Sign of the Product of an Array | 65% | Easy | |
| 1819 | * Number of Different Subsequences GCDs | 40% | Hard | |
| 1818 | * Minimum Absolute Sum Difference | 30% | Medium | |
| 1817 | * Finding the Users Active Minutes | 80% | Medium | |
| 1816 | * Truncate Sentence | 84% | Easy | |
| 1815 | * Maximum Number of Groups Getting Fresh Donuts | 40% | Hard | |
| 1814 | Count Nice Pairs in an Array | 49% | Medium | |
| 1813 | * Sentence Similarity III | 33% | Medium | |
| 1812 | * Determine Color of a Chessboard Square | 78% | Easy | |
| 1808 | * Maximize Number of Nice Divisors | 32% | Hard | |
| 1807 | * Evaluate the Bracket Pairs of a String | 66% | Medium | |
| 1806 | * Minimum Number of Operations to Reinitialize a Permutation | 72% | Medium | |
| 1805 | * Number of Different Integers in a String | 37% | Easy | |
| 1803 | * Count Pairs With XOR in a Range | 48% | Hard | |
| 1802 | Maximum Value at a Given Index in a Bounded Array | 39% | Medium | |
| 1801 | * Number of Orders in the Backlog | 49% | Medium | |
| 1800 | * Maximum Ascending Subarray Sum | 62% | Easy | |
| 1799 | Maximize Score After N Operations | 58% | Hard | |
| 1798 | * Maximum Number of Consecutive Values You Can Make | 58% | Medium | |
| 1797 | * Design Authentication Manager | 56% | Medium | |
| 1796 | * Second Largest Digit in a String | 49% | Easy | |
| 1793 | Maximum Score of a Good Subarray | 64% | Hard | |
| 1792 | * Maximum Average Pass Ratio | 53% | Medium | |
| 1791 | * Find Center of Star Graph | 83% | Easy | |
| 1790 | * Check if One String Swap Can Make Strings Equal | 45% | Easy | |
| 1787 | * Make the XOR of All Segments Equal to Zero | 39% | Hard | |
| 1786 | * Number of Restricted Paths From First to Last Node | 38% | Medium | |
| 1785 | * Minimum Elements to Add to Form a Given Sum | 43% | Medium | |
| 1784 | * Check if Binary String Has at Most One Segment of Ones | 39% | Easy | |
| 1782 | * Count Pairs Of Nodes | 39% | Hard | |
| 1781 | * Sum of Beauty of All Substrings | 64% | Medium | |
| 1780 | * Check if Number is a Sum of Powers of Three | 67% | Medium | |
| 1779 | * Find Nearest Point That Has the Same X or Y Coordinate | 68% | Easy | |
| 1776 | * Car Fleet II | 54% | Hard | |
| 1775 | * Equal Sum Arrays With Minimum Number of Operations | 53% | Medium | |
| 1774 | * Closest Dessert Cost | 47% | Medium | |
| 1773 | * Count Items Matching a Rule | 84% | Easy | |
| 1771 | * Maximize Palindrome Length From Subsequences | 36% | Hard | |
| 1770 | Maximum Score from Performing Multiplication Operations | 39% | Hard | |
| 1769 | * Minimum Number of Operations to Move All Balls to Each Box | 85% | Medium | |
| 1768 | Merge Strings Alternately | 79% | Easy | |
| 1766 | * Tree of Coprimes | 40% | Hard | |
| 1765 | * Map of Highest Peak | 61% | Medium | |
| 1764 | * Form Array by Concatenating Subarrays of Another Array | 53% | Medium | |
| 1763 | * Longest Nice Substring | 60% | Easy | |
| 1761 | * Minimum Degree of a Connected Trio in a Graph | 42% | Hard | |
| 1760 | * Minimum Limit of Balls in a Bag | 60% | Medium | |
| 1759 | Count Number of Homogenous Substrings | 57% | Medium | |
| 1758 | Minimum Changes To Make Alternating Binary String | 63% | Easy | |
| 1755 | * Closest Subsequence Sum | 38% | Hard | |
| 1754 | * Largest Merge Of Two Strings | 47% | Medium | |
| 1753 | * Maximum Score From Removing Stones | 67% | Medium | |
| 1752 | * Check if Array Is Sorted and Rotated | 50% | Easy | |
| 1751 | Maximum Number of Events That Can Be Attended II | 62% | Hard | |
| 1750 | * Minimum Length of String After Deleting Similar Ends | 44% | Medium | |
| 1749 | * Maximum Absolute Sum of Any Subarray | 59% | Medium | |
| 1748 | * Sum of Unique Elements | 77% | Easy | |
| 1745 | * Palindrome Partitioning IV | 44% | Hard | |
| 1744 | * Can You Eat Your Favorite Candy on Your Favorite Day? | 33% | Medium | |
| 1743 | Restore the Array From Adjacent Pairs | 75% | Medium | |
| 1742 | * Maximum Number of Balls in a Box | 73% | Easy | |
| 1739 | * Building Boxes | 52% | Hard | |
| 1738 | * Find Kth Largest XOR Coordinate Value | 61% | Medium | |
| 1737 | * Change Minimum Characters to Satisfy One of Three Conditions | 36% | Medium | |
| 1736 | * Latest Time by Replacing Hidden Digits | 42% | Easy | |
| 1735 | * Count Ways to Make Array With Product | 50% | Hard | |
| 1734 | * Decode XORed Permutation | 64% | Medium | |
| 1733 | * Minimum Number of People to Teach | 42% | Medium | |
| 1732 | Find the Highest Altitude | 82% | Easy | |
| 1728 | * Cat and Mouse II | 39% | Hard | |
| 1727 | Largest Submatrix With Rearrangements | 75% | Medium | |
| 1726 | * Tuple with Same Product | 60% | Medium | |
| 1725 | * Number Of Rectangles That Can Form The Largest Square | 78% | Easy | |
| 1723 | * Find Minimum Time to Finish All Jobs | 42% | Hard | |
| 1722 | * Minimize Hamming Distance After Swap Operations | 48% | Medium | |
| 1721 | Swapping Nodes in a Linked List | 68% | Medium | |
| 1720 | * Decode XORed Array | 86% | Easy | |
| 1719 | * Number Of Ways To Reconstruct A Tree | 44% | Hard | |
| 1718 | * Construct the Lexicographically Largest Valid Sequence | 53% | Medium | |
| 1717 | * Maximum Score From Removing Substrings | 46% | Medium | |
| 1716 | Calculate Money in Leetcode Bank | 78% | Easy | |
| 1713 | * Minimum Operations to Make a Subsequence | 48% | Hard | |
| 1712 | * Ways to Split Array Into Three Subarrays | 32% | Medium | |
| 1711 | * Count Good Meals | 29% | Medium | |
| 1710 | Maximum Units on a Truck | 73% | Easy | |
| 1707 | * Maximum XOR With an Element From Array | 48% | Hard | |
| 1706 | Where Will the Ball Fall | 71% | Medium | |
| 1705 | * Maximum Number of Eaten Apples | 38% | Medium | |
| 1704 | Determine if String Halves Are Alike | 78% | Easy | |
| 1703 | * Minimum Adjacent Swaps for K Consecutive Ones | 42% | Hard | |
| 1702 | * Maximum Binary String After Change | 46% | Medium | |
| 1701 | * Average Waiting Time | 63% | Medium | |
| 1700 | * Number of Students Unable to Eat Lunch | 70% | Easy | |
| 1697 | Checking Existence of Edge Length Limited Paths | 62% | Hard | |
| 1696 | Jump Game VI | 45% | Medium | |
| 1695 | * Maximum Erasure Value | 57% | Medium | |
| 1694 | * Reformat Phone Number | 65% | Easy | |
| 1691 | * Maximum Height by Stacking Cuboids | 56% | Hard | |
| 1690 | * Stone Game VII | 57% | Medium | |
| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | 88% | Medium | |
| 1688 | Count of Matches in Tournament | 85% | Easy | |
| 1687 | * Delivering Boxes from Storage to Ports | 38% | Hard | |
| 1686 | * Stone Game VI | 56% | Medium | |
| 1685 | Sum of Absolute Differences in a Sorted Array | 68% | Medium | |
| 1684 | * Count the Number of Consistent Strings | 82% | Easy | |
| 1681 | * Minimum Incompatibility | 38% | Hard | |
| 1680 | Concatenation of Consecutive Binary Numbers | 57% | Medium | |
| 1679 | * Max Number of K-Sum Pairs | 55% | Medium | |
| 1678 | * Goal Parser Interpretation | 87% | Easy | |
| 1675 | Minimize Deviation in Array | 54% | Hard | |
| 1674 | * Minimum Moves to Make Array Complementary | 39% | Medium | |
| 1673 | * Find the Most Competitive Subsequence | 50% | Medium | |
| 1672 | * Richest Customer Wealth | 87% | Easy | |
| 1671 | * Minimum Number of Removals to Make Mountain Array | 41% | Hard | |
| 1670 | * Design Front Middle Back Queue | 56% | Medium | |
| 1669 | * Merge In Between Linked Lists | 72% | Medium | |
| 1668 | * Maximum Repeating Substring | 38% | Easy | |
| 1665 | * Minimum Initial Energy to Finish Tasks | 57% | Hard | |
| 1664 | * Ways to Make a Fair Array | 63% | Medium | |
| 1663 | * Smallest String With A Given Numeric Value | 66% | Medium | |
| 1662 | Check If Two String Arrays are Equivalent | 85% | Easy | |
| 1659 | * Maximize Grid Happiness | 39% | Hard | |
| 1658 | Minimum Operations to Reduce X to Zero | 39% | Medium | |
| 1657 | Determine if Two Strings Are Close | 55% | Medium | |
| 1656 | * Design an Ordered Stream | 84% | Easy | |
| 1655 | * Distribute Repeating Integers | 39% | Hard | |
| 1654 | * Minimum Jumps to Reach Home | 29% | Medium | |
| 1653 | * Minimum Deletions to Make String Balanced | 58% | Medium | |
| 1652 | * Defuse the Bomb | 64% | Easy | |
| 1649 | * Create Sorted Array through Instructions | 38% | Hard | |
| 1648 | * Sell Diminishing-Valued Colored Balls | 30% | Medium | |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | 61% | Medium | |
| 1646 | * Get Maximum in Generated Array | 50% | Easy | |
| 1643 | * Kth Smallest Instructions | 47% | Hard | |
| 1642 | Furthest Building You Can Reach | 49% | Medium | |
| 1641 | * Count Sorted Vowel Strings | 78% | Medium | |
| 1640 | * Check Array Formation Through Concatenation | 56% | Easy | |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | 51% | Hard | |
| 1638 | * Count Substrings That Differ by One Character | 71% | Medium | |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | 87% | Easy | |
| 1636 | * Sort Array by Increasing Frequency | 71% | Easy | |
| 1632 | * Rank Transform of a Matrix | 40% | Hard | |
| 1631 | Path With Minimum Effort | 59% | Medium | |
| 1630 | Arithmetic Subarrays | 83% | Medium | |
| 1629 | * Slowest Key | 58% | Easy | |
| 1627 | * Graph Connectivity With Threshold | 46% | Hard | |
| 1626 | Best Team With No Conflicts | 50% | Medium | |
| 1625 | * Lexicographically Smallest String After Applying Operations | 65% | Medium | |
| 1624 | Largest Substring Between Two Equal Characters | 68% | Easy | |
| 1622 | * Fancy Sequence | 16% | Hard | |
| 1621 | * Number of Sets of K Non-Overlapping Line Segments | 43% | Medium | |
| 1620 | * Coordinate With Maximum Network Quality | 37% | Medium | |
| 1619 | * Mean of Array After Removing Some Elements | 67% | Easy | |
| 1617 | * Count Subtrees With Max Distance Between Cities | 65% | Hard | |
| 1616 | * Split Two Strings to Make Palindrome | 30% | Medium | |
| 1615 | Maximal Network Rank | 65% | Medium | |
| 1614 | * Maximum Nesting Depth of the Parentheses | 81% | Easy | |
| 1611 | Minimum One Bit Operations to Make Integers Zero | 74% | Hard | |
| 1610 | * Maximum Number of Visible Points | 37% | Hard | |
| 1609 | * Even Odd Tree | 55% | Medium | |
| 1608 | * Special Array With X Elements Greater Than or Equal X | 60% | Easy | |
| 1606 | * Find Servers That Handled Most Number of Requests | 43% | Hard | |
| 1605 | * Find Valid Matrix Given Row and Column Sums | 77% | Medium | |
| 1604 | * Alert Using Same Key-Card Three or More Times in a One Hour Period | 45% | Medium | |
| 1603 | Design Parking System | 88% | Easy | |
| 1601 | Maximum Number of Achievable Transfer Requests | 64% | Hard | |
| 1600 | * Throne Inheritance | 64% | Medium | |
| 1599 | * Maximum Profit of Operating a Centennial Wheel | 43% | Medium | |
| 1598 | * Crawler Log Folder | 64% | Easy | |
| 1595 | * Minimum Cost to Connect Two Groups of Points | 47% | Hard | |
| 1594 | * Maximum Non Negative Product in a Matrix | 33% | Medium | |
| 1593 | * Split a String Into the Max Number of Unique Substrings | 56% | Medium | |
| 1592 | * Rearrange Spaces Between Words | 43% | Easy | |
| 1591 | * Strange Printer II | 58% | Hard | |
| 1590 | * Make Sum Divisible by P | 28% | Medium | |
| 1589 | * Maximum Sum Obtained of Any Permutation | 37% | Medium | |
| 1588 | * Sum of All Odd Length Subarrays | 83% | Easy | |
| 1585 | * Check If String Is Transformable With Substring Sort Operations | 48% | Hard | |
| 1584 | Min Cost to Connect All Points | 66% | Medium | |
| 1583 | * Count Unhappy Friends | 61% | Medium | |
| 1582 | Special Positions in a Binary Matrix | 68% | Easy | |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | 64% | Hard | |
| 1578 | Minimum Time to Make Rope Colorful | 63% | Medium | |
| 1577 | * Number of Ways Where Square of Number Is Equal to Product of Two Numbers | 40% | Medium | |
| 1576 | * Replace All ?'s to Avoid Consecutive Repeating Characters | 46% | Easy | |
| 1575 | Count All Possible Routes | 65% | Hard | |
| 1574 | * Shortest Subarray to be Removed to Make Array Sorted | 37% | Medium | |
| 1573 | * Number of Ways to Split a String | 32% | Medium | |
| 1572 | Matrix Diagonal Sum | 82% | Easy | |
| 1569 | Number of Ways to Reorder Array to Get Same BST | 53% | Hard | |
| 1568 | * Minimum Number of Days to Disconnect Island | 45% | Hard | |
| 1567 | * Maximum Length of Subarray With Positive Product | 44% | Medium | |
| 1566 | * Detect Pattern of Length M Repeated K or More Times | 43% | Easy | |
| 1563 | * Stone Game V | 40% | Hard | |
| 1562 | * Find Latest Group of Size M | 42% | Medium | |
| 1561 | Maximum Number of Coins You Can Get | 84% | Medium | |
| 1560 | * Most Visited Sector in a Circular Track | 58% | Easy | |
| 1559 | * Detect Cycles in 2D Grid | 48% | Medium | |
| 1558 | * Minimum Numbers of Function Calls to Make Target Array | 63% | Medium | |
| 1557 | Minimum Number of Vertices to Reach All Nodes | 81% | Medium | |
| 1556 | * Thousand Separator | 53% | Easy | |
| 1553 | * Minimum Number of Days to Eat N Oranges | 35% | Hard | |
| 1552 | * Magnetic Force Between Two Balls | 60% | Medium | |
| 1551 | * Minimum Operations to Make Array Equal | 82% | Medium | |
| 1550 | * Three Consecutive Odds | 63% | Easy | |
| 1547 | Minimum Cost to Cut a Stick | 61% | Hard | |
| 1546 | * Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | 47% | Medium | |
| 1545 | * Find Kth Bit in Nth Binary String | 58% | Medium | |
| 1544 | Make The String Great | 63% | Easy | |
| 1542 | * Find Longest Awesome Substring | 42% | Hard | |
| 1541 | * Minimum Insertions to Balance a Parentheses String | 51% | Medium | |
| 1540 | * Can Convert String in K Moves | 34% | Medium | |
| 1539 | Kth Missing Positive Number | 59% | Easy | |
| 1537 | * Get the Maximum Score | 39% | Hard | |
| 1536 | * Minimum Swaps to Arrange a Binary Grid | 47% | Medium | |
| 1535 | Find the Winner of an Array Game | 57% | Medium | |
| 1534 | * Count Good Triplets | 81% | Easy | |
| 1531 | String Compression II | 52% | Hard | |
| 1530 | * Number of Good Leaf Nodes Pairs | 62% | Medium | |
| 1529 | * Minimum Suffix Flips | 73% | Medium | |
| 1528 | * Shuffle String | 84% | Easy | |
| 1526 | * Minimum Number of Increments on Subarrays to Form a Target Array | 69% | Hard | |
| 1525 | * Number of Good Ways to Split a String | 68% | Medium | |
| 1524 | * Number of Sub-arrays With Odd Sum | 43% | Medium | |
| 1523 | Count Odd Numbers in an Interval Range | 49% | Easy | |
| 1521 | * Find a Value of a Mysterious Function Closest to Target | 43% | Hard | |
| 1520 | * Maximum Number of Non-Overlapping Substrings | 39% | Hard | |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | 55% | Medium | |
| 1518 | * Water Bottles | 60% | Easy | |
| 1515 | * Best Position for a Service Centre | 36% | Hard | |
| 1514 | Path with Maximum Probability | 54% | Medium | |
| 1513 | * Number of Substrings With Only 1s | 46% | Medium | |
| 1512 | Number of Good Pairs | 88% | Easy | |
| 1510 | * Stone Game IV | 59% | Hard | |
| 1509 | * Minimum Difference Between Largest and Smallest Value in Three Moves | 54% | Medium | |
| 1508 | * Range Sum of Sorted Subarray Sums | 58% | Medium | |
| 1507 | * Reformat Date | 65% | Easy | |
| 1505 | * Minimum Possible Integer After at Most K Adjacent Swaps On Digits | 39% | Hard | |
| 1504 | * Count Submatrices With All Ones | 57% | Medium | |
| 1503 | Last Moment Before All Ants Fall Out of a Plank | 68% | Medium | |
| 1502 | Can Make Arithmetic Progression From Sequence | 69% | Easy | |
| 1499 | * Max Value of Equation | 44% | Hard | |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | 43% | Medium | |
| 1497 | * Check If Array Pairs Are Divisible by k | 38% | Medium | |
| 1496 | Path Crossing | 62% | Easy | |
| 1494 | * Parallel Courses II | 29% | Hard | |
| 1493 | Longest Subarray of 1's After Deleting One Element | 67% | Medium | |
| 1492 | * The kth Factor of n | 66% | Medium | |
| 1491 | Average Salary Excluding the Minimum and Maximum Salary | 63% | Easy | |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | 68% | Hard | |
| 1488 | * Avoid Flood in The City | 26% | Medium | |
| 1487 | * Making File Names Unique | 36% | Medium | |
| 1486 | * XOR Operation in an Array | 85% | Easy | |
| 1483 | * Kth Ancestor of a Tree Node | 34% | Hard | |
| 1482 | * Minimum Number of Days to Make m Bouquets | 51% | Medium | |
| 1481 | Least Number of Unique Integers after K Removals | 62% | Medium | |
| 1480 | Running Sum of 1d Array | 86% | Easy | |
| 1478 | * Allocate Mailboxes | 55% | Hard | |
| 1477 | * Find Two Non-overlapping Sub-arrays Each With Target Sum | 36% | Medium | |
| 1476 | * Subrectangle Queries | 88% | Medium | |
| 1475 | * Final Prices With a Special Discount in a Shop | 77% | Easy | |
| 1473 | Paint House III | 61% | Hard | |
| 1472 | Design Browser History | 77% | Medium | |
| 1471 | * The k Strongest Values in an Array | 60% | Medium | |
| 1470 | Shuffle the Array | 88% | Easy | |
| 1467 | * Probability of a Two Boxes Having The Same Number of Distinct Balls | 60% | Hard | |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | 64% | Medium | |
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 40% | Medium | |
| 1464 | Maximum Product of Two Elements in an Array | 82% | Easy | |
| 1463 | Cherry Pickup II | 71% | Hard | |
| 1462 | * Course Schedule IV | 49% | Medium | |
| 1461 | * Check If a String Contains All Binary Codes of Size K | 56% | Medium | |
| 1460 | * Make Two Arrays Equal by Reversing Subarrays | 71% | Easy | |
| 1458 | Max Dot Product of Two Subsequences | 62% | Hard | |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | 68% | Medium | |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | 58% | Medium | |
| 1455 | * Check If a Word Occurs As a Prefix of Any Word in a Sentence | 64% | Easy | |
| 1453 | * Maximum Number of Darts Inside of a Circular Dartboard | 37% | Hard | |
| 1452 | * People Whose List of Favorite Companies Is Not a Subset of Another List | 57% | Medium | |
| 1451 | * Rearrange Words in a Sentence | 64% | Medium | |
| 1450 | * Number of Students Doing Homework at a Given Time | 75% | Easy | |
| 1449 | * Form Largest Integer With Digits That Add up to Target | 48% | Hard | |
| 1448 | Count Good Nodes in Binary Tree | 73% | Medium | |
| 1447 | * Simplified Fractions | 66% | Medium | |
| 1446 | * Consecutive Characters | 60% | Easy | |
| 1444 | Number of Ways of Cutting a Pizza | 62% | Hard | |
| 1443 | Minimum Time to Collect All Apples in a Tree | 62% | Medium | |
| 1442 | * Count Triplets That Can Form Two Arrays of Equal XOR | 76% | Medium | |
| 1441 | Build an Array With Stack Operations | 79% | Medium | |
| 1439 | * Find the Kth Smallest Sum of a Matrix With Sorted Rows | 61% | Hard | |
| 1438 | * Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | 49% | Medium | |
| 1437 | * Check If All 1's Are at Least Length K Places Away | 58% | Easy | |
| 1436 | Destination City | 79% | Easy | |
| 1434 | * Number of Ways to Wear Different Hats to Each Other | 44% | Hard | |
| 1433 | * Check If a String Can Break Another String | 69% | Medium | |
| 1432 | * Max Difference You Can Get From Changing an Integer | 40% | Medium | |
| 1431 | Kids With the Greatest Number of Candies | 87% | Easy | |
| 1425 | Constrained Subsequence Sum | 56% | Hard | |
| 1424 | Diagonal Traverse II | 56% | Medium | |
| 1423 | Maximum Points You Can Obtain from Cards | 52% | Medium | |
| 1422 | Maximum Score After Splitting a String | 62% | Easy | |
| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | 69% | Hard | |
| 1419 | * Minimum Number of Frogs Croaking | 50% | Medium | |
| 1418 | * Display Table of Food Orders in a Restaurant | 74% | Medium | |
| 1417 | * Reformat The String | 53% | Easy | |
| 1416 | Restore The Array | 48% | Hard | |
| 1415 | * The k-th Lexicographical String of All Happy Strings of Length n | 73% | Medium | |
| 1414 | * Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | 65% | Medium | |
| 1413 | * Minimum Value to Get Positive Step by Step Sum | 65% | Easy | |
| 1411 | * Number of Ways to Paint N × 3 Grid | 63% | Hard | |
| 1410 | * HTML Entity Parser | 50% | Medium | |
| 1409 | * Queries on a Permutation With Key | 84% | Medium | |
| 1408 | * String Matching in an Array | 63% | Easy | |
| 1406 | Stone Game III | 64% | Hard | |
| 1405 | * Longest Happy String | 57% | Medium | |
| 1404 | * Number of Steps to Reduce a Number in Binary Representation to One | 52% | Medium | |
| 1403 | * Minimum Subsequence in Non-Increasing Order | 72% | Easy | |
| 1402 | Reducing Dishes | 76% | Hard | |
| 1401 | * Circle and Rectangle Overlapping | 46% | Medium | |
| 1400 | * Construct K Palindrome Strings | 62% | Medium | |
| 1399 | * Count Largest Group | 66% | Easy | |
| 1397 | * Find All Good Strings | 42% | Hard | |
| 1396 | Design Underground System | 74% | Medium | |
| 1395 | * Count Number of Teams | 66% | Medium | |
| 1394 | * Find Lucky Integer in an Array | 66% | Easy | |
| 1392 | * Longest Happy Prefix | 45% | Hard | |
| 1391 | * Check if There is a Valid Path in a Grid | 47% | Medium | |
| 1390 | * Four Divisors | 42% | Medium | |
| 1389 | * Create Target Array in the Given Order | 85% | Easy | |
| 1388 | * Pizza With 3n Slices | 51% | Hard | |
| 1387 | * Sort Integers by The Power Value | 69% | Medium | |
| 1386 | * Cinema Seat Allocation | 41% | Medium | |
| 1385 | * Find the Distance Value Between Two Arrays | 68% | Easy | |
| 1383 | Maximum Performance of a Team | 47% | Hard | |
| 1382 | * Balance a Binary Search Tree | 81% | Medium | |
| 1381 | * Design a Stack With Increment Operation | 77% | Medium | |
| 1380 | * Lucky Numbers in a Matrix | 71% | Easy | |
| 1379 | * Find a Corresponding Node of a Binary Tree in a Clone of That Tree | 85% | Easy | |
| 1377 | * Frog Position After T Seconds | 35% | Hard | |
| 1376 | Time Needed to Inform All Employees | 60% | Medium | |
| 1375 | * Number of Times Binary String Is Prefix-Aligned | 65% | Medium | |
| 1374 | * Generate a String With Characters That Have Odd Counts | 77% | Easy | |
| 1373 | * Maximum Sum BST in Binary Tree | 40% | Hard | |
| 1372 | Longest ZigZag Path in a Binary Tree | 65% | Medium | |
| 1371 | * Find the Longest Substring Containing Vowels in Even Counts | 63% | Medium | |
| 1370 | * Increasing Decreasing String | 76% | Easy | |
| 1368 | * Minimum Cost to Make at Least One Valid Path in a Grid | 61% | Hard | |
| 1367 | * Linked List in Binary Tree | 43% | Medium | |
| 1366 | * Rank Teams by Votes | 58% | Medium | |
| 1365 | * How Many Numbers Are Smaller Than the Current Number | 86% | Easy | |
| 1363 | * Largest Multiple of Three | 32% | Hard | |
| 1362 | * Closest Divisors | 60% | Medium | |
| 1361 | Validate Binary Tree Nodes | 44% | Medium | |
| 1360 | * Number of Days Between Two Dates | 49% | Easy | |
| 1359 | Count All Valid Pickup and Delivery Options | 65% | Hard | |
| 1358 | * Number of Substrings Containing All Three Characters | 65% | Medium | |
| 1357 | * Apply Discount Every n Orders | 70% | Medium | |
| 1356 | Sort Integers by The Number of 1 Bits | 78% | Easy | |
| 1354 | Construct Target Array With Multiple Sums | 36% | Hard | |
| 1353 | * Maximum Number of Events That Can Be Attended | 32% | Medium | |
| 1352 | * Product of the Last K Numbers | 50% | Medium | |
| 1351 | Count Negative Numbers in a Sorted Matrix | 77% | Easy | |
| 1349 | * Maximum Students Taking Exam | 50% | Hard | |
| 1348 | * Tweet Counts Per Frequency | 44% | Medium | |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | 81% | Medium | |
| 1346 | * Check If N and Its Double Exist | 37% | Easy | |
| 1345 | Jump Game IV | 46% | Hard | |
| 1344 | * Angle Between Hands of a Clock | 63% | Medium | |
| 1343 | * Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | 68% | Medium | |
| 1342 | * Number of Steps to Reduce a Number to Zero | 84% | Easy | |
| 1340 | * Jump Game V | 63% | Hard | |
| 1339 | Maximum Product of Splitted Binary Tree | 47% | Medium | |
| 1338 | Reduce Array Size to The Half | 68% | Medium | |
| 1337 | The K Weakest Rows in a Matrix | 73% | Easy | |
| 1335 | Minimum Difficulty of a Job Schedule | 59% | Hard | |
| 1334 | * Find the City With the Smallest Number of Neighbors at a Threshold Distance | 59% | Medium | |
| 1333 | * Filter Restaurants by Vegan-Friendly, Price and Distance | 61% | Medium | |
| 1332 | * Remove Palindromic Subsequences | 76% | Easy | |
| 1331 | * Rank Transform of an Array | 61% | Easy | |
| 1330 | * Reverse Subarray To Maximize Array Value | 41% | Hard | |
| 1329 | Sort the Matrix Diagonally | 82% | Medium | |
| 1328 | Break a Palindrome | 51% | Medium | |
| 1326 | Minimum Number of Taps to Open to Water a Garden | 51% | Hard | |
| 1325 | * Delete Leaves With a Given Value | 74% | Medium | |
| 1324 | * Print Words Vertically | 63% | Medium | |
| 1323 | Maximum 69 Number | 82% | Easy | |
| 1320 | * Minimum Distance to Type a Word Using Two Fingers | 59% | Hard | |
| 1319 | Number of Operations to Make Network Connected | 62% | Medium | |
| 1318 | Minimum Flips to Make a OR b Equal to c | 71% | Medium | |
| 1317 | * Convert Integer to the Sum of Two No-Zero Integers | 54% | Easy | |
| 1316 | * Distinct Echo Substrings | 49% | Hard | |
| 1315 | * Sum of Nodes with Even-Valued Grandparent | 85% | Medium | |
| 1314 | * Matrix Block Sum | 75% | Medium | |
| 1313 | * Decompress Run-Length Encoded List | 85% | Easy | |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | 70% | Hard | |
| 1311 | * Get Watched Videos by Your Friends | 46% | Medium | |
| 1310 | * XOR Queries of a Subarray | 72% | Medium | |
| 1309 | * Decrypt String from Alphabet to Integer Mapping | 79% | Easy | |
| 1307 | * Verbal Arithmetic Puzzle | 34% | Hard | |
| 1306 | * Jump Game III | 64% | Medium | |
| 1305 | * All Elements in Two Binary Search Trees | 79% | Medium | |
| 1304 | * Find N Unique Integers Sum up to Zero | 76% | Easy | |
| 1302 | * Deepest Leaves Sum | 86% | Medium | |
| 1301 | * Number of Paths with Max Score | 39% | Hard | |
| 1300 | * Sum of Mutated Array Closest to Target | 44% | Medium | |
| 1299 | * Replace Elements with Greatest Element on Right Side | 71% | Easy | |
| 1298 | * Maximum Candies You Can Get from Boxes | 58% | Hard | |
| 1297 | * Maximum Number of Occurrences of a Substring | 51% | Medium | |
| 1296 | * Divide Array in Sets of K Consecutive Numbers | 56% | Medium | |
| 1295 | * Find Numbers with Even Number of Digits | 77% | Easy | |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | 45% | Hard | |
| 1292 | * Maximum Side Length of a Square with Sum Less than or Equal to Threshold | 53% | Medium | |
| 1291 | Sequential Digits | 65% | Medium | |
| 1290 | * Convert Binary Number in a Linked List to Integer | 81% | Easy | |
| 1289 | * Minimum Falling Path Sum II | 57% | Hard | |
| 1288 | * Remove Covered Intervals | 56% | Medium | |
| 1287 | Element Appearing More Than 25% In Sorted Array | 61% | Easy | |
| 1286 | * Iterator for Combination | 73% | Medium | |
| 1284 | * Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | 72% | Hard | |
| 1283 | * Find the Smallest Divisor Given a Threshold | 59% | Medium | |
| 1282 | Group the People Given the Group Size They Belong To | 87% | Medium | |
| 1281 | * Subtract the Product and Sum of Digits of an Integer | 86% | Easy | |
| 1278 | * Palindrome Partitioning III | 60% | Hard | |
| 1277 | * Count Square Submatrices with All Ones | 74% | Medium | |
| 1276 | * Number of Burgers with No Waste of Ingredients | 50% | Medium | |
| 1275 | * Find Winner on a Tic Tac Toe Game | 53% | Easy | |
| 1269 | Number of Ways to Stay in the Same Place After Some Steps | 50% | Hard | |
| 1268 | * Search Suggestions System | 65% | Medium | |
| 1267 | * Count Servers that Communicate | 60% | Medium | |
| 1266 | Minimum Time Visiting All Points | 82% | Easy | |
| 1263 | * Minimum Moves to Move a Box to Their Target Location | 49% | Hard | |
| 1262 | * Greatest Sum Divisible by Three | 50% | Medium | |
| 1261 | * Find Elements in a Contaminated Binary Tree | 76% | Medium | |
| 1260 | * Shift 2D Grid | 67% | Easy | |
| 1255 | * Maximum Score Words Formed by Letters | 72% | Hard | |
| 1254 | Number of Closed Islands | 66% | Medium | |
| 1253 | * Reconstruct a 2-Row Binary Matrix | 45% | Medium | |
| 1252 | * Cells with Odd Values in a Matrix | 78% | Easy | |
| 1250 | * Check If It Is a Good Array | 59% | Hard | |
| 1249 | * Minimum Remove to Make Valid Parentheses | 67% | Medium | |
| 1248 | * Count Number of Nice Subarrays | 64% | Medium | |
| 1247 | * Minimum Swaps to Make Strings Equal | 64% | Medium | |
| 1240 | * Tiling a Rectangle with the Fewest Squares | 54% | Hard | |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | 54% | Medium | |
| 1238 | * Circular Permutation in Binary Representation | 69% | Medium | |
| 1237 | * Find Positive Integer Solution for a Given Equation | 69% | Medium | |
| 1235 | Maximum Profit in Job Scheduling | 54% | Hard | |
| 1234 | * Replace the Substring for Balanced String | 38% | Medium | |
| 1233 | * Remove Sub-Folders from the Filesystem | 65% | Medium | |
| 1232 | Check If It Is a Straight Line | 39% | Easy | |
| 1227 | * Airplane Seat Assignment Probability | 66% | Medium | |
| 1224 | * Maximum Equal Frequency | 37% | Hard | |
| 1223 | * Dice Roll Simulation | 48% | Hard | |
| 1222 | * Queens That Can Attack the King | 71% | Medium | |
| 1221 | * Split a String in Balanced Strings | 85% | Easy | |
| 1220 | Count Vowels Permutation | 62% | Hard | |
| 1219 | * Path with Maximum Gold | 63% | Medium | |
| 1218 | * Longest Arithmetic Subsequence of Given Difference | 54% | Medium | |
| 1217 | * Minimum Cost to Move Chips to The Same Position | 71% | Easy | |
| 1210 | * Minimum Moves to Reach Target with Rotations | 49% | Hard | |
| 1209 | * Remove All Adjacent Duplicates in String II | 57% | Medium | |
| 1208 | * Get Equal Substrings Within Budget | 50% | Medium | |
| 1207 | Unique Number of Occurrences | 76% | Easy | |
| 1206 | * Design Skiplist | 60% | Hard | |
| 1203 | Sort Items by Groups Respecting Dependencies | 66% | Hard | |
| 1202 | * Smallest String With Swaps | 58% | Medium | |
| 1201 | * Ugly Number III | 29% | Medium | |
| 1200 | * Minimum Absolute Difference | 69% | Easy | |
| 1192 | * Critical Connections in a Network | 55% | Hard | |
| 1191 | * K-Concatenation Maximum Sum | 23% | Medium | |
| 1190 | * Reverse Substrings Between Each Pair of Parentheses | 66% | Medium | |
| 1189 | * Maximum Number of Balloons | 59% | Easy | |
| 1187 | Make Array Strictly Increasing | 58% | Hard | |
| 1186 | * Maximum Subarray Sum with One Deletion | 43% | Medium | |
| 1185 | * Day of the Week | 57% | Easy | |
| 1184 | * Distance Between Bus Stops | 53% | Easy | |
| 1178 | * Number of Valid Words for Each Puzzle | 46% | Hard | |
| 1177 | * Can Make Palindrome from Substring | 38% | Medium | |
| 1175 | * Prime Arrangements | 56% | Easy | |
| 1172 | * Dinner Plate Stacks | 32% | Hard | |
| 1171 | * Remove Zero Sum Consecutive Nodes from Linked List | 43% | Medium | |
| 1170 | * Compare Strings by Frequency of the Smallest Character | 61% | Medium | |
| 1169 | * Invalid Transactions | 31% | Medium | |
| 1163 | * Last Substring in Lexicographical Order | 34% | Hard | |
| 1162 | As Far from Land as Possible | 51% | Medium | |
| 1161 | Maximum Level Sum of a Binary Tree | 67% | Medium | |
| 1160 | Find Words That Can Be Formed by Characters | 70% | Easy | |
| 1157 | * Online Majority Element In Subarray | 41% | Hard | |
| 1156 | * Swap For Longest Repeated Character Substring | 44% | Medium | |
| 1155 | Number of Dice Rolls With Target Sum | 60% | Medium | |
| 1154 | * Day of the Year | 48% | Easy | |
| 1147 | * Longest Chunked Palindrome Decomposition | 58% | Hard | |
| 1146 | Snapshot Array | 37% | Medium | |
| 1145 | * Binary Tree Coloring Game | 51% | Medium | |
| 1144 | * Decrease Elements To Make Array Zigzag | 47% | Medium | |
| 1143 | Longest Common Subsequence | 57% | Medium | |
| 1140 | Stone Game II | 68% | Medium | |
| 1139 | * Largest 1-Bordered Square | 50% | Medium | |
| 1138 | * Alphabet Board Path | 51% | Medium | |
| 1137 | N-th Tribonacci Number | 63% | Easy | |
| 1131 | * Maximum of Absolute Value Expression | 48% | Medium | |
| 1130 | * Minimum Cost Tree From Leaf Values | 67% | Medium | |
| 1129 | Shortest Path with Alternating Colors | 47% | Medium | |
| 1128 | * Number of Equivalent Domino Pairs | 47% | Easy | |
| 1125 | Smallest Sufficient Team | 56% | Hard | |
| 1124 | * Longest Well-Performing Interval | 34% | Medium | |
| 1123 | * Lowest Common Ancestor of Deepest Leaves | 71% | Medium | |
| 1122 | * Relative Sort Array | 68% | Easy | |
| 1111 | * Maximum Nesting Depth of Two Valid Parentheses Strings | 72% | Medium | |
| 1110 | * Delete Nodes And Return Forest | 69% | Medium | |
| 1109 | * Corporate Flight Bookings | 61% | Medium | |
| 1108 | * Defanging an IP Address | 88% | Easy | |
| 1106 | * Parsing A Boolean Expression | 58% | Hard | |
| 1105 | * Filling Bookcase Shelves | 59% | Medium | |
| 1104 | * Path In Zigzag Labelled Binary Tree | 75% | Medium | |
| 1103 | * Distribute Candies to People | 64% | Easy | |
| 1096 | * Brace Expansion II | 63% | Hard | |
| 1095 | Find in Mountain Array | 40% | Hard | |
| 1094 | * Car Pooling | 56% | Medium | |
| 1093 | * Statistics from a Large Sample | 42% | Medium | |
| 1092 | * Shortest Common Supersequence | 58% | Hard | |
| 1091 | Shortest Path in Binary Matrix | 47% | Medium | |
| 1090 | * Largest Values From Labels | 61% | Medium | |
| 1089 | * Duplicate Zeros | 51% | Easy | |
| 1081 | * Smallest Subsequence of Distinct Characters | 60% | Medium | |
| 1080 | * Insufficient Nodes in Root to Leaf Paths | 55% | Medium | |
| 1079 | * Letter Tile Possibilities | 76% | Medium | |
| 1078 | * Occurrences After Bigram | 63% | Easy | |
| 1074 | Number of Submatrices That Sum to Target | 74% | Hard | |
| 1073 | * Adding Two Negabinary Numbers | 36% | Medium | |
| 1072 | * Flip Columns For Maximum Number of Equal Rows | 63% | Medium | |
| 1071 | Greatest Common Divisor of Strings | 51% | Easy | |
| 1061 | Lexicographically Smallest Equivalent String | 76% | Medium | |
| 1054 | * Distant Barcodes | 46% | Medium | |
| 1053 | * Previous Permutation With One Swap | 49% | Medium | |
| 1052 | * Grumpy Bookstore Owner | 57% | Medium | |
| 1051 | * Height Checker | 76% | Easy | |
| 1049 | * Last Stone Weight II | 55% | Medium | |
| 1048 | Longest String Chain | 60% | Medium | |
| 1047 | Remove All Adjacent Duplicates In String | 69% | Easy | |
| 1046 | Last Stone Weight | 65% | Easy | |
| 1044 | * Longest Duplicate Substring | 30% | Hard | |
| 1043 | Partition Array for Maximum Sum | 76% | Medium | |
| 1042 | * Flower Planting With No Adjacent | 51% | Medium | |
| 1041 | * Robot Bounded In Circle | 55% | Medium | |
| 1040 | * Moving Stones Until Consecutive II | 56% | Medium | |
| 1039 | * Minimum Score Triangulation of Polygon | 58% | Medium | |
| 1038 | * Binary Search Tree to Greater Sum Tree | 85% | Medium | |
| 1037 | * Valid Boomerang | 36% | Easy | |
| 1036 | * Escape a Large Maze | 34% | Hard | |
| 1035 | Uncrossed Lines | 62% | Medium | |
| 1034 | * Coloring A Border | 48% | Medium | |
| 1033 | * Moving Stones Until Consecutive | 47% | Medium | |
| 1032 | * Stream of Characters | 51% | Hard | |
| 1031 | * Maximum Sum of Two Non-Overlapping Subarrays | 59% | Medium | |
| 1030 | * Matrix Cells in Distance Order | 70% | Easy | |
| 1029 | * Two City Scheduling | 66% | Medium | |
| 1028 | * Recover a Tree From Preorder Traversal | 73% | Hard | |
| 1027 | Longest Arithmetic Subsequence | 49% | Medium | |
| 1026 | Maximum Difference Between Node and Ancestor | 78% | Medium | |
| 1025 | * Divisor Game | 68% | Easy | |
| 1024 | * Video Stitching | 51% | Medium | |
| 1023 | * Camelcase Matching | 61% | Medium | |
| 1022 | * Sum of Root To Leaf Binary Numbers | 73% | Easy | |
| 1021 | * Remove Outermost Parentheses | 82% | Easy | |
| 1020 | Number of Enclaves | 68% | Medium | |
| 1019 | * Next Greater Node In Linked List | 60% | Medium | |
| 1018 | * Binary Prefix Divisible By 5 | 46% | Easy | |
| 1017 | * Convert to Base -2 | 60% | Medium | |
| 1016 | * Binary String With Substrings Representing 1 To N | 57% | Medium | |
| 1015 | * Smallest Integer Divisible by K | 46% | Medium | |
| 1014 | * Best Sightseeing Pair | 59% | Medium | |
| 1013 | * Partition Array Into Three Parts With Equal Sum | 41% | Easy | |
| 1012 | * Numbers With Repeated Digits | 41% | Hard | |
| 1011 | Capacity To Ship Packages Within D Days | 69% | Medium | |
| 1010 | * Pairs of Songs With Total Durations Divisible by 60 | 52% | Medium | |
| 1009 | * Complement of Base 10 Integer | 60% | Easy | |
| 1008 | * Construct Binary Search Tree from Preorder Traversal | 81% | Medium | |
| 1007 | * Minimum Domino Rotations For Equal Row | 52% | Medium | |
| 1006 | * Clumsy Factorial | 56% | Medium | |
| 1005 | * Maximize Sum Of Array After K Negations | 50% | Easy | |
| 1004 | * Max Consecutive Ones III | 62% | Medium | |
| 1003 | * Check If Word Is Valid After Substitutions | 59% | Medium | |
| 1002 | * Find Common Characters | 68% | Easy | |
| 1001 | * Grid Illumination | 36% | Hard | |
| 1000 | * Minimum Cost to Merge Stones | 43% | Hard | |
| 0999 | * Available Captures for Rook | 68% | Easy | |
| 0998 | * Maximum Binary Tree II | 68% | Medium | |
| 0997 | Find the Town Judge | 49% | Easy | |
| 0996 | * Number of Squareful Arrays | 49% | Hard | |
| 0995 | * Minimum Number of K Consecutive Bit Flips | 51% | Hard | |
| 0994 | Rotting Oranges | 53% | Medium | |
| 0993 | * Cousins in Binary Tree | 55% | Easy | |
| 0992 | * Subarrays with K Different Integers | 56% | Hard | |
| 0991 | * Broken Calculator | 54% | Medium | |
| 0990 | Satisfiability of Equality Equations | 50% | Medium | |
| 0989 | Add to Array-Form of Integer | 45% | Easy | |
| 0988 | * Smallest String Starting From Leaf | 51% | Medium | |
| 0987 | Vertical Order Traversal of a Binary Tree | 47% | Hard | |
| 0986 | Interval List Intersections | 71% | Medium | |
| 0985 | Sum of Even Numbers After Queries | 68% | Medium | |
| 0984 | * String Without AAA or BBB | 43% | Medium | |
| 0983 | Minimum Cost For Tickets | 65% | Medium | |
| 0982 | * Triples with Bitwise AND Equal To Zero | 57% | Hard | |
| 0981 | Time Based Key-Value Store | 49% | Medium | |
| 0980 | Unique Paths III | 81% | Hard | |
| 0979 | * Distribute Coins in Binary Tree | 72% | Medium | |
| 0978 | * Longest Turbulent Subarray | 47% | Medium | |
| 0977 | Squares of a Sorted Array | 71% | Easy | |
| 0976 | Largest Perimeter Triangle | 55% | Easy | |
| 0975 | * Odd Even Jump | 39% | Hard | |
| 0974 | Subarray Sums Divisible by K | 53% | Medium | |
| 0973 | K Closest Points to Origin | 66% | Medium | |
| 0972 | * Equal Rational Numbers | 43% | Hard | |
| 0971 | * Flip Binary Tree To Match Preorder Traversal | 50% | Medium | |
| 0970 | * Powerful Integers | 43% | Medium | |
| 0969 | * Pancake Sorting | 70% | Medium | |
| 0968 | * Binary Tree Cameras | 46% | Hard | |
| 0967 | Numbers With Same Consecutive Differences | 57% | Medium | |
| 0966 | * Vowel Spellchecker | 51% | Medium | |
| 0965 | * Univalued Binary Tree | 70% | Easy | |
| 0964 | * Least Operators to Express Number | 48% | Hard | |
| 0963 | * Minimum Area Rectangle II | 54% | Medium | |
| 0962 | * Maximum Width Ramp | 49% | Medium | |
| 0961 | * N-Repeated Element in Size 2N Array | 76% | Easy | |
| 0960 | * Delete Columns to Make Sorted III | 57% | Hard | |
| 0959 | * Regions Cut By Slashes | 69% | Medium | |
| 0958 | Check Completeness of a Binary Tree | 56% | Medium | |
| 0957 | * Prison Cells After N Days | 38% | Medium | |
| 0956 | Tallest Billboard | 52% | Hard | |
| 0955 | * Delete Columns to Make Sorted II | 35% | Medium | |
| 0954 | * Array of Doubled Pairs | 39% | Medium | |
| 0953 | Verifying an Alien Dictionary | 54% | Easy | |
| 0952 | * Largest Component Size by Common Factor | 40% | Hard | |
| 0951 | * Flip Equivalent Binary Trees | 66% | Medium | |
| 0950 | * Reveal Cards In Increasing Order | 77% | Medium | |
| 0949 | * Largest Time for Given Digits | 35% | Medium | |
| 0948 | Bag of Tokens | 52% | Medium | |
| 0947 | Most Stones Removed with Same Row or Column | 58% | Medium | |
| 0946 | Validate Stack Sequences | 69% | Medium | |
| 0945 | * Minimum Increment to Make Array Unique | 52% | Medium | |
| 0944 | Delete Columns to Make Sorted | 74% | Easy | |
| 0943 | * Find the Shortest Superstring | 43% | Hard | |
| 0942 | * DI String Match | 78% | Easy | |
| 0941 | * Valid Mountain Array | 33% | Easy | |
| 0940 | * Distinct Subsequences II | 43% | Hard | |
| 0939 | * Minimum Area Rectangle | 53% | Medium | |
| 0938 | Range Sum of BST | 86% | Easy | |
| 0937 | * Reorder Data in Log Files | 56% | Medium | |
| 0936 | Stamping The Sequence | 62% | Hard | |
| 0935 | Knight Dialer | 59% | Medium | |
| 0934 | Shortest Bridge | 57% | Medium | |
| 0933 | * Number of Recent Calls | 74% | Easy | |
| 0932 | * Beautiful Array | 65% | Medium | |
| 0931 | Minimum Falling Path Sum | 64% | Medium | |
| 0930 | * Binary Subarrays With Sum | 56% | Medium | |
| 0929 | * Unique Email Addresses | 67% | Easy | |
| 0928 | * Minimize Malware Spread II | 43% | Hard | |
| 0927 | * Three Equal Parts | 39% | Hard | |
| 0926 | Flip String to Monotone Increasing | 61% | Medium | |
| 0925 | * Long Pressed Name | 32% | Easy | |
| 0924 | * Minimize Malware Spread | 41% | Hard | |
| 0923 | * 3Sum With Multiplicity | 45% | Medium | |
| 0922 | * Sort Array By Parity II | 70% | Easy | |
| 0921 | * Minimum Add to Make Parentheses Valid | 75% | Medium | |
| 0920 | Number of Music Playlists | 60% | Hard | |
| 0919 | * Complete Binary Tree Inserter | 65% | Medium | |
| 0918 | Maximum Sum Circular Subarray | 44% | Medium | |
| 0917 | * Reverse Only Letters | 64% | Easy | |
| 0916 | Word Subsets | 52% | Medium | |
| 0915 | * Partition Array into Disjoint Intervals | 48% | Medium | |
| 0914 | * X of a Kind in a Deck of Cards | 30% | Easy | |
| 0913 | * Cat and Mouse | 34% | Hard | |
| 0912 | Sort an Array | 56% | Medium | |
| 0911 | * Online Election | 51% | Medium | |
| 0910 | * Smallest Range II | 36% | Medium | |
| 0909 | Snakes and Ladders | 43% | Medium | |
| 0908 | * Smallest Range I | 69% | Easy | |
| 0907 | Sum of Subarray Minimums | 37% | Medium | |
| 0906 | * Super Palindromes | 38% | Hard | |
| 0905 | Sort Array By Parity | 76% | Easy | |
| 0904 | Fruit Into Baskets | 43% | Medium | |
| 0903 | * Valid Permutations for DI Sequence | 57% | Hard | |
| 0902 | * Numbers At Most N Given Digit Set | 42% | Hard | |
| 0901 | Online Stock Span | 65% | Medium | |
| 0900 | * RLE Iterator | 59% | Medium | |
| 0899 | Orderly Queue | 65% | Hard | |
| 0898 | * Bitwise ORs of Subarrays | 38% | Medium | |
| 0897 | * Increasing Order Search Tree | 78% | Easy | |
| 0896 | Monotonic Array | 61% | Easy | |
| 0895 | * Maximum Frequency Stack | 66% | Hard | |
| 0894 | All Possible Full Binary Trees | 82% | Medium | |
| 0893 | * Groups of Special-Equivalent Strings | 71% | Medium | |
| 0892 | * Surface Area of 3D Shapes | 65% | Easy | |
| 0891 | * Sum of Subsequence Widths | 37% | Hard | |
| 0890 | Find and Replace Pattern | 76% | Medium | |
| 0889 | * Construct Binary Tree from Preorder and Postorder Traversal | 71% | Medium | |
| 0888 | * Fair Candy Swap | 61% | Easy | |
| 0887 | * Super Egg Drop | 27% | Hard | |
| 0886 | Possible Bipartition | 50% | Medium | |
| 0885 | * Spiral Matrix III | 74% | Medium | |
| 0884 | * Uncommon Words from Two Sentences | 67% | Easy | |
| 0883 | * Projection Area of 3D Shapes | 72% | Easy | |
| 0882 | * Reachable Nodes In Subdivided Graph | 50% | Hard | |
| 0881 | Boats to Save People | 56% | Medium | |
| 0880 | Decoded String at Index | 36% | Medium | |
| 0879 | Profitable Schemes | 48% | Hard | |
| 0878 | * Nth Magical Number | 35% | Hard | |
| 0877 | * Stone Game | 70% | Medium | |
| 0876 | Middle of the Linked List | 77% | Easy | |
| 0875 | Koko Eating Bananas | 49% | Medium | |
| 0874 | * Walking Robot Simulation | 39% | Medium | |
| 0873 | * Length of Longest Fibonacci Subsequence | 48% | Medium | |
| 0872 | Leaf-Similar Trees | 70% | Easy | |
| 0871 | Minimum Number of Refueling Stops | 39% | Hard | |
| 0870 | * Advantage Shuffle | 52% | Medium | |
| 0869 | Reordered Power of 2 | 62% | Medium | |
| 0868 | * Binary Gap | 63% | Easy | |
| 0867 | Transpose Matrix | 71% | Easy | |
| 0866 | * Prime Palindrome | 25% | Medium | |
| 0865 | * Smallest Subtree with all the Deepest Nodes | 70% | Medium | |
| 0864 | Shortest Path to Get All Keys | 53% | Hard | |
| 0863 | All Nodes Distance K in Binary Tree | 64% | Medium | |
| 0862 | * Shortest Subarray with Sum at Least K | 26% | Hard | |
| 0861 | * Score After Flipping Matrix | 74% | Medium | |
| 0860 | * Lemonade Change | 53% | Easy | |
| 0859 | Buddy Strings | 32% | Easy | |
| 0858 | Mirror Reflection | 62% | Medium | |
| 0857 | * Minimum Cost to Hire K Workers | 52% | Hard | |
| 0856 | * Score of Parentheses | 64% | Medium | |
| 0855 | * Exam Room | 43% | Medium | |
| 0854 | * K-Similar Strings | 39% | Hard | |
| 0853 | * Car Fleet | 50% | Medium | |
| 0852 | Peak Index in a Mountain Array | 68% | Medium | |
| 0851 | * Loud and Rich | 59% | Medium | |
| 0850 | * Rectangle Area II | 54% | Hard | |
| 0849 | * Maximize Distance to Closest Person | 48% | Medium | |
| 0848 | * Shifting Letters | 44% | Medium | |
| 0847 | Shortest Path Visiting All Nodes | 65% | Hard | |
| 0846 | * Hand of Straights | 55% | Medium | |
| 0845 | * Longest Mountain in Array | 40% | Medium | |
| 0844 | Backspace String Compare | 49% | Easy | |
| 0843 | * Guess the Word | 39% | Hard | |
| 0842 | * Split Array into Fibonacci Sequence | 38% | Medium | |
| 0841 | Keys and Rooms | 72% | Medium | |
| 0840 | * Magic Squares In Grid | 38% | Medium | |
| 0839 | Similar String Groups | 54% | Hard | |
| 0838 | Push Dominoes | 57% | Medium | |
| 0837 | New 21 Game | 45% | Medium | |
| 0836 | * Rectangle Overlap | 44% | Easy | |
| 0835 | Image Overlap | 63% | Medium | |
| 0834 | Sum of Distances in Tree | 59% | Hard | |
| 0833 | * Find And Replace in String | 53% | Medium | |
| 0832 | * Flipping an Image | 81% | Easy | |
| 0831 | * Masking Personal Information | 48% | Medium | |
| 0830 | * Positions of Large Groups | 52% | Easy | |
| 0829 | * Consecutive Numbers Sum | 41% | Hard | |
| 0828 | * Count Unique Characters of All Substrings of a Given String | 52% | Hard | |
| 0827 | * Making A Large Island | 46% | Hard | |
| 0826 | * Most Profit Assigning Work | 45% | Medium | |
| 0825 | * Friends Of Appropriate Ages | 47% | Medium | |
| 0824 | * Goat Latin | 68% | Easy | |
| 0823 | Binary Trees With Factors | 52% | Medium | |
| 0822 | * Card Flipping Game | 47% | Medium | |
| 0821 | * Shortest Distance to a Character | 71% | Easy | |
| 0820 | Short Encoding of Words | 60% | Medium | |
| 0819 | * Most Common Word | 44% | Easy | |
| 0818 | * Race Car | 43% | Hard | |
| 0817 | * Linked List Components | 56% | Medium | |
| 0816 | * Ambiguous Coordinates | 56% | Medium | |
| 0815 | Bus Routes | 48% | Hard | |
| 0814 | Binary Tree Pruning | 72% | Medium | |
| 0813 | * Largest Sum of Averages | 53% | Medium | |
| 0812 | * Largest Triangle Area | 60% | Easy | |
| 0811 | * Subdomain Visit Count | 76% | Medium | |
| 0810 | * Chalkboard XOR Game | 58% | Hard | |
| 0809 | * Expressive Words | 46% | Medium | |
| 0808 | Soup Servings | 54% | Medium | |
| 0807 | * Max Increase to Keep City Skyline | 86% | Medium | |
| 0806 | * Number of Lines To Write String | 67% | Easy | |
| 0805 | * Split Array With Same Average | 25% | Hard | |
| 0804 | Unique Morse Code Words | 82% | Easy | |
| 0803 | * Bricks Falling When Hit | 34% | Hard | |
| 0802 | * Find Eventual Safe States | 62% | Medium | |
| 0801 | * Minimum Swaps To Make Sequences Increasing | 39% | Hard | |
| 0799 | Champagne Tower | 58% | Medium | |
| 0798 | * Smallest Rotation with Highest Score | 50% | Hard | |
| 0797 | All Paths From Source to Target | 82% | Medium | |
| 0796 | * Rotate String | 57% | Easy | |
| 0795 | * Number of Subarrays with Bounded Maximum | 53% | Medium | |
| 0794 | * Valid Tic-Tac-Toe State | 34% | Medium | |
| 0793 | * Preimage Size of Factorial Zeroes Function | 43% | Hard | |
| 0792 | Number of Matching Subsequences | 51% | Medium | |
| 0791 | * Custom Sort String | 69% | Medium | |
| 0790 | Domino and Tromino Tiling | 50% | Medium | |
| 0789 | * Escape The Ghosts | 61% | Medium | |
| 0788 | * Rotated Digits | 56% | Medium | |
| 0787 | Cheapest Flights Within K Stops | 39% | Medium | |
| 0786 | * K-th Smallest Prime Fraction | 53% | Medium | |
| 0785 | Is Graph Bipartite? | 55% | Medium | |
| 0784 | Letter Case Permutation | 74% | Medium | |
| 0783 | Minimum Distance Between BST Nodes | 59% | Easy | |
| 0782 | * Transform to Chessboard | 51% | Hard | |
| 0781 | * Rabbits in Forest | 53% | Medium | |
| 0780 | * Reaching Points | 33% | Hard | |
| 0779 | K-th Symbol in Grammar | 46% | Medium | |
| 0778 | * Swim in Rising Water | 60% | Hard | |
| 0777 | * Swap Adjacent in LR String | 36% | Medium | |
| 0775 | * Global and Local Inversions | 42% | Medium | |
| 0773 | * Sliding Puzzle | 64% | Hard | |
| 0771 | * Jewels and Stones | 88% | Easy | |
| 0770 | * Basic Calculator IV | 55% | Hard | |
| 0769 | Max Chunks To Make Sorted | 58% | Medium | |
| 0768 | * Max Chunks To Make Sorted II | 53% | Hard | |
| 0767 | Reorganize String | 54% | Medium | |
| 0766 | Toeplitz Matrix | 68% | Easy | |
| 0765 | * Couples Holding Hands | 57% | Hard | |
| 0764 | * Largest Plus Sign | 48% | Medium | |
| 0763 | Partition Labels | 79% | Medium | |
| 0762 | * Prime Number of Set Bits in Binary Representation | 69% | Easy | |
| 0761 | * Special Binary String | 61% | Hard | |
| 0757 | * Set Intersection Size At Least Two | 44% | Hard | |
| 0756 | * Pyramid Transition Matrix | 52% | Medium | |
| 0754 | * Reach a Number | 42% | Medium | |
| 0753 | * Cracking the Safe | 56% | Hard | |
| 0752 | * Open the Lock | 55% | Medium | |
| 0749 | * Contain Virus | 50% | Hard | |
| 0748 | * Shortest Completing Word | 59% | Easy | |
| 0747 | * Largest Number At Least Twice of Others | 48% | Easy | |
| 0746 | Min Cost Climbing Stairs | 65% | Easy | |
| 0745 | * Prefix and Suffix Search | 41% | Hard | |
| 0744 | Find Smallest Letter Greater Than Target | 51% | Easy | |
| 0743 | * Network Delay Time | 53% | Medium | |
| 0741 | * Cherry Pickup | 36% | Hard | |
| 0740 | * Delete and Earn | 56% | Medium | |
| 0739 | Daily Temperatures | 65% | Medium | |
| 0738 | * Monotone Increasing Digits | 47% | Medium | |
| 0736 | * Parse Lisp Expression | 51% | Hard | |
| 0735 | Asteroid Collision | 44% | Medium | |
| 0733 | Flood Fill | 63% | Easy | |
| 0732 | My Calendar III | 71% | Hard | |
| 0731 | * My Calendar II | 55% | Medium | |
| 0730 | * Count Different Palindromic Subsequences | 45% | Hard | |
| 0729 | My Calendar I | 56% | Medium | |
| 0728 | * Self Dividing Numbers | 78% | Easy | |
| 0726 | * Number of Atoms | 52% | Hard | |
| 0725 | Split Linked List in Parts | 63% | Medium | |
| 0724 | Find Pivot Index | 57% | Easy | |
| 0722 | * Remove Comments | 38% | Medium | |
| 0721 | * Accounts Merge | 56% | Medium | |
| 0720 | * Longest Word in Dictionary | 52% | Medium | |
| 0719 | * Find K-th Smallest Pair Distance | 37% | Hard | |
| 0718 | Maximum Length of Repeated Subarray | 50% | Medium | |
| 0717 | * 1-bit and 2-bit Characters | 45% | Easy | |
| 0715 | * Range Module | 44% | Hard | |
| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | 68% | Medium | |
| 0713 | Subarray Product Less Than K | 47% | Medium | |
| 0712 | Minimum ASCII Delete Sum for Two Strings | 64% | Medium | |
| 0710 | * Random Pick with Blacklist | 33% | Hard | |
| 0709 | * To Lower Case | 83% | Easy | |
| 0707 | * Design Linked List | 28% | Medium | |
| 0706 | Design HashMap | 65% | Easy | |
| 0705 | Design HashSet | 67% | Easy | |
| 0704 | Binary Search | 57% | Easy | |
| 0703 | Kth Largest Element in a Stream | 56% | Easy | |
| 0701 | * Insert into a Binary Search Tree | 73% | Medium | |
| 0700 | * Search in a Binary Search Tree | 79% | Easy | |
| 0699 | * Falling Squares | 44% | Hard | |
| 0698 | * Partition to K Equal Sum Subsets | 38% | Medium | |
| 0697 | Degree of an Array | 56% | Easy | |
| 0696 | Count Binary Substrings | 65% | Easy | ⭐ |
| 0695 | Max Area of Island | 71% | Medium | |
| 0693 | Binary Number with Alternating Bits | 62% | Easy | |
| 0692 | Top K Frequent Words | 57% | Medium | |
| 0691 | * Stickers to Spell Word | 47% | Hard | |
| 0690 | * Employee Importance | 66% | Medium | |
| 0689 | * Maximum Sum of 3 Non-Overlapping Subarrays | 49% | Hard | |
| 0688 | Knight Probability in Chessboard | 56% | Medium | |
| 0687 | Longest Univalue Path | 41% | Medium | |
| 0686 | * Repeated String Match | 34% | Medium | |
| 0685 | * Redundant Connection II | 34% | Hard | |
| 0684 | Redundant Connection | 62% | Medium | ⭐ |
| 0682 | * Baseball Game | 75% | Easy | |
| 0680 | Valid Palindrome II | 40% | Easy | |
| 0679 | * 24 Game | 49% | Hard | |
| 0678 | * Valid Parenthesis String | 34% | Medium | |
| 0677 | Map Sum Pairs | 56% | Medium | |
| 0676 | * Implement Magic Dictionary | 57% | Medium | |
| 0675 | * Cut Off Trees for Golf Event | 34% | Hard | |
| 0674 | * Longest Continuous Increasing Subsequence | 50% | Easy | |
| 0673 | Number of Longest Increasing Subsequence | 47% | Medium | |
| 0672 | * Bulb Switcher II | 50% | Medium | |
| 0671 | Second Minimum Node In a Binary Tree | 44% | Easy | |
| 0670 | * Maximum Swap | 48% | Medium | |
| 0669 | Trim a Binary Search Tree | 66% | Medium | |
| 0668 | * Kth Smallest Number in Multiplication Table | 51% | Hard | |
| 0667 | Beautiful Arrangement II | 60% | Medium | |
| 0665 | Non-decreasing Array | 24% | Medium | |
| 0664 | Strange Printer | 54% | Hard | |
| 0662 | Maximum Width of Binary Tree | 42% | Medium | |
| 0661 | Image Smoother | 67% | Easy | |
| 0659 | Split Array into Consecutive Subsequences | 50% | Medium | |
| 0658 | Find K Closest Elements | 47% | Medium | |
| 0657 | * Robot Return to Origin | 75% | Easy | |
| 0655 | * Print Binary Tree | 63% | Medium | |
| 0654 | * Maximum Binary Tree | 85% | Medium | |
| 0653 | Two Sum IV - Input is a BST | 61% | Easy | |
| 0652 | Find Duplicate Subtrees | 59% | Medium | |
| 0650 | * 2 Keys Keyboard | 53% | Medium | |
| 0649 | Dota2 Senate | 47% | Medium | |
| 0648 | * Replace Words | 62% | Medium | |
| 0647 | Palindromic Substrings | 69% | Medium | |
| 0646 | Maximum Length of Pair Chain | 59% | Medium | |
| 0645 | Set Mismatch | 44% | Easy | |
| 0643 | * Maximum Average Subarray I | 43% | Easy | |
| 0641 | * Design Circular Deque | 56% | Medium | |
| 0640 | * Solve the Equation | 43% | Medium | |
| 0639 | * Decode Ways II | 30% | Hard | |
| 0638 | * Shopping Offers | 52% | Medium | |
| 0637 | Average of Levels in Binary Tree | 72% | Easy | |
| 0636 | * Exclusive Time of Functions | 62% | Medium | |
| 0633 | Sum of Square Numbers | 34% | Medium | |
| 0632 | * Smallest Range Covering Elements from K Lists | 62% | Hard | |
| 0630 | Course Schedule III | 40% | Hard | |
| 0629 | K Inverse Pairs Array | 50% | Hard | ⭐ |
| 0628 | * Maximum Product of Three Numbers | 45% | Easy | |
| 0623 | Add One Row to Tree | 59% | Medium | |
| 0622 | Design Circular Queue | 51% | Medium | |
| 0621 | Task Scheduler | 58% | Medium | |
| 0617 | Merge Two Binary Trees | 78% | Easy | |
| 0611 | * Valid Triangle Number | 51% | Medium | |
| 0609 | Find Duplicate File in System | 67% | Medium | |
| 0606 | Construct String from Binary Tree | 69% | Medium | |
| 0605 | Can Place Flowers | 29% | Easy | |
| 0600 | * Non-negative Integers without Consecutive Ones | 39% | Hard | |
| 0599 | * Minimum Index Sum of Two Lists | 55% | Easy | |
| 0598 | * Range Addition II | 55% | Easy | |
| 0594 | Longest Harmonious Subsequence | 54% | Easy | |
| 0593 | * Valid Square | 43% | Medium | |
| 0592 | * Fraction Addition and Subtraction | 53% | Medium | |
| 0591 | * Tag Validator | 38% | Hard | |
| 0590 | * N-ary Tree Postorder Traversal | 77% | Easy | |
| 0589 | N-ary Tree Preorder Traversal | 75% | Easy | |
| 0587 | Erect the Fence | 51% | Hard | |
| 0583 | * Delete Operation for Two Strings | 61% | Medium | |
| 0581 | * Shortest Unsorted Continuous Subarray | 36% | Medium | |
| 0576 | Out of Boundary Paths | 48% | Medium | |
| 0575 | * Distribute Candies | 67% | Easy | |
| 0572 | Subtree of Another Tree | 47% | Easy | |
| 0567 | Permutation in String | 44% | Medium | |
| 0566 | Reshape the Matrix | 63% | Easy | |
| 0565 | Array Nesting | 56% | Medium | |
| 0564 | * Find the Closest Palindrome | 22% | Hard | |
| 0563 | * Binary Tree Tilt | 61% | Easy | |
| 0561 | * Array Partition | 78% | Easy | |
| 0560 | * Subarray Sum Equals K | 43% | Medium | |
| 0559 | * Maximum Depth of N-ary Tree | 72% | Easy | |
| 0558 | * Logical OR of Two Binary Grids Represented as Quad-Trees | 49% | Medium | |
| 0557 | Reverse Words in a String III | 82% | Easy | |
| 0556 | * Next Greater Element III | 33% | Medium | |
| 0554 | * Brick Wall | 54% | Medium | |
| 0553 | * Optimal Division | 60% | Medium | |
| 0552 | * Student Attendance Record II | 42% | Hard | |
| 0551 | * Student Attendance Record I | 48% | Easy | |
| 0547 | Number of Provinces | 65% | Medium | |
| 0546 | * Remove Boxes | 47% | Hard | |
| 0543 | Diameter of Binary Tree | 58% | Easy | |
| 0542 | 01 Matrix | 48% | Medium | |
| 0541 | * Reverse String II | 50% | Easy | |
| 0540 | Single Element in a Sorted Array | 58% | Medium | |
| 0539 | * Minimum Time Difference | 56% | Medium | |
| 0538 | Convert BST to Greater Tree | 68% | Medium | |
| 0537 | * Complex Number Multiplication | 71% | Medium | |
| 0535 | * Encode and Decode TinyURL | 86% | Medium | |
| 0532 | * K-diff Pairs in an Array | 42% | Medium | |
| 0530 | Minimum Absolute Difference in BST | 58% | Easy | |
| 0529 | * Minesweeper | 66% | Medium | |
| 0528 | * Random Pick with Weight | 46% | Medium | |
| 0526 | * Beautiful Arrangement | 64% | Medium | |
| 0525 | * Contiguous Array | 46% | Medium | |
| 0524 | Longest Word in Dictionary through Deleting | 51% | Medium | |
| 0523 | Continuous Subarray Sum | 28% | Medium | |
| 0522 | * Longest Uncommon Subsequence II | 41% | Medium | |
| 0521 | * Longest Uncommon Subsequence I | 60% | Easy | |
| 0520 | Detect Capital | 56% | Easy | |
| 0519 | * Random Flip Matrix | 41% | Medium | |
| 0518 | Coin Change II | 63% | Medium | |
| 0517 | * Super Washing Machines | 41% | Hard | |
| 0516 | Longest Palindromic Subsequence | 62% | Medium | |
| 0515 | Find Largest Value in Each Tree Row | 65% | Medium | |
| 0514 | * Freedom Trail | 47% | Hard | |
| 0513 | Find Bottom Left Tree Value | 67% | Medium | |
| 0509 | Fibonacci Number | 70% | Easy | |
| 0508 | * Most Frequent Subtree Sum | 66% | Medium | |
| 0507 | * Perfect Number | 39% | Easy | |
| 0506 | * Relative Ranks | 63% | Easy | |
| 0504 | * Base 7 | 49% | Easy | |
| 0503 | Next Greater Element II | 63% | Medium | |
| 0502 | IPO | 49% | Hard | |
| 0501 | Find Mode in Binary Search Tree | 55% | Easy | |
| 0500 | * Keyboard Row | 70% | Easy | |
| 0498 | * Diagonal Traverse | 59% | Medium | |
| 0497 | * Random Point in Non-overlapping Rectangles | 39% | Medium | |
| 0496 | * Next Greater Element I | 72% | Easy | |
| 0495 | * Teemo Attacking | 56% | Easy | |
| 0494 | * Target Sum | 46% | Medium | |
| 0493 | * Reverse Pairs | 30% | Hard | |
| 0492 | * Construct the Rectangle | 57% | Easy | |
| 0491 | Non-decreasing Subsequences | 60% | Medium | |
| 0488 | * Zuma Game | 33% | Hard | |
| 0486 | Predict the Winner | 55% | Medium | |
| 0485 | Max Consecutive Ones | 58% | Easy | |
| 0483 | * Smallest Good Base | 40% | Hard | |
| 0482 | * License Key Formatting | 43% | Easy | |
| 0481 | * Magical String | 51% | Medium | |
| 0480 | * Sliding Window Median | 39% | Hard | |
| 0479 | * Largest Palindrome Product | 32% | Hard | |
| 0478 | * Generate Random Point in a Circle | 39% | Medium | |
| 0477 | * Total Hamming Distance | 52% | Medium | |
| 0476 | Number Complement | 67% | Easy | |
| 0475 | * Heaters | 37% | Medium | |
| 0474 | * Ones and Zeroes | 47% | Medium | |
| 0473 | Matchsticks to Square | 40% | Medium | ⭐ |
| 0472 | Concatenated Words | 49% | Hard | |
| 0470 | * Implement Rand10() Using Rand7() | 45% | Medium | |
| 0468 | Validate IP Address | 26% | Medium | |
| 0467 | * Unique Substrings in Wraparound String | 39% | Medium | |
| 0466 | * Count The Repetitions | 29% | Hard | |
| 0464 | * Can I Win | 29% | Medium | |
| 0463 | * Island Perimeter | 70% | Easy | |
| 0462 | Minimum Moves to Equal Array Elements II | 60% | Medium | |
| 0461 | Hamming Distance | 75% | Easy | |
| 0460 | LFU Cache | 43% | Hard | |
| 0459 | Repeated Substring Pattern | 46% | Easy | |
| 0458 | Poor Pigs | 59% | Hard | |
| 0457 | * Circular Array Loop | 33% | Medium | |
| 0456 | 132 Pattern | 33% | Medium | |
| 0455 | Assign Cookies | 52% | Easy | |
| 0454 | * 4Sum II | 57% | Medium | |
| 0453 | * Minimum Moves to Equal Array Elements | 56% | Medium | |
| 0452 | Minimum Number of Arrows to Burst Balloons | 56% | Medium | |
| 0451 | Sort Characters By Frequency | 72% | Medium | |
| 0450 | * Delete Node in a BST | 51% | Medium | |
| 0449 | * Serialize and Deserialize BST | 57% | Medium | |
| 0448 | * Find All Numbers Disappeared in an Array | 60% | Easy | |
| 0447 | * Number of Boomerangs | 55% | Medium | |
| 0446 | Arithmetic Slices II - Subsequence | 54% | Hard | |
| 0445 | Add Two Numbers II | 61% | Medium | |
| 0443 | String Compression | 53% | Medium | |
| 0442 | * Find All Duplicates in an Array | 73% | Medium | |
| 0441 | * Arranging Coins | 46% | Easy | |
| 0440 | * K-th Smallest in Lexicographical Order | 31% | Hard | |
| 0438 | Find All Anagrams in a String | 50% | Medium | |
| 0437 | Path Sum III | 46% | Medium | |
| 0436 | * Find Right Interval | 51% | Medium | |
| 0435 | Non-overlapping Intervals | 52% | Medium | |
| 0434 | * Number of Segments in a String | 36% | Easy | |
| 0433 | Minimum Genetic Mutation | 53% | Medium | |
| 0432 | * All O`one Data Structure | 36% | Hard | |
| 0430 | * Flatten a Multilevel Doubly Linked List | 59% | Medium | |
| 0429 | N-ary Tree Level Order Traversal | 70% | Medium | |
| 0427 | Construct Quad Tree | 75% | Medium | |
| 0424 | Longest Repeating Character Replacement | 53% | Medium | |
| 0423 | * Reconstruct Original Digits from English | 51% | Medium | |
| 0421 | * Maximum XOR of Two Numbers in an Array | 53% | Medium | |
| 0420 | * Strong Password Checker | 13% | Hard | |
| 0419 | * Battleships in a Board | 75% | Medium | |
| 0417 | Pacific Atlantic Water Flow | 55% | Medium | |
| 0416 | Partition Equal Subset Sum | 46% | Medium | |
| 0415 | * Add Strings | 51% | Easy | |
| 0414 | * Third Maximum Number | 34% | Easy | |
| 0413 | * Arithmetic Slices | 65% | Medium | |
| 0412 | * Fizz Buzz | 71% | Easy | |
| 0410 | * Split Array Largest Sum | 54% | Hard | |
| 0409 | Longest Palindrome | 53% | Easy | |
| 0407 | * Trapping Rain Water II | 47% | Hard | |
| 0406 | Queue Reconstruction by Height | 73% | Medium | ⭐ |
| 0405 | * Convert a Number to Hexadecimal | 48% | Easy | |
| 0404 | Sum of Left Leaves | 57% | Easy | |
| 0403 | Frog Jump | 45% | Hard | |
| 0402 | * Remove K Digits | 31% | Medium | |
| 0401 | * Binary Watch | 53% | Easy | |
| 0400 | * Nth Digit | 34% | Medium | |
| 0399 | Evaluate Division | 61% | Medium | |
| 0398 | * Random Pick Index | 63% | Medium | |
| 0397 | * Integer Replacement | 35% | Medium | |
| 0396 | * Rotate Function | 42% | Medium | |
| 0395 | * Longest Substring with At Least K Repeating Characters | 44% | Medium | |
| 0394 | Decode String | 58% | Medium | |
| 0393 | UTF-8 Validation | 45% | Medium | |
| 0392 | Is Subsequence | 47% | Easy | |
| 0391 | * Perfect Rectangle | 33% | Hard | |
| 0390 | * Elimination Game | 45% | Medium | |
| 0389 | Find the Difference | 59% | Easy | |
| 0388 | * Longest Absolute File Path | 47% | Medium | |
| 0387 | First Unique Character in a String | 61% | Easy | |
| 0386 | * Lexicographical Numbers | 63% | Medium | |
| 0385 | * Mini Parser | 37% | Medium | |
| 0384 | * Shuffle an Array | 58% | Medium | |
| 0383 | Ransom Note | 60% | Easy | |
| 0382 | Linked List Random Node | 63% | Medium | |
| 0381 | * Insert Delete GetRandom O(1) - Duplicates allowed | 35% | Hard | |
| 0380 | Insert Delete GetRandom O(1) | 54% | Medium | |
| 0378 | Kth Smallest Element in a Sorted Matrix | 62% | Medium | |
| 0377 | Combination Sum IV | 54% | Medium | |
| 0376 | Wiggle Subsequence | 48% | Medium | |
| 0375 | * Guess Number Higher or Lower II | 48% | Medium | |
| 0374 | Guess Number Higher or Lower | 53% | Easy | |
| 0373 | Find K Pairs with Smallest Sums | 39% | Medium | |
| 0372 | * Super Pow | 35% | Medium | |
| 0371 | Sum of Two Integers | 51% | Medium | |
| 0368 | Largest Divisible Subset | 45% | Medium | |
| 0367 | * Valid Perfect Square | 43% | Easy | |
| 0365 | * Water and Jug Problem | 39% | Medium | |
| 0363 | Max Sum of Rectangle No Larger Than K | 44% | Hard | |
| 0357 | * Count Numbers with Unique Digits | 52% | Medium | |
| 0355 | * Design Twitter | 39% | Medium | |
| 0354 | * Russian Doll Envelopes | 37% | Hard | |
| 0352 | Data Stream as Disjoint Intervals | 59% | Hard | |
| 0350 | * Intersection of Two Arrays II | 56% | Easy | |
| 0349 | * Intersection of Two Arrays | 72% | Easy | |
| 0347 | Top K Frequent Elements | 62% | Medium | |
| 0345 | Reverse Vowels of a String | 52% | Easy | |
| 0344 | Reverse String | 77% | Easy | |
| 0343 | Integer Break | 60% | Medium | |
| 0342 | Power of Four | 47% | Easy | |
| 0341 | Flatten Nested List Iterator | 64% | Medium | |
| 0338 | Counting Bits | 78% | Easy | |
| 0337 | House Robber III | 54% | Medium | ⭐ |
| 0336 | Palindrome Pairs | 35% | Hard | |
| 0335 | * Self Crossing | 30% | Hard | |
| 0334 | Increasing Triplet Subsequence | 40% | Medium | |
| 0332 | Reconstruct Itinerary | 43% | Hard | |
| 0331 | * Verify Preorder Serialization of a Binary Tree | 45% | Medium | |
| 0330 | * Patching Array | 41% | Hard | |
| 0329 | * Longest Increasing Path in a Matrix | 53% | Hard | |
| 0328 | Odd Even Linked List | 61% | Medium | |
| 0327 | * Count of Range Sum | 35% | Hard | |
| 0326 | Power of Three | 46% | Easy | |
| 0324 | * Wiggle Sort II | 34% | Medium | |
| 0322 | Coin Change | 43% | Medium | |
| 0321 | * Create Maximum Number | 29% | Hard | |
| 0319 | Bulb Switcher | 52% | Medium | |
| 0318 | Maximum Product of Word Lengths | 59% | Medium | |
| 0316 | Remove Duplicate Letters | 49% | Medium | |
| 0315 | Count of Smaller Numbers After Self | 42% | Hard | ⭐ |
| 0313 | * Super Ugly Number | 45% | Medium | |
| 0312 | * Burst Balloons | 58% | Hard | |
| 0310 | * Minimum Height Trees | 38% | Medium | |
| 0309 | Best Time to Buy and Sell Stock with Cooldown | 57% | Medium | |
| 0307 | Range Sum Query - Mutable | 40% | Medium | |
| 0306 | * Additive Number | 31% | Medium | |
| 0304 | * Range Sum Query 2D - Immutable | 54% | Medium | |
| 0303 | * Range Sum Query - Immutable | 62% | Easy | |
| 0301 | * Remove Invalid Parentheses | 47% | Hard | |
| 0300 | Longest Increasing Subsequence | 54% | Medium | |
| 0299 | Bulls and Cows | 50% | Medium | |
| 0297 | * Serialize and Deserialize Binary Tree | 56% | Hard | |
| 0295 | Find Median from Data Stream | 51% | Hard | |
| 0292 | * Nim Game | 56% | Easy | |
| 0290 | Word Pattern | 41% | Easy | |
| 0289 | * Game of Life | 68% | Medium | |
| 0287 | Find the Duplicate Number | 59% | Medium | |
| 0284 | * Peeking Iterator | 59% | Medium | |
| 0283 | Move Zeroes | 61% | Easy | |
| 0282 | * Expression Add Operators | 39% | Hard | |
| 0279 | Perfect Squares | 54% | Medium | |
| 0278 | First Bad Version | 44% | Easy | |
| 0275 | * H-Index II | 38% | Medium | |
| 0274 | * H-Index | 38% | Medium | |
| 0273 | * Integer to English Words | 30% | Hard | |
| 0268 | Missing Number | 66% | Easy | |
| 0264 | * Ugly Number II | 46% | Medium | |
| 0263 | Ugly Number | 41% | Easy | |
| 0260 | Single Number III | 68% | Medium | |
| 0258 | Add Digits | 66% | Easy | |
| 0257 | * Binary Tree Paths | 63% | Easy | |
| 0242 | Valid Anagram | 64% | Easy | |
| 0241 | Different Ways to Add Parentheses | 65% | Medium | |
| 0240 | Search a 2D Matrix II | 52% | Medium | |
| 0239 | Sliding Window Maximum | 46% | Hard | |
| 0238 | Product of Array Except Self | 65% | Medium | |
| 0237 | Delete Node in a Linked List | 78% | Medium | |
| 0236 | Lowest Common Ancestor of a Binary Tree | 61% | Medium | |
| 0235 | Lowest Common Ancestor of a Binary Search Tree | 64% | Medium | |
| 0234 | Palindrome Linked List | 51% | Easy | |
| 0233 | * Number of Digit One | 34% | Hard | |
| 0232 | Implement Queue using Stacks | 66% | Easy | |
| 0231 | Power of Two | 47% | Easy | |
| 0230 | Kth Smallest Element in a BST | 72% | Medium | |
| 0229 | Majority Element II | 51% | Medium | |
| 0228 | Summary Ranges | 50% | Easy | |
| 0227 | Basic Calculator II | 43% | Medium | |
| 0226 | Invert Binary Tree | 76% | Easy | |
| 0225 | Implement Stack using Queues | 63% | Easy | |
| 0224 | Basic Calculator | 43% | Hard | |
| 0223 | Rectangle Area | 45% | Medium | |
| 0222 | Count Complete Tree Nodes | 64% | Easy | |
| 0221 | * Maximal Square | 46% | Medium | |
| 0220 | * Contains Duplicate III | 22% | Hard | |
| 0219 | Contains Duplicate II | 44% | Easy | |
| 0218 | The Skyline Problem | 42% | Hard | |
| 0217 | Contains Duplicate | 61% | Easy | |
| 0216 | * Combination Sum III | 69% | Medium | |
| 0215 | Kth Largest Element in an Array | 66% | Medium | |
| 0214 | * Shortest Palindrome | 33% | Hard | |
| 0213 | * House Robber II | 41% | Medium | |
| 0212 | Word Search II | 36% | Hard | |
| 0211 | Design Add and Search Words Data Structure | 44% | Medium | |
| 0210 | Course Schedule II | 50% | Medium | ⭐ |
| 0209 | Minimum Size Subarray Sum | 46% | Medium | |
| 0208 | Implement Trie (Prefix Tree) | 64% | Medium | |
| 0207 | Course Schedule | 46% | Medium | ⭐ |
| 0206 | Reverse Linked List | 75% | Easy | |
| 0205 | Isomorphic Strings | 43% | Easy | |
| 0204 | * Count Primes | 33% | Medium | |
| 0203 | * Remove Linked List Elements | 48% | Easy | |
| 0202 | Happy Number | 55% | Easy | |
| 0201 | Bitwise AND of Numbers Range | 46% | Medium | |
| 0200 | Number of Islands | 58% | Medium | |
| 0199 | Binary Tree Right Side View | 62% | Medium | |
| 0198 | House Robber | 50% | Medium | |
| 0191 | Number of 1 Bits | 70% | Easy | |
| 0190 | Reverse Bits | 57% | Easy | |
| 0189 | Rotate Array | 40% | Medium | |
| 0188 | Best Time to Buy and Sell Stock IV | 42% | Hard | |
| 0187 | * Repeated DNA Sequences | 48% | Medium | |
| 0179 | * Largest Number | 35% | Medium | |
| 0174 | * Dungeon Game | 37% | Hard | |
| 0173 | Binary Search Tree Iterator | 71% | Medium | |
| 0172 | * Factorial Trailing Zeroes | 43% | Medium | |
| 0171 | * Excel Sheet Column Number | 63% | Easy | |
| 0169 | Majority Element | 64% | Easy | |
| 0168 | Excel Sheet Column Title | 40% | Easy | |
| 0167 | Two Sum II - Input Array Is Sorted | 60% | Medium | |
| 0166 | * Fraction to Recurring Decimal | 24% | Medium | |
| 0165 | * Compare Version Numbers | 36% | Medium | |
| 0164 | * Maximum Gap | 45% | Medium | |
| 0162 | Find Peak Element | 45% | Medium | |
| 0160 | Intersection of Two Linked Lists | 56% | Easy | |
| 0155 | Min Stack | 53% | Medium | |
| 0154 | * Find Minimum in Rotated Sorted Array II | 43% | Hard | |
| 0153 | Find Minimum in Rotated Sorted Array | 50% | Medium | |
| 0152 | Maximum Product Subarray | 34% | Medium | |
| 0151 | Reverse Words in a String | 40% | Medium | |
| 0150 | Evaluate Reverse Polish Notation | 50% | Medium | |
| 0149 | Max Points on a Line | 26% | Hard | |
| 0148 | Sort List | 57% | Medium | |
| 0147 | * Insertion Sort List | 53% | Medium | |
| 0146 | LRU Cache | 42% | Medium | |
| 0145 | Binary Tree Postorder Traversal | 70% | Easy | |
| 0144 | Binary Tree Preorder Traversal | 69% | Easy | |
| 0143 | * Reorder List | 55% | Medium | |
| 0142 | Linked List Cycle II | 50% | Medium | |
| 0141 | Linked List Cycle | 49% | Easy | |
| 0140 | * Word Break II | 47% | Hard | |
| 0139 | Word Break | 46% | Medium | |
| 0138 | Copy List with Random Pointer | 55% | Medium | |
| 0137 | Single Number II | 62% | Medium | |
| 0136 | Single Number | 72% | Easy | |
| 0135 | Candy | 43% | Hard | |
| 0134 | Gas Station | 45% | Medium | |
| 0133 | Clone Graph | 56% | Medium | |
| 0132 | * Palindrome Partitioning II | 33% | Hard | |
| 0131 | Palindrome Partitioning | 67% | Medium | |
| 0130 | Surrounded Regions | 38% | Medium | |
| 0129 | Sum Root to Leaf Numbers | 63% | Medium | |
| 0128 | Longest Consecutive Sequence | 47% | Medium | |
| 0127 | * Word Ladder | 38% | Hard | |
| 0126 | Word Ladder II | 27% | Hard | ⭐ |
| 0125 | Valid Palindrome | 46% | Easy | |
| 0124 | Binary Tree Maximum Path Sum | 39% | Hard | |
| 0123 | * Best Time to Buy and Sell Stock III | 47% | Hard | |
| 0122 | Best Time to Buy and Sell Stock II | 65% | Medium | |
| 0121 | Best Time to Buy and Sell Stock | 53% | Easy | |
| 0120 | Triangle | 56% | Medium | |
| 0119 | Pascal's Triangle II | 63% | Easy | |
| 0118 | Pascal's Triangle | 73% | Easy | |
| 0117 | Populating Next Right Pointers in Each Node II | 52% | Medium | |
| 0116 | Populating Next Right Pointers in Each Node | 62% | Medium | |
| 0115 | * Distinct Subsequences | 46% | Hard | |
| 0114 | Flatten Binary Tree to Linked List | 64% | Medium | |
| 0113 | Path Sum II | 58% | Medium | |
| 0112 | Path Sum | 49% | Easy | |
| 0111 | Minimum Depth of Binary Tree | 47% | Easy | |
| 0110 | Balanced Binary Tree | 51% | Easy | |
| 0109 | Convert Sorted List to Binary Search Tree | 61% | Medium | |
| 0108 | Convert Sorted Array to Binary Search Tree | 71% | Easy | |
| 0107 | * Binary Tree Level Order Traversal II | 62% | Medium | |
| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | 62% | Medium | |
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | 63% | Medium | |
| 0104 | Maximum Depth of Binary Tree | 75% | Easy | |
| 0103 | Binary Tree Zigzag Level Order Traversal | 58% | Medium | |
| 0102 | Binary Tree Level Order Traversal | 66% | Medium | |
| 0101 | Symmetric Tree | 56% | Easy | |
| 0100 | Same Tree | 60% | Easy | |
| 0099 | * Recover Binary Search Tree | 52% | Medium | |
| 0098 | Validate Binary Search Tree | 32% | Medium | |
| 0097 | Interleaving String | 39% | Medium | |
| 0096 | * Unique Binary Search Trees | 60% | Medium | |
| 0095 | Unique Binary Search Trees II | 57% | Medium | ⭐ |
| 0094 | Binary Tree Inorder Traversal | 75% | Easy | |
| 0093 | Restore IP Addresses | 49% | Medium | |
| 0092 | Reverse Linked List II | 47% | Medium | |
| 0091 | Decode Ways | 34% | Medium | |
| 0090 | Subsets II | 56% | Medium | |
| 0089 | * Gray Code | 58% | Medium | |
| 0088 | Merge Sorted Array | 49% | Easy | |
| 0087 | Scramble String | 39% | Hard | |
| 0086 | Partition List | 55% | Medium | |
| 0085 | * Maximal Rectangle | 46% | Hard | |
| 0084 | * Largest Rectangle in Histogram | 44% | Hard | |
| 0083 | Remove Duplicates from Sorted List | 52% | Easy | |
| 0082 | Remove Duplicates from Sorted List II | 47% | Medium | |
| 0081 | Search in Rotated Sorted Array II | 37% | Medium | |
| 0080 | * Remove Duplicates from Sorted Array II | 57% | Medium | |
| 0079 | Word Search | 41% | Medium | |
| 0078 | Subsets | 77% | Medium | |
| 0077 | Combinations | 70% | Medium | |
| 0076 | Minimum Window Substring | 42% | Hard | |
| 0075 | Sort Colors | 61% | Medium | |
| 0074 | Search a 2D Matrix | 49% | Medium | |
| 0073 | * Set Matrix Zeroes | 54% | Medium | |
| 0072 | Edit Distance | 56% | Medium | |
| 0071 | Simplify Path | 41% | Medium | |
| 0070 | Climbing Stairs | 52% | Easy | |
| 0069 | Sqrt(x) | 38% | Easy | |
| 0068 | Text Justification | 42% | Hard | |
| 0067 | Add Binary | 53% | Easy | |
| 0066 | * Plus One | 44% | Easy | |
| 0065 | * Valid Number | 19% | Hard | |
| 0064 | Minimum Path Sum | 63% | Medium | |
| 0063 | Unique Paths II | 41% | Medium | |
| 0062 | Unique Paths | 64% | Medium | |
| 0061 | * Rotate List | 37% | Medium | |
| 0060 | * Permutation Sequence | 46% | Hard | |
| 0059 | Spiral Matrix II | 70% | Medium | |
| 0058 | * Length of Last Word | 48% | Easy | |
| 0057 | Insert Interval | 39% | Medium | |
| 0056 | Merge Intervals | 47% | Medium | |
| 0055 | Jump Game | 38% | Medium | |
| 0054 | Spiral Matrix | 48% | Medium | |
| 0053 | Maximum Subarray | 50% | Medium | |
| 0052 | * N-Queens II | 73% | Hard | |
| 0051 | * N-Queens | 67% | Hard | |
| 0050 | Pow(x, n) | 34% | Medium | |
| 0049 | Group Anagrams | 68% | Medium | |
| 0048 | Rotate Image | 73% | Medium | |
| 0047 | Permutations II | 58% | Medium | |
| 0046 | Permutations | 77% | Medium | |
| 0045 | Jump Game II | 40% | Medium | |
| 0044 | * Wildcard Matching | 27% | Hard | |
| 0043 | Multiply Strings | 40% | Medium | |
| 0042 | Trapping Rain Water | 60% | Hard | |
| 0041 | * First Missing Positive | 37% | Hard | |
| 0040 | Combination Sum II | 54% | Medium | |
| 0039 | Combination Sum | 70% | Medium | |
| 0038 | Count and Say | 54% | Medium | |
| 0037 | * Sudoku Solver | 60% | Hard | |
| 0036 | Valid Sudoku | 59% | Medium | |
| 0035 | Search Insert Position | 45% | Easy | |
| 0034 | Find First and Last Position of Element in Sorted Array | 43% | Medium | |
| 0033 | Search in Rotated Sorted Array | 40% | Medium | |
| 0032 | * Longest Valid Parentheses | 33% | Hard | |
| 0031 | * Next Permutation | 39% | Medium | |
| 0030 | Substring with Concatenation of All Words | 32% | Hard | |
| 0029 | * Divide Two Integers | 17% | Medium | |
| 0028 | Find the Index of the First Occurrence in a String | 41% | Easy | |
| 0027 | * Remove Element | 56% | Easy | |
| 0026 | Remove Duplicates from Sorted Array | 54% | Easy | |
| 0025 | * Reverse Nodes in k-Group | 58% | Hard | |
| 0024 | Swap Nodes in Pairs | 63% | Medium | |
| 0023 | Merge k Sorted Lists | 52% | Hard | |
| 0022 | Generate Parentheses | 74% | Medium | |
| 0021 | Merge Two Sorted Lists | 63% | Easy | |
| 0020 | Valid Parentheses | 40% | Easy | |
| 0019 | Remove Nth Node From End of List | 43% | Medium | |
| 0018 | 4Sum | 36% | Medium | |
| 0017 | Letter Combinations of a Phone Number | 59% | Medium | |
| 0016 | 3Sum Closest | 45% | Medium | |
| 0015 | 3Sum | 34% | Medium | |
| 0014 | Longest Common Prefix | 42% | Easy | |
| 0013 | Roman to Integer | 60% | Easy | |
| 0012 | Integer to Roman | 64% | Medium | |
| 0011 | Container With Most Water | 54% | Medium | |
| 0010 | * Regular Expression Matching | 28% | Hard | |
| 0009 | Palindrome Number | 55% | Easy | |
| 0008 | * String to Integer (atoi) | 17% | Medium | |
| 0007 | * Reverse Integer | 28% | Medium | |
| 0006 | Zigzag Conversion | 47% | Medium | |
| 0005 | Longest Palindromic Substring | 33% | Medium | |
| 0004 | Median of Two Sorted Arrays | 39% | Hard | |
| 0003 | Longest Substring Without Repeating Characters | 34% | Medium | |
| 0002 | Add Two Numbers | 42% | Medium | |
| 0001 | Two Sum | 51% | Easy |
Directories
Click to show internal directories.
Click to hide internal directories.