-
If you like, star the original repository https://github.com/kaiwensun/leetcode
-
LeetCode websites
-
This report is generated by janitor.py.
-
Last update: Saturday, September 30, 2023
Total | Solved | Attempted | US site non-DB unsolved w/o lock (solved rate) | Starred |
---|---|---|---|---|
3270 | 2065 | 6 | 247 (88.90%) | 15 |
py | ts | java | rb | c | cpp | js | php |
---|---|---|---|---|---|---|---|
59.5% | 14.4% | 11.0% | 6.7% | 4.5% | 2.3% | 0.9% | 0.8% |
0001-0500 | 0501-1000 | 1001-1500 | 1501-2000 | 2001-2500 | 2501-3000 |
DD | LCP | LCR | LCS | ιΆθ | ι’θ―ι’ |
The table below lists only the latest 1000 items. Unfortunately, starting from May 2023 GitHub introduced a breaking change to further reduce the rendered blob size. For a full list, check full_table.md.
Status | # | Title | Question Links | My Solutions | Difficulty (CN) |
---|---|---|---|---|---|
βοΈ | 2876 | Count Visited Nodes in a Directed Graph | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2875 | Minimum Size Subarray in Infinite Array | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2874 | Maximum Value of an Ordered Triplet II | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2873 | Maximum Value of an Ordered Triplet I | πΊπΈ π¨π³ | py | Easy |
2872 | Maximum Number of K-Divisible Components | πΊπΈ π¨π³ | Hard | ||
2871 | Split Array Into Maximum Number of Subarrays | πΊπΈ π¨π³ | Medium | ||
2870 | Minimum Number of Operations to Make Array Empty | πΊπΈ π¨π³ | Medium | ||
2869 | Minimum Operations to Collect Elements | πΊπΈ π¨π³ | Easy | ||
π | 2868 | The Wording Game | πΊπΈ π¨π³ | Hard | |
βοΈ | 2867 | Count Valid Paths in a Tree | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2866 | Beautiful Towers II | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2865 | Beautiful Towers I | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2864 | Maximum Odd Binary Number | πΊπΈ π¨π³ | py | Easy |
π | 2863 | Maximum Length of Semi-Decreasing Subarrays | πΊπΈ π¨π³ | Medium | |
2862 | Maximum Element-Sum of a Complete Subset of Indices | πΊπΈ π¨π³ | Hard | ||
2861 | Maximum Number of Alloys | πΊπΈ π¨π³ | Medium | ||
2860 | Happy Students | πΊπΈ π¨π³ | Medium | ||
2859 | Sum of Values at Indices With K Set Bits | πΊπΈ π¨π³ | Easy | ||
2858 | Minimum Edge Reversals So Every Node Is Reachable | πΊπΈ π¨π³ | Hard | ||
2857 | Count Pairs of Points With Distance k | πΊπΈ π¨π³ | Medium | ||
2856 | Minimum Array Length After Pair Removals | πΊπΈ π¨π³ | Medium | ||
2855 | Minimum Right Shifts to Sort the Array | πΊπΈ π¨π³ | Easy | ||
π sql | 2854 | Rolling Average Steps | πΊπΈ π¨π³ | Medium | |
π sql | 2853 | Highest Salaries Difference | πΊπΈ π¨π³ | Easy | |
π | 2852 | Sum of Remoteness of All Cells | πΊπΈ π¨π³ | Medium | |
2851 | String Transformation | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2850 | Minimum Moves to Spread Stones Over Grid | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2849 | Determine if a Cell Is Reachable at a Given Time | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2848 | Points That Intersect With Cars | πΊπΈ π¨π³ | py | Easy |
π | 2847 | Smallest Number With Given Digit Product | πΊπΈ π¨π³ | Medium | |
2846 | Minimum Edge Weight Equilibrium Queries in a Tree | πΊπΈ π¨π³ | Hard | ||
2845 | Count of Interesting Subarrays | πΊπΈ π¨π³ | Medium | ||
βοΈ | 2844 | Minimum Operations to Make a Special Number | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2843 | Count Symmetric Integers | πΊπΈ π¨π³ | py | Easy |
2842 | Count K-Subsequences of a String With Maximum Beauty | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2841 | Maximum Sum of Almost Unique Subarray | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2840 | Check if Strings Can be Made Equal With Operations II | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2839 | Check if Strings Can be Made Equal With Operations I | πΊπΈ π¨π³ | py | Easy |
π | 2838 | Maximum Coins Heroes Can Collect | πΊπΈ π¨π³ | Medium | |
π sql | 2837 | Total Traveled Distance | πΊπΈ π¨π³ | Easy | |
βοΈβ | 2836 | Maximize Value of Function in a Ball Passing Game | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2835 | Minimum Operations to Form Subsequence With Target Sum | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2834 | Find the Minimum Possible Sum of a Beautiful Array | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2833 | Furthest Point From Origin | πΊπΈ π¨π³ | py | Easy |
π | 2832 | Maximal Range That Each Element Is Maximum in It | πΊπΈ π¨π³ | Medium | |
βοΈ | 2831 | Find the Longest Equal Subarray | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2830 | Maximize the Profit as the Salesman | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2829 | Determine the Minimum Sum of a k-avoiding Array | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2828 | Check if a String Is an Acronym of Words | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2827 | Number of Beautiful Integers in the Range | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2826 | Sorting Three Groups | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2825 | Make String a Subsequence Using Cyclic Increments | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2824 | Count Pairs Whose Sum is Less than Target | πΊπΈ π¨π³ | py | Easy |
π | 2823 | Deep Object Filter | πΊπΈ π¨π³ | Medium | |
π | 2822 | Inversion of Object | πΊπΈ π¨π³ | Easy | |
π | 2821 | Delay the Resolution of Each Promise | πΊπΈ π¨π³ | Easy | |
π sql | 2820 | Election Results | πΊπΈ π¨π³ | Medium | |
π | 2819 | Minimum Relative Loss After Buying Chocolates | πΊπΈ π¨π³ | Hard | |
βοΈ | 2818 | Apply Operations to Maximize Score | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2817 | Minimum Absolute Difference Between Elements With Constraint | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2816 | Double a Number Represented as a Linked List | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2815 | Max Pair Sum in an Array | πΊπΈ π¨π³ | py | Easy |
π | 2814 | Minimum Time Takes to Reach Destination Without Drowning | πΊπΈ π¨π³ | Hard | |
2813 | Maximum Elegance of a K-Length Subsequence | πΊπΈ π¨π³ | Hard | ||
2812 | Find the Safest Path in a Grid | πΊπΈ π¨π³ | Medium | ||
2811 | Check if it is Possible to Split Array | πΊπΈ π¨π³ | Medium | ||
2810 | Faulty Keyboard | πΊπΈ π¨π³ | Easy | ||
2809 | Minimum Time to Make Array Sum At Most x | πΊπΈ π¨π³ | Hard | ||
2808 | Minimum Seconds to Equalize a Circular Array | πΊπΈ π¨π³ | Medium | ||
2807 | Insert Greatest Common Divisors in Linked List | πΊπΈ π¨π³ | Medium | ||
2806 | Account Balance After Rounded Purchase | πΊπΈ π¨π³ | Easy | ||
π | 2805 | Custom Interval | πΊπΈ π¨π³ | Medium | |
π | 2804 | Array Prototype ForEach | πΊπΈ π¨π³ | Easy | |
π | 2803 | Factorial Generator | πΊπΈ π¨π³ | Easy | |
π | 2802 | Find The K-th Lucky Number | πΊπΈ π¨π³ | Medium | |
βοΈ | 2801 | Count Stepping Numbers in Range | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2800 | Shortest String That Contains Three Strings | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2799 | Count Complete Subarrays in an Array | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2798 | Number of Employees Who Met the Target | πΊπΈ π¨π³ | ts | Easy |
π | 2797 | Partial Function with Placeholders | πΊπΈ π¨π³ | Medium | |
π | 2796 | Repeat String | πΊπΈ π¨π³ | Easy | |
π | 2795 | Parallel Execution of Promises for Individual Results Retrieval | πΊπΈ π¨π³ | Medium | |
π | 2794 | Create Object from Two Arrays | πΊπΈ π¨π³ | Easy | |
π sql | 2793 | Status of Flight Tickets | πΊπΈ π¨π³ | Hard | |
π | 2792 | Count Nodes That Are Great Enough | πΊπΈ π¨π³ | Medium | |
2791 | Count Paths That Can Form a Palindrome in a Tree | πΊπΈ π¨π³ | md | Hard | |
2790 | Maximum Number of Groups With Increasing Length | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2789 | Largest Element in an Array after Merge Operations | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2788 | Split Strings by Separator | πΊπΈ π¨π³ | py | Easy |
2787 | Ways to Express an Integer as Sum of Powers | πΊπΈ π¨π³ | Medium | ||
2786 | Visit Array Positions to Maximize Score | πΊπΈ π¨π³ | Medium | ||
2785 | Sort Vowels in a String | πΊπΈ π¨π³ | Medium | ||
2784 | Check if Array is Good | πΊπΈ π¨π³ | Easy | ||
π sql | 2783 | Flight Occupancy and Waitlist Analysis | πΊπΈ π¨π³ | Medium | |
π | 2782 | Number of Unique Categories | πΊπΈ π¨π³ | Medium | |
βοΈ | 2781 | Length of the Longest Valid Substring | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2780 | Minimum Index of a Valid Split | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2779 | Maximum Beauty of an Array After Applying Operation | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2778 | Sum of Squares of Special Elements | πΊπΈ π¨π³ | py | Easy |
π | 2777 | Date Range Generator | πΊπΈ π¨π³ | Medium | |
π | 2776 | Convert Callback Based Function to Promise Based Function | πΊπΈ π¨π³ | Medium | |
π | 2775 | Undefined to Null | πΊπΈ π¨π³ | Medium | |
π | 2774 | Array Upper Bound | πΊπΈ π¨π³ | Easy | |
π | 2773 | Height of Special Binary Tree | πΊπΈ π¨π³ | Medium | |
2772 | Apply Operations to Make All Array Elements Equal to Zero | πΊπΈ π¨π³ | Medium | ||
2771 | Longest Non-decreasing Subarray From Two Arrays | πΊπΈ π¨π³ | Medium | ||
2770 | Maximum Number of Jumps to Reach the Last Index | πΊπΈ π¨π³ | Medium | ||
2769 | Find the Maximum Achievable Number | πΊπΈ π¨π³ | Easy | ||
2768 | Number of Black Blocks | πΊπΈ π¨π³ | Medium | ||
2767 | Partition String Into Minimum Beautiful Substrings | πΊπΈ π¨π³ | Medium | ||
2766 | Relocate Marbles | πΊπΈ π¨π³ | Medium | ||
2765 | Longest Alternating Subarray | πΊπΈ π¨π³ | Easy | ||
π | 2764 | is Array a Preorder of Some βBinary Tree | πΊπΈ π¨π³ | Medium | |
2763 | Sum of Imbalance Numbers of All Subarrays | πΊπΈ π¨π³ | Hard | ||
2762 | Continuous Subarrays | πΊπΈ π¨π³ | Medium | ||
βοΈ | 2761 | Prime Pairs With Target Sum | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2760 | Longest Even Odd Subarray With Threshold | πΊπΈ π¨π³ | java | Easy |
π | 2759 | Convert JSON String to Object | πΊπΈ π¨π³ | Hard | |
π | 2758 | Next Day | πΊπΈ π¨π³ | Easy | |
π | 2757 | Generate Circular Array Values | πΊπΈ π¨π³ | Medium | |
π | 2756 | Query Batching | πΊπΈ π¨π³ | Hard | |
π | 2755 | Deep Merge of Two Objects | πΊπΈ π¨π³ | Medium | |
π | 2754 | Bind Function to Context | πΊπΈ π¨π³ | Medium | |
π | 2753 | Count Houses in a Circular Street II | πΊπΈ π¨π³ | Hard | |
π sql | 2752 | Customers with Maximum Number of Transactions on Consecutive Days | πΊπΈ π¨π³ | Hard | |
βοΈ | 2751 | Robot Collisions | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2750 | Ways to Split Array Into Good Subarrays | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2749 | Minimum Operations to Make the Integer Zero | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2748 | Number of Beautiful Pairs | πΊπΈ π¨π³ | py | Easy |
2747 | Count Zero Request Servers | πΊπΈ π¨π³ | Medium | ||
2746 | Decremental String Concatenation | πΊπΈ π¨π³ | Medium | ||
2745 | Construct the Longest New String | πΊπΈ π¨π³ | Medium | ||
2744 | Find Maximum Number of String Pairs | πΊπΈ π¨π³ | Easy | ||
π | 2743 | Count Substrings Without Repeating Character | πΊπΈ π¨π³ | Medium | |
βοΈ | 2742 | Painting the Walls | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2741 | Special Permutations | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2740 | Find the Value of the Partition | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2739 | Total Distance Traveled | πΊπΈ π¨π³ | java | Easy |
π sql | 2738 | Count Occurrences in Text | πΊπΈ π¨π³ | Medium | |
π | 2737 | Find the Closest Marked Node | πΊπΈ π¨π³ | Medium | |
βοΈ | 2736 | Maximum Sum Queries | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2735 | Collecting Chocolates | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2734 | Lexicographically Smallest String After Substring Operation | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2733 | Neither Minimum nor Maximum | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2732 | Find a Good Subset of the Matrix | πΊπΈ π¨π³ | py, py | Hard |
βοΈ | 2731 | Movement of Robots | πΊπΈ π¨π³ | rb | Medium |
βοΈ | 2730 | Find the Longest Semi-Repetitive Substring | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2729 | Check if The Number is Fascinating | πΊπΈ π¨π³ | py | Easy |
π | 2728 | Count Houses in a Circular Street | πΊπΈ π¨π³ | Easy | |
2727 | Is Object Empty | πΊπΈ π¨π³ | Easy | ||
2726 | Calculator with Method Chaining | πΊπΈ π¨π³ | Easy | ||
2725 | Interval Cancellation | πΊπΈ π¨π³ | Easy | ||
2724 | Sort By | πΊπΈ π¨π³ | Easy | ||
2723 | Add Two Promises | πΊπΈ π¨π³ | Easy | ||
2722 | Join Two Arrays by ID | πΊπΈ π¨π³ | Medium | ||
2721 | Execute Asynchronous Functions in Parallel | πΊπΈ π¨π³ | Medium | ||
π sql | 2720 | Popularity Percentage | πΊπΈ π¨π³ | Hard | |
βοΈ | 2719 | Count of Integers | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2718 | Sum of Matrix After Queries | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2717 | Semi-Ordered Permutation | πΊπΈ π¨π³ | rb | Easy |
βοΈ | 2716 | Minimize String Length | πΊπΈ π¨π³ | rb | Easy |
βοΈ | 2715 | Timeout Cancellation | πΊπΈ π¨π³ | ts | Easy |
π | 2714 | Find Shortest Path with K Hops | πΊπΈ π¨π³ | Hard | |
2713 | Maximum Strictly Increasing Cells in a Matrix | πΊπΈ π¨π³ | Hard | ||
2712 | Minimum Cost to Make All Characters Equal | πΊπΈ π¨π³ | Medium | ||
2711 | Difference of Number of Distinct Values on Diagonals | πΊπΈ π¨π³ | Medium | ||
2710 | Remove Trailing Zeros From a String | πΊπΈ π¨π³ | Easy | ||
2709 | Greatest Common Divisor Traversal | πΊπΈ π¨π³ | Hard | ||
2708 | Maximum Strength of a Group | πΊπΈ π¨π³ | Medium | ||
2707 | Extra Characters in a String | πΊπΈ π¨π³ | Medium | ||
2706 | Buy Two Chocolates | πΊπΈ π¨π³ | Easy | ||
2705 | Compact Object | πΊπΈ π¨π³ | Medium | ||
2704 | To Be Or Not To Be | πΊπΈ π¨π³ | Easy | ||
2703 | Return Length of Arguments Passed | πΊπΈ π¨π³ | Easy | ||
π | 2702 | Minimum Operations to Make Numbers Non-positive | πΊπΈ π¨π³ | Hard | |
π sql | 2701 | Consecutive Transactions with Increasing Amounts | πΊπΈ π¨π³ | Hard | |
π | 2700 | Differences Between Two Objects | πΊπΈ π¨π³ | Medium | |
2699 | Modify Graph Edge Weights | πΊπΈ π¨π³ | Hard | ||
2698 | Find the Punishment Number of an Integer | πΊπΈ π¨π³ | Medium | ||
2697 | Lexicographically Smallest Palindrome | πΊπΈ π¨π³ | Easy | ||
2696 | Minimum String Length After Removing Substrings | πΊπΈ π¨π³ | Easy | ||
2695 | Array Wrapper | πΊπΈ π¨π³ | Easy | ||
2694 | Event Emitter | πΊπΈ π¨π³ | Medium | ||
2693 | Call Function with Custom Context | πΊπΈ π¨π³ | Medium | ||
π | 2692 | Make Object Immutable | πΊπΈ π¨π³ | Medium | |
π | 2691 | Immutability Helper | πΊπΈ π¨π³ | Hard | |
π | 2690 | Infinite Method Object | πΊπΈ π¨π³ | Easy | |
π | 2689 | Extract Kth Character From The Rope Tree | πΊπΈ π¨π³ | Easy | |
π sql | 2688 | Find Active Users | πΊπΈ π¨π³ | Medium | |
π sql | 2687 | Bikes Last Time Used | πΊπΈ π¨π³ | Easy | |
π sql | 2686 | Immediate Food Delivery III | πΊπΈ π¨π³ | Medium | |
βοΈ | 2685 | Count the Number of Complete Components | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2684 | Maximum Number of Moves in a Grid | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2683 | Neighboring Bitwise XOR | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2682 | Find the Losers of the Circular Game | πΊπΈ π¨π³ | php | Easy |
2681 | Power of Heroes | πΊπΈ π¨π³ | Hard | ||
2680 | Maximum OR | πΊπΈ π¨π³ | Medium | ||
βοΈ | 2679 | Sum in a Matrix | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2678 | Number of Senior Citizens | πΊπΈ π¨π³ | c | Easy |
βοΈ | 2677 | Chunk Array | πΊπΈ π¨π³ | ts | Easy |
π | 2676 | Throttle | πΊπΈ π¨π³ | Medium | |
π | 2675 | Array of Objects to Matrix | πΊπΈ π¨π³ | Hard | |
π | 2674 | Split a Circular Linked List | πΊπΈ π¨π³ | Medium | |
βοΈ | 2673 | Make Costs of Paths Equal in a Binary Tree | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2672 | Number of Adjacent Elements With the Same Color | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2671 | Frequency Tracker | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2670 | Find the Distinct Difference Array | πΊπΈ π¨π³ | py | Easy |
π sql | 2669 | Count Artist Occurrences On Spotify Ranking List | πΊπΈ π¨π³ | Easy | |
π sql | 2668 | Find Latest Salaries | πΊπΈ π¨π³ | Easy | |
2667 | Create Hello World Function | πΊπΈ π¨π³ | Easy | ||
2666 | Allow One Function Call | πΊπΈ π¨π³ | Easy | ||
2665 | Counter II | πΊπΈ π¨π³ | Easy | ||
π | 2664 | The Knightβs Tour | πΊπΈ π¨π³ | Medium | |
2663 | Lexicographically Smallest Beautiful String | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2662 | Minimum Cost of a Path With Special Roads | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2661 | First Completely Painted Row or Column | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2660 | Determine the Winner of a Bowling Game | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2659 | Make Array Empty | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2658 | Maximum Number of Fish in a Grid | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2657 | Find the Prefix Common Array of Two Arrays | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2656 | Maximum Sum With Exactly K Elements | πΊπΈ π¨π³ | ts | Easy |
π | 2655 | Find Maximal Uncovered Ranges | πΊπΈ π¨π³ | Medium | |
βοΈ | 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2653 | Sliding Subarray Beauty | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2652 | Sum Multiples | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2651 | Calculate Delayed Arrival Time | πΊπΈ π¨π³ | c | Easy |
βοΈ | 2650 | Design Cancellable Function | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2649 | Nested Array Generator | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2648 | Generate Fibonacci Sequence | πΊπΈ π¨π³ | ts | Easy |
π | 2647 | Color the Triangle Red | πΊπΈ π¨π³ | Hard | |
βοΈ | 2646 | Minimize the Total Price of the Trips | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2645 | Minimum Additions to Make Valid String | πΊπΈ π¨π³ | c, py | Medium |
βοΈ | 2644 | Find the Maximum Divisibility Score | πΊπΈ π¨π³ | rb | Easy |
βοΈ | 2643 | Row With Maximum Ones | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2642 | Design Graph With Shortest Path Calculator | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2641 | Cousins in Binary Tree II | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2640 | Find the Score of All Prefixes of an Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2639 | Find the Width of Columns of a Grid | πΊπΈ π¨π³ | ts | Easy |
π | 2638 | Count the Number of K-Free Subsets | πΊπΈ π¨π³ | Medium | |
βοΈ | 2637 | Promise Time Limit | πΊπΈ π¨π³ | ts | Medium |
βοΈπ | 2636 | Promise Pool | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2635 | Apply Transform Over Each Element in Array | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2634 | Filter Elements from Array | πΊπΈ π¨π³ | ts | Easy |
βοΈπ | 2633 | Convert Object to JSON String | πΊπΈ π¨π³ | ts | Medium |
βοΈπ | 2632 | Curry | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2631 | Group By | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2630 | Memoize II | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2629 | Function Composition | πΊπΈ π¨π³ | ts | Easy |
βοΈπ | 2628 | JSON Deep Equal | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2627 | Debounce | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2626 | Array Reduce Transformation | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2625 | Flatten Deeply Nested Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2624 | Snail Traversal | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2623 | Memoize | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2622 | Cache With Time Limit | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2621 | Sleep | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2620 | Counter | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2619 | Array Prototype Last | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2618 | Check if Object Instance of Class | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2617 | Minimum Number of Visited Cells in a Grid | πΊπΈ π¨π³ | py, py | Hard |
βοΈ | 2616 | Minimize the Maximum Difference of Pairs | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2615 | Sum of Distances | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2614 | Prime In Diagonal | πΊπΈ π¨π³ | py | Easy |
π | 2613 | Beautiful Pairs | πΊπΈ π¨π³ | Hard | |
2612 | Minimum Reverse Operations | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2611 | Mice and Cheese | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2610 | Convert an Array Into a 2D Array With Conditions | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2609 | Find the Longest Balanced Substring of a Binary String | πΊπΈ π¨π³ | py | Easy |
2608 | Shortest Cycle in a Graph | πΊπΈ π¨π³ | Hard | ||
2607 | Make K-Subarray Sums Equal | πΊπΈ π¨π³ | Medium | ||
2606 | Find the Substring With Maximum Cost | πΊπΈ π¨π³ | Medium | ||
2605 | Form Smallest Number From Two Digit Arrays | πΊπΈ π¨π³ | Easy | ||
π | 2604 | Minimum Time to Eat All Grains | πΊπΈ π¨π³ | Hard | |
βοΈ | 2603 | Collect Coins in a Tree | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2602 | Minimum Operations to Make All Array Elements Equal | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2601 | Prime Subtraction Operation | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2600 | K Items With the Maximum Sum | πΊπΈ π¨π³ | c | Easy |
π | 2599 | Make the Prefix Sum Non-negative | πΊπΈ π¨π³ | Medium | |
βοΈ | 2598 | Smallest Missing Non-negative Integer After Operations | πΊπΈ π¨π³ | rb | Medium |
βοΈ | 2597 | The Number of Beautiful Subsets | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2596 | Check Knight Tour Configuration | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2595 | Number of Even and Odd Bits | πΊπΈ π¨π³ | java | Easy |
βοΈ | 2594 | Minimum Time to Repair Cars | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2593 | Find Score of an Array After Marking All Elements | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2592 | Maximize Greatness of an Array | πΊπΈ π¨π³ | php | Medium |
βοΈ | 2591 | Distribute Money to Maximum Children | πΊπΈ π¨π³ | c | Easy |
π | 2590 | Design a Todo List | πΊπΈ π¨π³ | Medium | |
βοΈ | 2589 | Minimum Time to Complete All Tasks | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2588 | Count the Number of Beautiful Subarrays | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2587 | Rearrange Array to Maximize Prefix Score | πΊπΈ π¨π³ | cpp | Medium |
βοΈ | 2586 | Count the Number of Vowel Strings in Range | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2585 | Number of Ways to Earn Points | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2584 | Split the Array to Make Coprime Products | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2583 | Kth Largest Sum in a Binary Tree | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2582 | Pass the Pillow | πΊπΈ π¨π³ | ts | Easy |
2581 | Count Number of Possible Root Nodes | πΊπΈ π¨π³ | Hard | ||
2580 | Count Ways to Group Overlapping Ranges | πΊπΈ π¨π³ | Medium | ||
2579 | Count Total Number of Colored Cells | πΊπΈ π¨π³ | Medium | ||
2578 | Split With Minimum Sum | πΊπΈ π¨π³ | Easy | ||
βοΈ | 2577 | Minimum Time to Visit a Cell In a Grid | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2576 | Find the Maximum Number of Marked Indices | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2575 | Find the Divisibility Array of a String | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2574 | Left and Right Sum Differences | πΊπΈ π¨π³ | ts | Easy |
2573 | Find the String with LCP | πΊπΈ π¨π³ | Hard | ||
2572 | Count the Number of Square-Free Subsets | πΊπΈ π¨π³ | Medium | ||
2571 | Minimum Operations to Reduce an Integer to 0 | πΊπΈ π¨π³ | Medium | ||
2570 | Merge Two 2D Arrays by Summing Values | πΊπΈ π¨π³ | Easy | ||
2569 | Handling Sum Queries After Update | πΊπΈ π¨π³ | Hard | ||
2568 | Minimum Impossible OR | πΊπΈ π¨π³ | Medium | ||
2567 | Minimum Score by Changing Two Elements | πΊπΈ π¨π³ | Medium | ||
2566 | Maximum Difference by Remapping a Digit | πΊπΈ π¨π³ | Easy | ||
βοΈ | 2565 | Subsequence With the Minimum Score | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2564 | Substring XOR Queries | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2563 | Count the Number of Fair Pairs | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2562 | Find the Array Concatenation Value | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2561 | Rearranging Fruits | πΊπΈ π¨π³ | py, ts | Hard |
βοΈ | 2560 | House Robber IV | πΊπΈ π¨π³ | ts | Medium |
βοΈβ | 2559 | Count Vowel Strings in Ranges | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2558 | Take Gifts From the Richest Pile | πΊπΈ π¨π³ | py | Easy |
π | 2557 | Maximum Number of Integers to Choose From a Range II | πΊπΈ π¨π³ | Medium | |
2556 | Disconnect Path in a Binary Matrix by at Most One Flip | πΊπΈ π¨π³ | Medium | ||
2555 | Maximize Win From Two Segments | πΊπΈ π¨π³ | Medium | ||
βοΈ | 2554 | Maximum Number of Integers to Choose From a Range I | πΊπΈ π¨π³ | rb | Medium |
βοΈ | 2553 | Separate the Digits in an Array | πΊπΈ π¨π³ | ts | Easy |
2552 | Count Increasing Quadruplets | πΊπΈ π¨π³ | Hard | ||
2551 | Put Marbles in Bags | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2550 | Count Collisions of Monkeys on a Polygon | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2549 | Count Distinct Numbers on Board | πΊπΈ π¨π³ | php | Easy |
π | 2548 | Maximum Price to Fill a Bag | πΊπΈ π¨π³ | Medium | |
2547 | Minimum Cost to Split an Array | πΊπΈ π¨π³ | Hard | ||
2546 | Apply Bitwise Operations to Make Strings Equal | πΊπΈ π¨π³ | Medium | ||
2545 | Sort the Students by Their Kth Score | πΊπΈ π¨π³ | Medium | ||
βοΈ | 2544 | Alternating Digit Sum | πΊπΈ π¨π³ | php | Easy |
βοΈβ | 2543 | Check if Point Is Reachable | πΊπΈ π¨π³ | php | Hard |
βοΈ | 2542 | Maximum Subsequence Score | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2541 | Minimum Operations to Make Array Equal II | πΊπΈ π¨π³ | php | Medium |
βοΈ | 2540 | Minimum Common Value | πΊπΈ π¨π³ | php | Easy |
π | 2539 | Count the Number of Good Subsequences | πΊπΈ π¨π³ | Medium | |
2538 | Difference Between Maximum and Minimum Price Sum | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2537 | Count the Number of Good Subarrays | πΊπΈ π¨π³ | php | Medium |
βοΈ | 2536 | Increment Submatrices by One | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2535 | Difference Between Element Sum and Digit Sum of an Array | πΊπΈ π¨π³ | php | Easy |
π | 2534 | Time Taken to Cross the Door | πΊπΈ π¨π³ | Hard | |
π | 2533 | Number of Good Binary Strings | πΊπΈ π¨π³ | Medium | |
βοΈ | 2532 | Time to Cross a Bridge | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2531 | Make Number of Distinct Characters Equal | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2530 | Maximal Score After Applying K Operations | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2529 | Maximum Count of Positive Integer and Negative Integer | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2528 | Maximize the Minimum Powered City | πΊπΈ π¨π³ | php | Hard |
βοΈ | 2527 | Find Xor-Beauty of Array | πΊπΈ π¨π³ | php | Medium |
βοΈ | 2526 | Find Consecutive Integers from a Data Stream | πΊπΈ π¨π³ | php, rb | Medium |
βοΈ | 2525 | Categorize Box According to Criteria | πΊπΈ π¨π³ | php | Easy |
π | 2524 | Maximum Frequency Score of a Subarray | πΊπΈ π¨π³ | Hard | |
βοΈ | 2523 | Closest Prime Numbers in Range | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2522 | Partition String Into Substrings With Values at Most K | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2521 | Distinct Prime Factors of Product of Array | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2520 | Count the Digits That Divide a Number | πΊπΈ π¨π³ | py | Easy |
π | 2519 | Count the Number of K-Big Indices | πΊπΈ π¨π³ | Hard | |
βοΈ | 2518 | Number of Great Partitions | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2517 | Maximum Tastiness of Candy Basket | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2516 | Take K of Each Character From Left and Right | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2515 | Shortest Distance to Target String in a Circular Array | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2514 | Count Anagrams | πΊπΈ π¨π³ | rb | Hard |
2513 | Minimize the Maximum of Two Arrays | πΊπΈ π¨π³ | Medium | ||
βοΈ | 2512 | Reward Top K Students | πΊπΈ π¨π³ | rb | Medium |
βοΈ | 2511 | Maximum Enemy Forts That Can Be Captured | πΊπΈ π¨π³ | java | Easy |
π | 2510 | Check if There is a Path With Equal Number of 0's And 1's | πΊπΈ π¨π³ | Medium | |
βοΈ | 2509 | Cycle Length Queries in a Tree | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2508 | Add Edges to Make Degrees of All Nodes Even | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2507 | Smallest Value After Replacing With Sum of Prime Factors | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2506 | Count Pairs Of Similar Strings | πΊπΈ π¨π³ | ts | Easy |
π | 2505 | Bitwise OR of All Subsequence Sums | πΊπΈ π¨π³ | Medium | |
π sql | 2504 | Concatenate the Name and the Profession | πΊπΈ π¨π³ | Easy | |
βοΈ | 2503 | Maximum Number of Points From Grid Queries | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2502 | Design Memory Allocator | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2501 | Longest Square Streak in an Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2500 | Delete Greatest Value in Each Row | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2499 | Minimum Total Cost to Make Arrays Unequal | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2498 | Frog Jump II | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2497 | Maximum Star Sum of a Graph | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2496 | Maximum Value of a String in an Array | πΊπΈ π¨π³ | ts | Easy |
π | 2495 | Number of Subarrays Having Even Product | πΊπΈ π¨π³ | Medium | |
π sql | 2494 | Merge Overlapping Events in the Same Hall | πΊπΈ π¨π³ | Hard | |
βοΈ | 2493 | Divide Nodes Into the Maximum Number of Groups | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2492 | Minimum Score of a Path Between Two Cities | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2491 | Divide Players Into Teams of Equal Skill | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2490 | Circular Sentence | πΊπΈ π¨π³ | py | Easy |
π | 2489 | Number of Substrings With Fixed Ratio | πΊπΈ π¨π³ | Medium | |
βοΈ | 2488 | Count Subarrays With Median K | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2487 | Remove Nodes From Linked List | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2486 | Append Characters to String to Make Subsequence | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2485 | Find the Pivot Integer | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2484 | Count Palindromic Subsequences | πΊπΈ π¨π³ | py, ts | Hard |
βοΈ | 2483 | Minimum Penalty for a Shop | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2482 | Difference Between Ones and Zeros in Row and Column | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2481 | Minimum Cuts to Divide a Circle | πΊπΈ π¨π³ | ts | Easy |
π sql | 2480 | Form a Chemical Bond | πΊπΈ π¨π³ | Easy | |
π | 2479 | Maximum XOR of Two Non-Overlapping Subtrees | πΊπΈ π¨π³ | Hard | |
βοΈ | 2478 | Number of Beautiful Partitions | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2477 | Minimum Fuel Cost to Report to the Capital | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2476 | Closest Nodes Queries in a Binary Search Tree | πΊπΈ π¨π³ | py, ts | Medium |
βοΈ | 2475 | Number of Unequal Triplets in Array | πΊπΈ π¨π³ | py | Easy |
π sql | 2474 | Customers With Strictly Increasing Purchases | πΊπΈ π¨π³ | Hard | |
π | 2473 | Minimum Cost to Buy Apples | πΊπΈ π¨π³ | Medium | |
βοΈ | 2472 | Maximum Number of Non-overlapping Palindrome Substrings | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2470 | Number of Subarrays With LCM Equal to K | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2469 | Convert the Temperature | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2468 | Split Message Based on Limit | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2467 | Most Profitable Path in a Tree | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2466 | Count Ways To Build Good Strings | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2465 | Number of Distinct Averages | πΊπΈ π¨π³ | ts | Easy |
π | 2464 | Minimum Subarrays in a Valid Split | πΊπΈ π¨π³ | Medium | |
2463 | Minimum Total Distance Traveled | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2462 | Total Cost to Hire K Workers | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2461 | Maximum Sum of Distinct Subarrays With Length K | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2460 | Apply Operations to an Array | πΊπΈ π¨π³ | ts | Easy |
π | 2459 | Sort Array by Moving Items to Empty Space | πΊπΈ π¨π³ | Hard | |
βοΈ | 2458 | Height of Binary Tree After Subtree Removal Queries | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2457 | Minimum Addition to Make Integer Beautiful | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2456 | Most Popular Video Creator | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2455 | Average Value of Even Numbers That Are Divisible by Three | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2454 | Next Greater Element IV | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2453 | Destroy Sequential Targets | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2452 | Words Within Two Edits of Dictionary | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2451 | Odd String Difference | πΊπΈ π¨π³ | ts | Easy |
π | 2450 | Number of Distinct Binary Strings After Applying Operations | πΊπΈ π¨π³ | Medium | |
βοΈ | 2449 | Minimum Number of Operations to Make Arrays Similar | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2448 | Minimum Cost to Make Array Equal | πΊπΈ π¨π³ | c, py | Hard |
βοΈ | 2447 | Number of Subarrays With GCD Equal to K | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2446 | Determine if Two Events Have Conflict | πΊπΈ π¨π³ | ts | Easy |
π | 2445 | Number of Nodes With Value One | πΊπΈ π¨π³ | Medium | |
βοΈ | 2444 | Count Subarrays With Fixed Bounds | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2443 | Sum of Number and Its Reverse | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2442 | Count Number of Distinct Integers After Reverse Operations | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2441 | Largest Positive Integer That Exists With Its Negative | πΊπΈ π¨π³ | py | Easy |
2440 | Create Components With Same Value | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2439 | Minimize Maximum of Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2438 | Range Product Queries of Powers | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2437 | Number of Valid Clock Times | πΊπΈ π¨π³ | ts | Easy |
π | 2436 | Minimum Split Into Subarrays With GCD Greater Than One | πΊπΈ π¨π³ | Medium | |
βοΈ | 2435 | Paths in Matrix Whose Sum Is Divisible by K | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2434 | Using a Robot to Print the Lexicographically Smallest String | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2433 | Find The Original Array of Prefix Xor | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2432 | The Employee That Worked on the Longest Task | πΊπΈ π¨π³ | ts | Easy |
π | 2431 | Maximize Total Tastiness of Purchased Fruits | πΊπΈ π¨π³ | Medium | |
βοΈ | 2430 | Maximum Deletions on a String | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2429 | Minimize XOR | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2428 | Maximum Sum of an Hourglass | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2427 | Number of Common Factors | πΊπΈ π¨π³ | c | Easy |
βοΈ | 2426 | Number of Pairs Satisfying Inequality | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2425 | Bitwise XOR of All Pairings | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2424 | Longest Uploaded Prefix | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2423 | Remove Letter To Equalize Frequency | πΊπΈ π¨π³ | py | Easy |
π | 2422 | Merge Operations to Turn Array Into a Palindrome | πΊπΈ π¨π³ | Medium | |
βοΈ | 2421 | Number of Good Paths | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2420 | Find All Good Indices | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2419 | Longest Subarray With Maximum Bitwise AND | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2418 | Sort the People | πΊπΈ π¨π³ | py | Easy |
π | 2417 | Closest Fair Integer | πΊπΈ π¨π³ | Medium | |
βοΈ | 2416 | Sum of Prefix Scores of Strings | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2415 | Reverse Odd Levels of Binary Tree | πΊπΈ π¨π³ | py, ts | Medium |
βοΈ | 2414 | Length of the Longest Alphabetical Continuous Substring | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2413 | Smallest Even Multiple | πΊπΈ π¨π³ | cpp | Easy |
βοΈ | 2412 | Minimum Money Required Before Transactions | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2411 | Smallest Subarrays With Maximum Bitwise OR | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2410 | Maximum Matching of Players With Trainers | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2409 | Count Days Spent Together | πΊπΈ π¨π³ | c | Easy |
π | 2408 | Design SQL | πΊπΈ π¨π³ | Medium | |
βοΈβ | 2407 | Longest Increasing Subsequence II | πΊπΈ π¨π³ | java | Hard |
βοΈ | 2406 | Divide Intervals Into Minimum Number of Groups | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2405 | Optimal Partition of String | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2404 | Most Frequent Even Element | πΊπΈ π¨π³ | py | Easy |
π | 2403 | Minimum Time to Kill All Monsters | πΊπΈ π¨π³ | Hard | |
βοΈ | 2402 | Meeting Rooms III | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2401 | Longest Nice Subarray | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2400 | Number of Ways to Reach a Position After Exactly k Steps | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2399 | Check Distances Between Same Letters | πΊπΈ π¨π³ | java | Easy |
βοΈ | 2398 | Maximum Number of Robots Within Budget | πΊπΈ π¨π³ | java | Hard |
βοΈ | 2397 | Maximum Rows Covered by Columns | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2396 | Strictly Palindromic Number | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2395 | Find Subarrays With Equal Sum | πΊπΈ π¨π³ | java | Easy |
π sql | 2394 | Employees With Deductions | πΊπΈ π¨π³ | Medium | |
π | 2393 | Count Strictly Increasing Subarrays | πΊπΈ π¨π³ | Medium | |
βοΈ | 2392 | Build a Matrix With Conditions | πΊπΈ π¨π³ | java | Hard |
βοΈ | 2391 | Minimum Amount of Time to Collect Garbage | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2390 | Removing Stars From a String | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2389 | Longest Subsequence With Limited Sum | πΊπΈ π¨π³ | py | Easy |
π sql | 2388 | Change Null Values in a Table to the Previous Value | πΊπΈ π¨π³ | Medium | |
π | 2387 | Median of a Row Wise Sorted Matrix | πΊπΈ π¨π³ | Medium | |
βοΈ | 2386 | Find the K-Sum of an Array | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2385 | Amount of Time for Binary Tree to Be Infected | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2384 | Largest Palindromic Number | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2383 | Minimum Hours of Training to Win a Competition | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2382 | Maximum Segment Sum After Removals | πΊπΈ π¨π³ | py, ts | Hard |
βοΈ | 2381 | Shifting Letters II | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2380 | Time Needed to Rearrange a Binary String | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2379 | Minimum Recolors to Get K Consecutive Black Blocks | πΊπΈ π¨π³ | ts | Easy |
π | 2378 | Choose Edges to Maximize Score in a Tree | πΊπΈ π¨π³ | Medium | |
π sql | 2377 | Sort the Olympic Table | πΊπΈ π¨π³ | Easy | |
βοΈ | 2376 | Count Special Integers | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2375 | Construct Smallest Number From DI String | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2374 | Node With Highest Edge Score | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2373 | Largest Local Values in a Matrix | πΊπΈ π¨π³ | py | Easy |
π sql | 2372 | Calculate the Influence of Each Salesperson | πΊπΈ π¨π³ | Medium | |
π | 2371 | Minimize Maximum Value in a Grid | πΊπΈ π¨π³ | Hard | |
βοΈ | 2370 | Longest Ideal Subsequence | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2369 | Check if There is a Valid Partition For The Array | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2368 | Reachable Nodes With Restrictions | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2367 | Number of Arithmetic Triplets | πΊπΈ π¨π³ | ts, ts | Easy |
βοΈ | 2366 | Minimum Replacements to Sort the Array | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2365 | Task Scheduler II | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2364 | Count Number of Bad Pairs | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2363 | Merge Similar Items | πΊπΈ π¨π³ | ts | Easy |
π sql | 2362 | Generate the Invoice | πΊπΈ π¨π³ | Hard | |
π | 2361 | Minimum Costs Using the Train Line | πΊπΈ π¨π³ | Hard | |
βοΈ | 2360 | Longest Cycle in a Graph | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2359 | Find Closest Node to Given Two Nodes | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2358 | Maximum Number of Groups Entering a Competition | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2357 | Make Array Zero by Subtracting Equal Amounts | πΊπΈ π¨π³ | ts | Easy |
sql | 2356 | Number of Unique Subjects Taught by Each Teacher | πΊπΈ π¨π³ | Easy | |
π | 2355 | Maximum Number of Books You Can Take | πΊπΈ π¨π³ | Hard | |
βοΈ | 2354 | Number of Excellent Pairs | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2353 | Design a Food Rating System | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2352 | Equal Row and Column Pairs | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2351 | First Letter to Appear Twice | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2350 | Shortest Impossible Sequence of Rolls | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2349 | Design a Number Container System | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2348 | Number of Zero-Filled Subarrays | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2347 | Best Poker Hand | πΊπΈ π¨π³ | ts | Easy |
π sql | 2346 | Compute the Rank as a Percentage | πΊπΈ π¨π³ | Medium | |
π | 2345 | Finding the Number of Visible Mountains | πΊπΈ π¨π³ | Medium | |
βοΈ | 2344 | Minimum Deletions to Make Array Divisible | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2343 | Query Kth Smallest Trimmed Number | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2342 | Max Sum of a Pair With Equal Sum of Digits | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2341 | Maximum Number of Pairs in Array | πΊπΈ π¨π³ | py | Easy |
π | 2340 | Minimum Adjacent Swaps to Make a Valid Array | πΊπΈ π¨π³ | Medium | |
π sql | 2339 | All the Matches of the League | πΊπΈ π¨π³ | Easy | |
2338 | Count the Number of Ideal Arrays | πΊπΈ π¨π³ | Hard | ||
2337 | Move Pieces to Obtain a String | πΊπΈ π¨π³ | Medium | ||
2336 | Smallest Number in Infinite Set | πΊπΈ π¨π³ | Medium | ||
2335 | Minimum Amount of Time to Fill Cups | πΊπΈ π¨π³ | Easy | ||
βοΈ | 2334 | Subarray With Elements Greater Than Varying Threshold | πΊπΈ π¨π³ | c, py | Hard |
βοΈ | 2333 | Minimum Sum of Squared Difference | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2332 | The Latest Time to Catch a Bus | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2331 | Evaluate Boolean Binary Tree | πΊπΈ π¨π³ | c | Easy |
π | 2330 | Valid Palindrome IV | πΊπΈ π¨π³ | Medium | |
π sql | 2329 | Product Sales Analysis V | πΊπΈ π¨π³ | Easy | |
βοΈ | 2328 | Number of Increasing Paths in a Grid | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2327 | Number of People Aware of a Secret | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2326 | Spiral Matrix IV | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2325 | Decode the Message | πΊπΈ π¨π³ | ts | Easy |
π sql | 2324 | Product Sales Analysis IV | πΊπΈ π¨π³ | Medium | |
π | 2323 | Find Minimum Time to Finish All Jobs II | πΊπΈ π¨π³ | Medium | |
2322 | Minimum Score After Removals on a Tree | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2321 | Maximum Score Of Spliced Array | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2320 | Count Number of Ways to Place Houses | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2319 | Check if Matrix Is X-Matrix | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2318 | Number of Distinct Roll Sequences | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2317 | Maximum XOR After Operations | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2315 | Count Asterisks | πΊπΈ π¨π³ | ts | Easy |
π sql | 2314 | The First Day of the Maximum Recorded Degree in Each City | πΊπΈ π¨π³ | Medium | |
π | 2313 | Minimum Flips in Binary Tree to Get Result | πΊπΈ π¨π³ | Hard | |
βοΈ | 2312 | Selling Pieces of Wood | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2311 | Longest Binary Subsequence Less Than or Equal to K | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2310 | Sum of Numbers With Units Digit K | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2309 | Greatest English Letter in Upper and Lower Case | πΊπΈ π¨π³ | py | Easy |
π sql | 2308 | Arrange Table by Gender | πΊπΈ π¨π³ | Medium | |
π | 2307 | Check for Contradictions in Equations | πΊπΈ π¨π³ | Hard | |
βοΈ | 2306 | Naming a Company | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2305 | Fair Distribution of Cookies | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2304 | Minimum Path Cost in a Grid | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2303 | Calculate Amount Paid in Taxes | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2302 | Count Subarrays With Score Less Than K | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2301 | Match Substring After Replacement | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2300 | Successful Pairs of Spells and Potions | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2299 | Strong Password Checker II | πΊπΈ π¨π³ | ts | Easy |
π sql | 2298 | Tasks Count in the Weekend | πΊπΈ π¨π³ | Medium | |
π | 2297 | Jump Game VIII | πΊπΈ π¨π³ | Medium | |
βοΈ | 2296 | Design a Text Editor | πΊπΈ π¨π³ | java | Hard |
βοΈ | 2295 | Replace Elements in an Array | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2294 | Partition Array Such That Maximum Difference Is K | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2293 | Min Max Game | πΊπΈ π¨π³ | ts | Easy |
π sql | 2292 | Products With Three or More Orders in Two Consecutive Years | πΊπΈ π¨π³ | Medium | |
π | 2291 | Maximum Profit From Trading Stocks | πΊπΈ π¨π³ | Medium | |
βοΈ | 2290 | Minimum Obstacle Removal to Reach Corner | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2289 | Steps to Make Array Non-decreasing | πΊπΈ π¨π³ | js, py | Medium |
βοΈ | 2288 | Apply Discount to Prices | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2287 | Rearrange Characters to Make Target String | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2286 | Booking Concert Tickets in Groups | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2285 | Maximum Total Importance of Roads | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2284 | Sender With Largest Word Count | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2283 | Check if Number Has Equal Digit Count and Digit Value | πΊπΈ π¨π³ | py | Easy |
π | 2282 | Number of People That Can Be Seen in a Grid | πΊπΈ π¨π³ | Medium | |
βοΈ | 2281 | Sum of Total Strength of Wizards | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2280 | Minimum Lines to Represent a Line Chart | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2279 | Maximum Bags With Full Capacity of Rocks | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2278 | Percentage of Letter in String | πΊπΈ π¨π³ | py | Easy |
π | 2277 | Closest Node to Path in Tree | πΊπΈ π¨π³ | Hard | |
βοΈ | 2276 | Count Integers in Intervals | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2275 | Largest Combination With Bitwise AND Greater Than Zero | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2274 | Maximum Consecutive Floors Without Special Floors | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2273 | Find Resultant Array After Removing Anagrams | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2272 | Substring With Largest Variance | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2271 | Maximum White Tiles Covered by a Carpet | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2270 | Number of Ways to Split Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2269 | Find the K-Beauty of a Number | πΊπΈ π¨π³ | ts | Easy |
π | 2268 | Minimum Number of Keypresses | πΊπΈ π¨π³ | Medium | |
βοΈ | 2267 | Check if There Is a Valid Parentheses String Path | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2266 | Count Number of Texts | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2265 | Count Nodes Equal to Average of Subtree | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2264 | Largest 3-Same-Digit Number in String | πΊπΈ π¨π³ | py | Easy |
π | 2263 | Make Array Non-decreasing or Non-increasing | πΊπΈ π¨π³ | Hard | |
βοΈ | 2262 | Total Appeal of A String | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2261 | K Divisible Elements Subarrays | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2260 | Minimum Consecutive Cards to Pick Up | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2259 | Remove Digit From Number to Maximize Result | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2258 | Escape the Spreading Fire | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2257 | Count Unguarded Cells in the Grid | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2256 | Minimum Average Difference | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2255 | Count Prefixes of a Given String | πΊπΈ π¨π³ | ts | Easy |
π | 2254 | Design Video Sharing Platform | πΊπΈ π¨π³ | Hard | |
π sql | 2253 | Dynamic Unpivoting of a Table | πΊπΈ π¨π³ | Hard | |
π sql | 2252 | Dynamic Pivoting of a Table | πΊπΈ π¨π³ | Hard | |
βοΈ | 2251 | Number of Flowers in Full Bloom | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2250 | Count Number of Rectangles Containing Each Point | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2249 | Count Lattice Points Inside a Circle | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2248 | Intersection of Multiple Arrays | πΊπΈ π¨π³ | py | Easy |
π | 2247 | Maximum Cost of Trip With K Highways | πΊπΈ π¨π³ | Hard | |
βοΈ | 2246 | Longest Path With Different Adjacent Characters | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2245 | Maximum Trailing Zeros in a Cornered Path | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2244 | Minimum Rounds to Complete All Tasks | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2243 | Calculate Digit Sum of a String | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2242 | Maximum Score of a Node Sequence | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2241 | Design an ATM Machine | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2240 | Number of Ways to Buy Pens and Pencils | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2239 | Find Closest Number to Zero | πΊπΈ π¨π³ | ts | Easy |
π sql | 2238 | Number of Times a Driver Was a Passenger | πΊπΈ π¨π³ | Medium | |
π | 2237 | Count Positions on Street With Required Brightness | πΊπΈ π¨π³ | Medium | |
βοΈ | 2236 | Root Equals Sum of Children | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2235 | Add Two Integers | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2234 | Maximum Total Beauty of the Gardens | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2233 | Maximum Product After K Increments | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2232 | Minimize Result by Adding Parentheses to Expression | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2231 | Largest Number After Digit Swaps by Parity | πΊπΈ π¨π³ | ts | Easy |
π sql | 2230 | The Users That Are Eligible for Discount | πΊπΈ π¨π³ | Easy | |
π | 2229 | Check if an Array Is Consecutive | πΊπΈ π¨π³ | Easy | |
π sql | 2228 | Users With Two Purchases Within Seven Days | πΊπΈ π¨π³ | Medium | |
βοΈ | 2227 | Encrypt and Decrypt Strings | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2226 | Maximum Candies Allocated to K Children | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2225 | Find Players With Zero or One Losses | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2224 | Minimum Number of Operations to Convert Time | πΊπΈ π¨π³ | py | Easy |
2223 | Sum of Scores of Built Strings | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2222 | Number of Ways to Select Buildings | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2221 | Find Triangular Sum of an Array | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2220 | Minimum Bit Flips to Convert Number | πΊπΈ π¨π³ | ts | Easy |
βοΈπ | 2219 | Maximum Sum Score of Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2218 | Maximum Value of K Coins From Piles | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2217 | Find Palindrome With Fixed Length | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2216 | Minimum Deletions to Make Array Beautiful | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2215 | Find the Difference of Two Arrays | πΊπΈ π¨π³ | py | Easy |
π | 2214 | Minimum Health to Beat Game | πΊπΈ π¨π³ | Medium | |
βοΈ | 2213 | Longest Substring of One Repeating Character | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2212 | Maximum Points in an Archery Competition | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2211 | Count Collisions on a Road | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2210 | Count Hills and Valleys in an Array | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2209 | Minimum White Tiles After Covering With Carpets | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2208 | Minimum Operations to Halve Array Sum | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2207 | Maximize Number of Subsequences in a String | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2206 | Divide Array Into Equal Pairs | πΊπΈ π¨π³ | ts | Easy |
π sql | 2205 | The Number of Users That Are Eligible for Discount | πΊπΈ π¨π³ | Easy | |
π | 2204 | Distance to a Cycle in Undirected Graph | πΊπΈ π¨π³ | Hard | |
βοΈ | 2203 | Minimum Weighted Subgraph With the Required Paths | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2202 | Maximize the Topmost Element After K Moves | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2201 | Count Artifacts That Can Be Extracted | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2200 | Find All K-Distant Indices in an Array | πΊπΈ π¨π³ | ts | Easy |
π sql | 2199 | Finding the Topic of Each Post | πΊπΈ π¨π³ | Hard | |
π | 2198 | Number of Single Divisor Triplets | πΊπΈ π¨π³ | Medium | |
βοΈ | 2197 | Replace Non-Coprime Numbers in Array | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2196 | Create Binary Tree From Descriptions | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2195 | Append K Integers With Minimal Sum | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2194 | Cells in a Range on an Excel Sheet | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2193 | Minimum Number of Moves to Make Palindrome | πΊπΈ π¨π³ | ts, ts | Hard |
βοΈ | 2192 | All Ancestors of a Node in a Directed Acyclic Graph | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2191 | Sort the Jumbled Numbers | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2190 | Most Frequent Number Following Key In an Array | πΊπΈ π¨π³ | ts | Easy |
π | 2189 | Number of Ways to Build House of Cards | πΊπΈ π¨π³ | Medium | |
βοΈ | 2188 | Minimum Time to Finish the Race | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2187 | Minimum Time to Complete Trips | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2186 | Minimum Number of Steps to Make Two Strings Anagram II | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2185 | Counting Words With a Given Prefix | πΊπΈ π¨π³ | ts | Easy |
π | 2184 | Number of Ways to Build Sturdy Brick Wall | πΊπΈ π¨π³ | Medium | |
βοΈ | 2183 | Count Array Pairs Divisible by K | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2182 | Construct String With Repeat Limit | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2181 | Merge Nodes in Between Zeros | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2180 | Count Integers With Even Digit Sum | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2179 | Count Good Triplets in an Array | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2178 | Maximum Split of Positive Even Integers | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2177 | Find Three Consecutive Integers That Sum to a Given Number | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2176 | Count Equal and Divisible Pairs in an Array | πΊπΈ π¨π³ | ts | Easy |
π sql | 2175 | The Change in Global Rankings | πΊπΈ π¨π³ | Medium | |
π | 2174 | Remove All Ones With Row and Column Flips II | πΊπΈ π¨π³ | Medium | |
π sql | 2173 | Longest Winning Streak | πΊπΈ π¨π³ | Hard | |
βοΈ | 2172 | Maximum AND Sum of Array | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2171 | Removing Minimum Number of Magic Beans | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2170 | Minimum Operations to Make the Array Alternating | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2169 | Count Operations to Obtain Zero | πΊπΈ π¨π³ | java | Easy |
π | 2168 | Unique Substrings With Equal Digit Frequency | πΊπΈ π¨π³ | Medium | |
βοΈ | 2167 | Minimum Time to Remove All Cars Containing Illegal Goods | πΊπΈ π¨π³ | java, ts | Hard |
βοΈ | 2166 | Design Bitset | πΊπΈ π¨π³ | java, java | Medium |
βοΈ | 2165 | Smallest Value of the Rearranged Number | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2164 | Sort Even and Odd Indices Independently | πΊπΈ π¨π³ | py | Easy |
βοΈ | 2163 | Minimum Difference in Sums After Removal of Elements | πΊπΈ π¨π³ | java | Hard |
βοΈ | 2162 | Minimum Cost to Set Cooking Time | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2161 | Partition Array According to Given Pivot | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2160 | Minimum Sum of Four Digit Number After Splitting Digits | πΊπΈ π¨π³ | ts | Easy |
π sql | 2159 | Order Two Columns Independently | πΊπΈ π¨π³ | Medium | |
π | 2158 | Amount of New Area Painted Each Day | πΊπΈ π¨π³ | Hard | |
βοΈ | 2157 | Groups of Strings | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2156 | Find Substring With Given Hash Value | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2155 | All Divisions With the Highest Score of a Binary Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2154 | Keep Multiplying Found Values by Two | πΊπΈ π¨π³ | ts | Easy |
π sql | 2153 | The Number of Passengers in Each Bus II | πΊπΈ π¨π³ | Hard | |
π | 2152 | Minimum Number of Lines to Cover Points | πΊπΈ π¨π³ | Medium | |
βοΈ | 2151 | Maximum Good People Based on Statements | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2150 | Find All Lonely Numbers in the Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2149 | Rearrange Array Elements by Sign | πΊπΈ π¨π³ | ts, ts | Medium |
βοΈ | 2148 | Count Elements With Strictly Smaller and Greater Elements | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2147 | Number of Ways to Divide a Long Corridor | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2146 | K Highest Ranked Items Within a Price Range | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2145 | Count the Hidden Sequences | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2144 | Minimum Cost of Buying Candies With Discount | πΊπΈ π¨π³ | ts | Easy |
π | 2143 | Choose Numbers From Two Arrays in Range | πΊπΈ π¨π³ | Hard | |
π sql | 2142 | The Number of Passengers in Each Bus I | πΊπΈ π¨π³ | Medium | |
βοΈ | 2141 | Maximum Running Time of N Computers | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2140 | Solving Questions With Brainpower | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2139 | Minimum Moves to Reach Target Score | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2138 | Divide a String Into Groups of Size k | πΊπΈ π¨π³ | py | Easy |
π | 2137 | Pour Water Between Buckets to Make Water Levels Equal | πΊπΈ π¨π³ | Medium | |
βοΈ | 2136 | Earliest Possible Day of Full Bloom | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2135 | Count Words Obtained After Adding a Letter | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2134 | Minimum Swaps to Group All 1's Together II | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2133 | Check if Every Row and Column Contains All Numbers | πΊπΈ π¨π³ | py | Easy |
2132 | Stamping the Grid | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2131 | Longest Palindrome by Concatenating Two Letter Words | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2130 | Maximum Twin Sum of a Linked List | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2129 | Capitalize the Title | πΊπΈ π¨π³ | java | Easy |
π | 2128 | Remove All Ones With Row and Column Flips | πΊπΈ π¨π³ | Medium | |
βοΈ | 2127 | Maximum Employees to Be Invited to a Meeting | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2126 | Destroying Asteroids | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2125 | Number of Laser Beams in a Bank | πΊπΈ π¨π³ | py, ts | Medium |
βοΈ | 2124 | Check if All A's Appears Before All B's | πΊπΈ π¨π³ | ts | Easy |
π | 2123 | Minimum Operations to Remove Adjacent Ones in Matrix | πΊπΈ π¨π³ | Hard | |
2122 | Recover the Original Array | πΊπΈ π¨π³ | Hard | ||
2121 | Intervals Between Identical Elements | πΊπΈ π¨π³ | Medium | ||
βοΈ | 2120 | Execution of All Suffix Instructions Staying in a Grid | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2119 | A Number After a Double Reversal | πΊπΈ π¨π³ | ts | Easy |
π sql | 2118 | Build the Equation | πΊπΈ π¨π³ | Hard | |
βοΈ | 2117 | Abbreviating the Product of a Range | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2116 | Check if a Parentheses String Can Be Valid | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2115 | Find All Possible Recipes from Given Supplies | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2114 | Maximum Number of Words Found in Sentences | πΊπΈ π¨π³ | ts | Easy |
π | 2113 | Elements in Array After Removing and Replacing Elements | πΊπΈ π¨π³ | Medium | |
π sql | 2112 | The Airport With the Most Traffic | πΊπΈ π¨π³ | Medium | |
βοΈ | 2111 | Minimum Operations to Make the Array K-Increasing | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2110 | Number of Smooth Descent Periods of a Stock | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2109 | Adding Spaces to a String | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2108 | Find First Palindromic String in the Array | πΊπΈ π¨π³ | ts | Easy |
π | 2107 | Number of Unique Flavors After Sharing K Candies | πΊπΈ π¨π³ | Medium | |
βοΈ | 2106 | Maximum Fruits Harvested After at Most K Steps | πΊπΈ π¨π³ | java | Hard |
βοΈ | 2105 | Watering Plants II | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2104 | Sum of Subarray Ranges | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2103 | Rings and Rods | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2102 | Sequentially Ordinal Rank Tracker | πΊπΈ π¨π³ | java | Hard |
βοΈ | 2101 | Detonate the Maximum Bombs | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2100 | Find Good Days to Rob the Bank | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2099 | Find Subsequence of Length K With the Largest Sum | πΊπΈ π¨π³ | ts | Easy |
π | 2098 | Subsequence of Size K With the Largest Even Sum | πΊπΈ π¨π³ | Medium | |
βοΈ | 2097 | Valid Arrangement of Pairs | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2096 | Step-By-Step Directions From a Binary Tree Node to Another | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2095 | Delete the Middle Node of a Linked List | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2094 | Finding 3-Digit Even Numbers | πΊπΈ π¨π³ | ts | Easy |
π | 2093 | Minimum Cost to Reach City With Discounts | πΊπΈ π¨π³ | Medium | |
βοΈ | 2092 | Find All People With Secret | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2091 | Removing Minimum and Maximum From Array | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2090 | K Radius Subarray Averages | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2089 | Find Target Indices After Sorting Array | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2088 | Count Fertile Pyramids in a Land | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2087 | Minimum Cost Homecoming of a Robot in a Grid | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2086 | Minimum Number of Food Buckets to Feed the Hamsters | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2085 | Count Common Words With One Occurrence | πΊπΈ π¨π³ | ts | Easy |
π sql | 2084 | Drop Type 1 Orders for Customers With Type 0 Orders | πΊπΈ π¨π³ | Medium | |
π | 2083 | Substrings That Begin and End With the Same Letter | πΊπΈ π¨π³ | Medium | |
π sql | 2082 | The Number of Rich Customers | πΊπΈ π¨π³ | Easy | |
βοΈ | 2081 | Sum of k-Mirror Numbers | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2080 | Range Frequency Queries | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2079 | Watering Plants | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2078 | Two Furthest Houses With Different Colors | πΊπΈ π¨π³ | ts | Easy |
π | 2077 | Paths in Maze That Lead to Same Room | πΊπΈ π¨π³ | Medium | |
βοΈ | 2076 | Process Restricted Friend Requests | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 2075 | Decode the Slanted Ciphertext | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2074 | Reverse Nodes in Even Length Groups | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2073 | Time Needed to Buy Tickets | πΊπΈ π¨π³ | ts | Easy |
π sql | 2072 | The Winner University | πΊπΈ π¨π³ | Easy | |
βοΈ | 2071 | Maximum Number of Tasks You Can Assign | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2070 | Most Beautiful Item for Each Query | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2069 | Walking Robot Simulation II | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2068 | Check Whether Two Strings are Almost Equivalent | πΊπΈ π¨π³ | py | Easy |
π | 2067 | Number of Equal Count Substrings | πΊπΈ π¨π³ | Medium | |
π sql | 2066 | Account Balance | πΊπΈ π¨π³ | Medium | |
βοΈ | 2065 | Maximum Path Quality of a Graph | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2064 | Minimized Maximum of Products Distributed to Any Store | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2063 | Vowels of All Substrings | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2062 | Count Vowel Substrings of a String | πΊπΈ π¨π³ | py, ts | Easy |
π | 2061 | Number of Spaces Cleaning Robot Cleaned | πΊπΈ π¨π³ | Medium | |
βοΈ | 2060 | Check if an Original String Exists Given Two Encoded Strings | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2059 | Minimum Operations to Convert Number | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2057 | Smallest Index With Equal Value | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 2056 | Number of Valid Move Combinations On Chessboard | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2055 | Plates Between Candles | πΊπΈ π¨π³ | py, ts | Medium |
βοΈ | 2054 | Two Best Non-Overlapping Events | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2053 | Kth Distinct String in an Array | πΊπΈ π¨π³ | ts | Easy |
π | 2052 | Minimum Cost to Separate Sentence Into Rows | πΊπΈ π¨π³ | Medium | |
π sql | 2051 | The Category of Each Member in the Store | πΊπΈ π¨π³ | Medium | |
βοΈ | 2050 | Parallel Courses III | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2049 | Count Nodes With the Highest Score | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2048 | Next Greater Numerically Balanced Number | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2047 | Number of Valid Words in a Sentence | πΊπΈ π¨π³ | py, ts | Easy |
π | 2046 | Sort Linked List Already Sorted Using Absolute Values | πΊπΈ π¨π³ | Medium | |
βοΈ | 2045 | Second Minimum Time to Reach Destination | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2044 | Count Number of Maximum Bitwise-OR Subsets | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2043 | Simple Bank System | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2042 | Check if Numbers Are Ascending in a Sentence | πΊπΈ π¨π³ | py, rb | Easy |
π sql | 2041 | Accepted Candidates From the Interviews | πΊπΈ π¨π³ | Medium | |
βοΈβ | 2040 | Kth Smallest Product of Two Sorted Arrays | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2039 | The Time When the Network Becomes Idle | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2037 | Minimum Number of Moves to Seat Everyone | πΊπΈ π¨π³ | rb | Easy |
π | 2036 | Maximum Alternating Subarray Sum | πΊπΈ π¨π³ | Medium | |
βοΈ | 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2034 | Stock Price Fluctuation | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2033 | Minimum Operations to Make a Uni-Value Grid | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2032 | Two Out of Three | πΊπΈ π¨π³ | py, py | Easy |
π | 2031 | Count Subarrays With More Ones Than Zeros | πΊπΈ π¨π³ | Medium | |
2030 | Smallest K-Length Subsequence With Occurrences of a Letter | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2029 | Stone Game IX | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2028 | Find Missing Observations | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2027 | Minimum Moves to Convert String | πΊπΈ π¨π³ | ts | Easy |
π sql | 2026 | Low-Quality Problems | πΊπΈ π¨π³ | Easy | |
2025 | Maximum Number of Ways to Partition an Array | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2024 | Maximize the Confusion of an Exam | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 2023 | Number of Pairs of Strings With Concatenation Equal to Target | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2022 | Convert 1D Array Into 2D Array | πΊπΈ π¨π³ | ts | Easy |
π | 2021 | Brightest Position on Street | πΊπΈ π¨π³ | Medium | |
π sql | 2020 | Number of Accounts That Did Not Stream | πΊπΈ π¨π³ | Medium | |
βοΈ | 2019 | The Score of Students Solving Math Expression | πΊπΈ π¨π³ | py | Hard |
βοΈ | 2018 | Check if Word Can Be Placed In Crossword | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2017 | Grid Game | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2016 | Maximum Difference Between Increasing Elements | πΊπΈ π¨π³ | py | Easy |
π | 2015 | Average Height of Buildings in Each Segment | πΊπΈ π¨π³ | Medium | |
2014 | Longest Subsequence Repeated k Times | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2013 | Detect Squares | πΊπΈ π¨π³ | java | Medium |
βοΈ | 2012 | Sum of Beauty in the Array | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2011 | Final Value of Variable After Performing Operations | πΊπΈ π¨π³ | c | Easy |
π sql | 2010 | The Number of Seniors and Juniors to Join the Company II | πΊπΈ π¨π³ | Hard | |
βοΈ | 2009 | Minimum Number of Operations to Make Array Continuous | πΊπΈ π¨π³ | c | Hard |
βοΈ | 2008 | Maximum Earnings From Taxi | πΊπΈ π¨π³ | c | Medium |
βοΈ | 2007 | Find Original Array From Doubled Array | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2006 | Count Number of Pairs With Absolute Difference K | πΊπΈ π¨π³ | py | Easy |
π | 2005 | Subtree Removal Game with Fibonacci Tree | πΊπΈ π¨π³ | Hard | |
π sql | 2004 | The Number of Seniors and Juniors to Join the Company | πΊπΈ π¨π³ | Hard | |
2003 | Smallest Missing Genetic Value in Each Subtree | πΊπΈ π¨π³ | Hard | ||
βοΈ | 2002 | Maximum Product of the Length of Two Palindromic Subsequences | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2001 | Number of Pairs of Interchangeable Rectangles | πΊπΈ π¨π³ | py | Medium |
βοΈ | 2000 | Reverse Prefix of Word | πΊπΈ π¨π³ | py | Easy |
π | 1999 | Smallest Greater Multiple Made of Two Digits | πΊπΈ π¨π³ | Medium | |
βοΈ | 1998 | GCD Sort of an Array | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1997 | First Day Where You Have Been in All the Rooms | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1996 | The Number of Weak Characters in the Game | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1995 | Count Special Quadruplets | πΊπΈ π¨π³ | py | Easy |
βοΈ | 1994 | The Number of Good Subsets | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1993 | Operations on Tree | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1992 | Find All Groups of Farmland | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1991 | Find the Middle Index in Array | πΊπΈ π¨π³ | js | Easy |
π sql | 1990 | Count the Number of Experiments | πΊπΈ π¨π³ | Medium | |
π | 1989 | Maximum Number of People That Can Be Caught in Tag | πΊπΈ π¨π³ | Medium | |
π sql | 1988 | Find Cutoff Score for Each School | πΊπΈ π¨π³ | Medium | |
βοΈ | 1987 | Number of Unique Good Subsequences | πΊπΈ π¨π³ | js | Hard |
βοΈ | 1986 | Minimum Number of Work Sessions to Finish the Tasks | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1985 | Find the Kth Largest Integer in the Array | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1984 | Minimum Difference Between Highest and Lowest of K Scores | πΊπΈ π¨π³ | js | Easy |
π | 1983 | Widest Pair of Indices With Equal Range Sum | πΊπΈ π¨π³ | Medium | |
βοΈ | 1982 | Find Array Given Subset Sums | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1981 | Minimize the Difference Between Target and Chosen Elements | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1980 | Find Unique Binary String | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1979 | Find Greatest Common Divisor of Array | πΊπΈ π¨π³ | py | Easy |
sql | 1978 | Employees Whose Manager Left the Company | πΊπΈ π¨π³ | Easy | |
1977 | Number of Ways to Separate Numbers | πΊπΈ π¨π³ | Hard | ||
βοΈ | 1976 | Number of Ways to Arrive at Destination | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1975 | Maximum Matrix Sum | πΊπΈ π¨π³ | java | Medium |
βοΈ | 1974 | Minimum Time to Type Word Using Special Typewriter | πΊπΈ π¨π³ | c | Easy |
βοΈπ | 1973 | Count Nodes Equal to Sum of Descendants | πΊπΈ π¨π³ | py | Medium |
π sql | 1972 | First and Last Call On the Same Day | πΊπΈ π¨π³ | Hard | |
βοΈ | 1971 | Find if Path Exists in Graph | πΊπΈ π¨π³ | py | Easy |
βοΈ | 1970 | Last Day Where You Can Still Cross | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1969 | Minimum Non-Zero Product of the Array Elements | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1968 | Array With Elements Not Equal to Average of Neighbors | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1967 | Number of Strings That Appear as Substrings in Word | πΊπΈ π¨π³ | py | Easy |
βοΈπ | 1966 | Binary Searchable Numbers in an Unsorted Array | πΊπΈ π¨π³ | py | Medium |
sql | 1965 | Employees With Missing Information | πΊπΈ π¨π³ | Easy | |
βοΈ | 1964 | Find the Longest Valid Obstacle Course at Each Position | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1963 | Minimum Number of Swaps to Make the String Balanced | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1962 | Remove Stones to Minimize the Total | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1961 | Check If String Is a Prefix of Array | πΊπΈ π¨π³ | py | Easy |
βοΈ | 1960 | Maximum Product of the Length of Two Palindromic Substrings | πΊπΈ π¨π³ | ts | Hard |
1959 | Minimum Total Space Wasted With K Resizing Operations | πΊπΈ π¨π³ | Medium | ||
βοΈ | 1958 | Check if Move is Legal | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1957 | Delete Characters to Make Fancy String | πΊπΈ π¨π³ | py | Easy |
π | 1956 | Minimum Time For K Virus Variants to Spread | πΊπΈ π¨π³ | Hard | |
βοΈ | 1955 | Count Number of Special Subsequences | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1954 | Minimum Garden Perimeter to Collect Enough Apples | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1953 | Maximum Number of Weeks for Which You Can Work | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1952 | Three Divisors | πΊπΈ π¨π³ | py, py | Easy |
π sql | 1951 | All the Pairs With the Maximum Number of Common Followers | πΊπΈ π¨π³ | Medium | |
βοΈπ | 1950 | Maximum of Minimum Values in All Subarrays | πΊπΈ π¨π³ | py | Medium |
π sql | 1949 | Strong Friendship | πΊπΈ π¨π³ | Medium | |
1948 | Delete Duplicate Folders in System | πΊπΈ π¨π³ | Hard | ||
1947 | Maximum Compatibility Score Sum | πΊπΈ π¨π³ | Medium | ||
1946 | Largest Number After Mutating Substring | πΊπΈ π¨π³ | Medium | ||
1945 | Sum of Digits of String After Convert | πΊπΈ π¨π³ | Easy | ||
1944 | Number of Visible People in a Queue | πΊπΈ π¨π³ | Hard | ||
1943 | Describe the Painting | πΊπΈ π¨π³ | Medium | ||
βοΈ | 1942 | The Number of the Smallest Unoccupied Chair | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1941 | Check if All Characters Have Equal Number of Occurrences | πΊπΈ π¨π³ | py | Easy |
βοΈπ | 1940 | Longest Common Subsequence Between Sorted Arrays | πΊπΈ π¨π³ | py | Medium |
π sql | 1939 | Users That Actively Request Confirmation Messages | πΊπΈ π¨π³ | Easy | |
1938 | Maximum Genetic Difference Query | πΊπΈ π¨π³ | Hard | ||
1937 | Maximum Number of Points with Cost | πΊπΈ π¨π³ | Medium | ||
βοΈ | 1936 | Add Minimum Number of Rungs | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1935 | Maximum Number of Words You Can Type | πΊπΈ π¨π³ | ts | Easy |
sql | 1934 | Confirmation Rate | πΊπΈ π¨π³ | Medium | |
βοΈπ | 1933 | Check if String Is Decomposable Into Value-Equal Substrings | πΊπΈ π¨π³ | ts | Easy |
βοΈ | 1932 | Merge BSTs to Create Single BST | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1931 | Painting a Grid With Three Different Colors | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1930 | Unique Length-3 Palindromic Subsequences | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1929 | Concatenation of Array | πΊπΈ π¨π³ | py | Easy |
βοΈ | 1928 | Minimum Cost to Reach Destination in Time | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1927 | Sum Game | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 1926 | Nearest Exit from Entrance in Maze | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 1925 | Count Square Sum Triples | πΊπΈ π¨π³ | ts | Easy |
π | 1924 | Erect the Fence II | πΊπΈ π¨π³ | Hard | |
βοΈβ | 1923 | Longest Common Subpath | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1922 | Count Good Numbers | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1921 | Eliminate Maximum Number of Monsters | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1920 | Build Array from Permutation | πΊπΈ π¨π³ | py | Easy |
π sql | 1919 | Leetcodify Similar Friends | πΊπΈ π¨π³ | Hard | |
π | 1918 | Kth Smallest Subarray Sum | πΊπΈ π¨π³ | Medium | |
π sql | 1917 | Leetcodify Friends Recommendations | πΊπΈ π¨π³ | Hard | |
1916 | Count Ways to Build Rooms in an Ant Colony | πΊπΈ π¨π³ | Hard | ||
βοΈ | 1915 | Number of Wonderful Substrings | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1914 | Cyclically Rotating a Grid | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1913 | Maximum Product Difference Between Two Pairs | πΊπΈ π¨π³ | py | Easy |
βοΈ | 1912 | Design Movie Rental System | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1911 | Maximum Alternating Subsequence Sum | πΊπΈ π¨π³ | js | Medium |
βοΈ | 1910 | Remove All Occurrences of a Substring | πΊπΈ π¨π³ | js | Medium |
βοΈ | 1909 | Remove One Element to Make the Array Strictly Increasing | πΊπΈ π¨π³ | js | Easy |
π | 1908 | Game of Nim | πΊπΈ π¨π³ | Medium | |
sql | 1907 | Count Salary Categories | πΊπΈ π¨π³ | Medium | |
βοΈ | 1906 | Minimum Absolute Difference Queries | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1905 | Count Sub Islands | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1904 | The Number of Full Rounds You Have Played | πΊπΈ π¨π³ | py, ts | Medium |
βοΈ | 1903 | Largest Odd Number in String | πΊπΈ π¨π³ | py | Easy |
π | 1902 | Depth of BST Given Insertion Order | πΊπΈ π¨π³ | Medium | |
βοΈ | 1901 | Find a Peak Element II | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1900 | The Earliest and Latest Rounds Where Players Compete | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1899 | Merge Triplets to Form Target Triplet | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1898 | Maximum Number of Removable Characters | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1897 | Redistribute Characters to Make All Strings Equal | πΊπΈ π¨π³ | py | Easy |
βοΈ | 1896 | Minimum Cost to Change the Final Value of Expression | πΊπΈ π¨π³ | ts | Hard |
βοΈ | 1895 | Largest Magic Square | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1894 | Find the Student that Will Replace the Chalk | πΊπΈ π¨π³ | ts | Medium |
βοΈ | 1893 | Check if All the Integers in a Range Are Covered | πΊπΈ π¨π³ | ts | Easy |
π sql | 1892 | Page Recommendations II | πΊπΈ π¨π³ | Hard | |
π | 1891 | Cutting Ribbons | πΊπΈ π¨π³ | Medium | |
sql | 1890 | The Latest Login in 2020 | πΊπΈ π¨π³ | Easy | |
βοΈ | 1889 | Minimum Space Wasted From Packaging | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1888 | Minimum Number of Flips to Make the Binary String Alternating | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1887 | Reduction Operations to Make the Array Elements Equal | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1886 | Determine Whether Matrix Can Be Obtained By Rotation | πΊπΈ π¨π³ | py | Easy |
π | 1885 | Count Pairs in Two Arrays | πΊπΈ π¨π³ | Medium | |
βοΈ | 1884 | Egg Drop With 2 Eggs and N Floors | πΊπΈ π¨π³ | c, c | Medium |
βοΈ | 1883 | Minimum Skips to Arrive at Meeting On Time | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1882 | Process Tasks Using Servers | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1881 | Maximum Value after Insertion | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1880 | Check if Word Equals Summation of Two Words | πΊπΈ π¨π³ | py | Easy |
βοΈ | 1879 | Minimum XOR Sum of Two Arrays | πΊπΈ π¨π³ | py | Hard |
βοΈ | 1878 | Get Biggest Three Rhombus Sums in a Grid | πΊπΈ π¨π³ | py | Medium |
βοΈ | 1877 | Minimize Maximum Pair Sum in Array | πΊπΈ π¨π³ | java | Medium |