-
If you like, star the original repository https://github.com/kaiwensun/leetcode
-
LeetCode websites
-
This report is generated by janitor.py.
-
Last update: Saturday, June 29, 2024
Total | Solved | Attempted | US site non-DB unsolved w/o lock (solved rate) | Starred |
---|---|---|---|---|
3597 | 2145 | 6 | 414 (83.26%) | 16 |
py | ts | java | rb | c | cpp | js | php | kt |
---|---|---|---|---|---|---|---|---|
60.7% | 14.0% | 10.6% | 6.5% | 4.3% | 2.2% | 0.9% | 0.8% | 0.1% |
0001-0500 | 0501-1000 | 1001-1500 | 1501-2000 | 2001-2500 | 2501-3000 |
3001-3500 | |||||
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) |
---|---|---|---|---|---|
✔️ | 100358 | find-the-maximum-length-of-valid-subsequence-ii | py | ||
✔️ | 100357 | find-the-maximum-length-of-valid-subsequence-i | py | ||
✔️ | 100340 | maximum-height-of-a-triangle | py | ||
✔️ | 100318 | find-minimum-diameter-after-merging-two-trees | py | ||
🔒 | 3199 | Count Triplets with Even XOR Set Bits I | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 3198 | Find Cities in Each State | 🇺🇸 🇨🇳 | Easy | |
3197 | Find the Minimum Area to Cover All Ones II | 🇺🇸 🇨🇳 | Hard | ||
3196 | Maximize Total Cost of Alternating Subarrays | 🇺🇸 🇨🇳 | Medium | ||
3195 | Find the Minimum Area to Cover All Ones I | 🇺🇸 🇨🇳 | Medium | ||
3194 | Minimum Average of Smallest and Largest Elements | 🇺🇸 🇨🇳 | Easy | ||
3193 | Count the Number of Inversions | 🇺🇸 🇨🇳 | Hard | ||
3192 | Minimum Operations to Make Binary Array Elements Equal to One II | 🇺🇸 🇨🇳 | Medium | ||
3191 | Minimum Operations to Make Binary Array Elements Equal to One I | 🇺🇸 🇨🇳 | Medium | ||
3190 | Find Minimum Operations to Make All Elements Divisible by Three | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3189 | Minimum Moves to Get a Peaceful Board | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3188 | Find Top Scoring Students II | 🇺🇸 🇨🇳 | Hard | |
✔️ | 3187 | Peaks in Array | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 3186 | Maximum Total Damage With Spell Casting | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3185 | Count Pairs That Form a Complete Day II | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3184 | Count Pairs That Form a Complete Day I | 🇺🇸 🇨🇳 | py | Easy |
🔒 | 3183 | The Number of Ways to Make the Sum | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3182 | Find Top Scoring Students | 🇺🇸 🇨🇳 | Medium | |
✔️ | 3181 | Maximum Total Reward Using Operations II | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 3180 | Maximum Total Reward Using Operations I | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3179 | Find the N-th Value After K Seconds | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3178 | Find the Child Who Has the Ball After K Seconds | 🇺🇸 🇨🇳 | kt | Easy |
3177 | Find the Maximum Length of a Good Subsequence II | 🇺🇸 🇨🇳 | Hard | ||
3176 | Find the Maximum Length of a Good Subsequence I | 🇺🇸 🇨🇳 | Medium | ||
3175 | Find The First Player to win K Games in a Row | 🇺🇸 🇨🇳 | Medium | ||
✔️ | 3174 | Clear Digits | 🇺🇸 🇨🇳 | kt | Easy |
🔒 | 3173 | Bitwise OR of Adjacent Elements | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 3172 | Second Day Verification | 🇺🇸 🇨🇳 | Easy | |
✔️ | 3171 | Find Subarray With Bitwise OR Closest to K | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 3170 | Lexicographically Minimum String After Removing Stars | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3169 | Count Days Without Meetings | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3168 | Minimum Number of Chairs in a Waiting Room | 🇺🇸 🇨🇳 | py | Easy |
🔒 | 3167 | Better Compression of String | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3166 | Calculate Parking Fees and Duration | 🇺🇸 🇨🇳 | Medium | |
3165 | Maximum Sum of Subsequence With Non-adjacent Elements | 🇺🇸 🇨🇳 | Hard | ||
3164 | Find the Number of Good Pairs II | 🇺🇸 🇨🇳 | Medium | ||
3163 | String Compression III | 🇺🇸 🇨🇳 | Medium | ||
3162 | Find the Number of Good Pairs I | 🇺🇸 🇨🇳 | Easy | ||
3161 | Block Placement Queries | 🇺🇸 🇨🇳 | Hard | ||
3160 | Find the Number of Distinct Colors Among the Balls | 🇺🇸 🇨🇳 | Medium | ||
3159 | Find Occurrences of an Element in an Array | 🇺🇸 🇨🇳 | Medium | ||
3158 | Find the XOR of Numbers Which Appear Twice | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3157 | Find the Level of Tree with Minimum Sum | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3156 | Employee Task Duration and Concurrent Tasks | 🇺🇸 🇨🇳 | Hard | |
🔒 | 3155 | Maximum Number of Upgradable Servers | 🇺🇸 🇨🇳 | Medium | |
3154 | Find Number of Ways to Reach the K-th Stair | 🇺🇸 🇨🇳 | Hard | ||
3153 | Sum of Digit Differences of All Pairs | 🇺🇸 🇨🇳 | Medium | ||
3152 | Special Array II | 🇺🇸 🇨🇳 | Medium | ||
3151 | Special Array I | 🇺🇸 🇨🇳 | Easy | ||
🔒 sql | 3150 | Invalid Tweets II | 🇺🇸 🇨🇳 | Easy | |
✔️ | 3149 | Find the Minimum Cost Array Permutation | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 3148 | Maximum Difference Score in a Grid | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3147 | Taking Maximum Energy From the Mystic Dungeon | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3146 | Permutation Difference between Two Strings | 🇺🇸 🇨🇳 | py | Easy |
3145 | Find Products of Elements of Big Array | 🇺🇸 🇨🇳 | Hard | ||
3144 | Minimum Substring Partition of Equal Character Frequency | 🇺🇸 🇨🇳 | Medium | ||
3143 | Maximum Points Inside the Square | 🇺🇸 🇨🇳 | Medium | ||
3142 | Check if Grid Satisfies Conditions | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3141 | Maximum Hamming Distances | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 3140 | Consecutive Available Seats II | 🇺🇸 🇨🇳 | Medium | |
✔️ | 3139 | Minimum Cost to Equalize Array | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 3138 | Minimum Length of Anagram Concatenation | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3137 | Minimum Number of Operations to Make Word K-Periodic | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3136 | Valid Word | 🇺🇸 🇨🇳 | py | Easy |
🔒 | 3135 | Equalize Strings by Adding or Removing Characters at Ends | 🇺🇸 🇨🇳 | Medium | |
3134 | Find the Median of the Uniqueness Array | 🇺🇸 🇨🇳 | Hard | ||
✔️ | 3133 | Minimum Array End | 🇺🇸 🇨🇳 | c | Medium |
✔️ | 3132 | Find the Integer Added to Array II | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3131 | Find the Integer Added to Array I | 🇺🇸 🇨🇳 | ts | Easy |
3130 | Find All Possible Stable Binary Arrays II | 🇺🇸 🇨🇳 | Hard | ||
3129 | Find All Possible Stable Binary Arrays I | 🇺🇸 🇨🇳 | Medium | ||
3128 | Right Triangles | 🇺🇸 🇨🇳 | Medium | ||
3127 | Make a Square with the Same Color | 🇺🇸 🇨🇳 | Easy | ||
🔒 sql | 3126 | Server Utilization Time | 🇺🇸 🇨🇳 | Medium | |
🔒 | 3125 | Maximum Number That Makes Result of Bitwise AND Zero | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3124 | Find Longest Calls | 🇺🇸 🇨🇳 | Medium | |
3123 | Find Edges in Shortest Paths | 🇺🇸 🇨🇳 | Hard | ||
3122 | Minimum Number of Operations to Satisfy Conditions | 🇺🇸 🇨🇳 | Medium | ||
3121 | Count the Number of Special Characters II | 🇺🇸 🇨🇳 | Medium | ||
3120 | Count the Number of Special Characters I | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3119 | Maximum Number of Potholes That Can Be Fixed | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3118 | Friday Purchase III | 🇺🇸 🇨🇳 | Medium | |
3117 | Minimum Sum of Values by Dividing Array | 🇺🇸 🇨🇳 | Hard | ||
3116 | Kth Smallest Amount With Single Denomination Combination | 🇺🇸 🇨🇳 | Hard | ||
3115 | Maximum Prime Difference | 🇺🇸 🇨🇳 | Medium | ||
3114 | Latest Time You Can Obtain After Replacing Characters | 🇺🇸 🇨🇳 | Easy | ||
3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | 🇺🇸 🇨🇳 | Hard | ||
3112 | Minimum Time to Visit Disappearing Nodes | 🇺🇸 🇨🇳 | Medium | ||
3111 | Minimum Rectangles to Cover Points | 🇺🇸 🇨🇳 | Medium | ||
3110 | Score of a String | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3109 | Find the Index of Permutation | 🇺🇸 🇨🇳 | Medium | |
3108 | Minimum Cost Walk in Weighted Graph | 🇺🇸 🇨🇳 | Hard | ||
3107 | Minimum Operations to Make Median of Array Equal to K | 🇺🇸 🇨🇳 | Medium | ||
3106 | Lexicographically Smallest String After Operations With Constraint | 🇺🇸 🇨🇳 | Medium | ||
3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3104 | Find Longest Self-Contained Substring | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 3103 | Find Trending Hashtags II | 🇺🇸 🇨🇳 | Hard | |
3102 | Minimize Manhattan Distances | 🇺🇸 🇨🇳 | Hard | ||
3101 | Count Alternating Subarrays | 🇺🇸 🇨🇳 | Medium | ||
3100 | Water Bottles II | 🇺🇸 🇨🇳 | Medium | ||
3099 | Harshad Number | 🇺🇸 🇨🇳 | Easy | ||
3098 | Find the Sum of Subsequence Powers | 🇺🇸 🇨🇳 | Hard | ||
3097 | Shortest Subarray With OR at Least K II | 🇺🇸 🇨🇳 | Medium | ||
3096 | Minimum Levels to Gain More Points | 🇺🇸 🇨🇳 | Medium | ||
3095 | Shortest Subarray With OR at Least K I | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3094 | Guess the Number Using Bitwise Questions II | 🇺🇸 🇨🇳 | Medium | |
3093 | Longest Common Suffix Queries | 🇺🇸 🇨🇳 | Hard | ||
3092 | Most Frequent IDs | 🇺🇸 🇨🇳 | Medium | ||
3091 | Apply Operations to Make Sum of Array Greater Than or Equal to k | 🇺🇸 🇨🇳 | Medium | ||
3090 | Maximum Length Substring With Two Occurrences | 🇺🇸 🇨🇳 | Easy | ||
🔒 sql | 3089 | Find Bursty Behavior | 🇺🇸 🇨🇳 | Medium | |
🔒 | 3088 | Make String Anti-palindrome | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 3087 | Find Trending Hashtags | 🇺🇸 🇨🇳 | Medium | |
3086 | Minimum Moves to Pick K Ones | 🇺🇸 🇨🇳 | Hard | ||
3085 | Minimum Deletions to Make String K-Special | 🇺🇸 🇨🇳 | Medium | ||
3084 | Count Substrings Starting and Ending with Given Character | 🇺🇸 🇨🇳 | Medium | ||
3083 | Existence of a Substring in a String and Its Reverse | 🇺🇸 🇨🇳 | Easy | ||
3082 | Find the Sum of the Power of All Subsequences | 🇺🇸 🇨🇳 | Hard | ||
3081 | Replace Question Marks in String to Minimize Its Value | 🇺🇸 🇨🇳 | Medium | ||
3080 | Mark Elements on Array by Performing Queries | 🇺🇸 🇨🇳 | Medium | ||
3079 | Find the Sum of Encrypted Integers | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3078 | Match Alphanumerical Pattern in Matrix I | 🇺🇸 🇨🇳 | Medium | |
3077 | Maximum Strength of K Disjoint Subarrays | 🇺🇸 🇨🇳 | Hard | ||
3076 | Shortest Uncommon Substring in an Array | 🇺🇸 🇨🇳 | Medium | ||
3075 | Maximize Happiness of Selected Children | 🇺🇸 🇨🇳 | Medium | ||
3074 | Apple Redistribution into Boxes | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3073 | Maximum Increasing Triplet Value | 🇺🇸 🇨🇳 | Medium | |
3072 | Distribute Elements Into Two Arrays II | 🇺🇸 🇨🇳 | Hard | ||
3071 | Minimum Operations to Write the Letter Y on a Grid | 🇺🇸 🇨🇳 | Medium | ||
3070 | Count Submatrices with Top-Left Element and Sum Less Than k | 🇺🇸 🇨🇳 | Medium | ||
3069 | Distribute Elements Into Two Arrays I | 🇺🇸 🇨🇳 | Easy | ||
3068 | Find the Maximum Sum of Node Values | 🇺🇸 🇨🇳 | Hard | ||
3067 | Count Pairs of Connectable Servers in a Weighted Tree Network | 🇺🇸 🇨🇳 | Medium | ||
3066 | Minimum Operations to Exceed Threshold Value II | 🇺🇸 🇨🇳 | Medium | ||
3065 | Minimum Operations to Exceed Threshold Value I | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3064 | Guess the Number Using Bitwise Questions I | 🇺🇸 🇨🇳 | Medium | |
🔒 | 3063 | Linked List Frequency | 🇺🇸 🇨🇳 | Easy | |
🔒 | 3062 | Winner of the Linked List Game | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 3061 | Calculate Trapping Rain Water | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 3060 | User Activities within Time Bounds | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 3059 | Find All Unique Email Domains | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 3058 | Friends With No Mutual Friends | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3057 | Employees Project Allocation | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 3056 | Snaps Analysis | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3055 | Top Percentile Fraud | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3054 | Binary Tree Nodes | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 3053 | Classifying Triangles by Lengths | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 3052 | Maximize Items | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 3051 | Find Candidates for Data Scientist Position | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 3050 | Pizza Toppings Cost Analysis | 🇺🇸 🇨🇳 | Medium | |
3049 | Earliest Second to Mark Indices II | 🇺🇸 🇨🇳 | Hard | ||
3048 | Earliest Second to Mark Indices I | 🇺🇸 🇨🇳 | Medium | ||
3047 | Find the Largest Area of Square Inside Two Rectangles | 🇺🇸 🇨🇳 | Medium | ||
3046 | Split the Array | 🇺🇸 🇨🇳 | Easy | ||
3045 | Count Prefix and Suffix Pairs II | 🇺🇸 🇨🇳 | Hard | ||
3044 | Most Frequent Prime | 🇺🇸 🇨🇳 | Medium | ||
3043 | Find the Length of the Longest Common Prefix | 🇺🇸 🇨🇳 | Medium | ||
3042 | Count Prefix and Suffix Pairs I | 🇺🇸 🇨🇳 | Easy | ||
3041 | Maximize Consecutive Elements in an Array After Modification | 🇺🇸 🇨🇳 | Hard | ||
3040 | Maximum Number of Operations With the Same Score II | 🇺🇸 🇨🇳 | Medium | ||
3039 | Apply Operations to Make String Empty | 🇺🇸 🇨🇳 | Medium | ||
3038 | Maximum Number of Operations With the Same Score I | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3037 | Find Pattern in Infinite Stream II | 🇺🇸 🇨🇳 | Hard | |
3036 | Number of Subarrays That Match a Pattern II | 🇺🇸 🇨🇳 | Hard | ||
3035 | Maximum Palindromes After Operations | 🇺🇸 🇨🇳 | Medium | ||
3034 | Number of Subarrays That Match a Pattern I | 🇺🇸 🇨🇳 | Medium | ||
3033 | Modify the Matrix | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3032 | Count Numbers With Unique Digits II | 🇺🇸 🇨🇳 | Easy | |
3031 | Minimum Time to Revert Word to Initial State II | 🇺🇸 🇨🇳 | Hard | ||
3030 | Find the Grid of Region Average | 🇺🇸 🇨🇳 | Medium | ||
3029 | Minimum Time to Revert Word to Initial State I | 🇺🇸 🇨🇳 | Medium | ||
3028 | Ant on the Boundary | 🇺🇸 🇨🇳 | Easy | ||
3027 | Find the Number of Ways to Place People II | 🇺🇸 🇨🇳 | Hard | ||
3026 | Maximum Good Subarray Sum | 🇺🇸 🇨🇳 | Medium | ||
3025 | Find the Number of Ways to Place People I | 🇺🇸 🇨🇳 | Medium | ||
3024 | Type of Triangle | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3023 | Find Pattern in Infinite Stream I | 🇺🇸 🇨🇳 | Medium | |
3022 | Minimize OR of Remaining Elements Using Operations | 🇺🇸 🇨🇳 | Hard | ||
3021 | Alice and Bob Playing Flower Game | 🇺🇸 🇨🇳 | Medium | ||
3020 | Find the Maximum Number of Elements in Subset | 🇺🇸 🇨🇳 | Medium | ||
3019 | Number of Changing Keys | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3018 | Maximum Number of Removal Queries That Can Be Processed I | 🇺🇸 🇨🇳 | Hard | |
3017 | Count the Number of Houses at a Certain Distance II | 🇺🇸 🇨🇳 | Hard | ||
3016 | Minimum Number of Pushes to Type Word II | 🇺🇸 🇨🇳 | Medium | ||
3015 | Count the Number of Houses at a Certain Distance I | 🇺🇸 🇨🇳 | Medium | ||
3014 | Minimum Number of Pushes to Type Word I | 🇺🇸 🇨🇳 | Easy | ||
3013 | Divide an Array Into Subarrays With Minimum Cost II | 🇺🇸 🇨🇳 | Hard | ||
3012 | Minimize Length of Array Using Operations | 🇺🇸 🇨🇳 | Medium | ||
3011 | Find if Array Can Be Sorted | 🇺🇸 🇨🇳 | Medium | ||
3010 | Divide an Array Into Subarrays With Minimum Cost I | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 3009 | Maximum Number of Intersections on the Chart | 🇺🇸 🇨🇳 | Hard | |
✔️ | 3008 | Find Beautiful Indices in the Given Array II | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3006 | Find Beautiful Indices in the Given Array I | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3005 | Count Elements With Maximum Frequency | 🇺🇸 🇨🇳 | py | Easy |
🔒 | 3004 | Maximum Subtree of the Same Color | 🇺🇸 🇨🇳 | Medium | |
✔️ | 3003 | Maximize the Number of Partitions After Operations | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 3002 | Maximum Size of a Set After Removals | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3001 | Minimum Moves to Capture The Queen | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 3000 | Maximum Area of Longest Diagonal Rectangle | 🇺🇸 🇨🇳 | py | Easy |
2999 | Count the Number of Powerful Integers | 🇺🇸 🇨🇳 | Hard | ||
2998 | Minimum Number of Operations to Make X and Y Equal | 🇺🇸 🇨🇳 | Medium | ||
2997 | Minimum Number of Operations to Make Array XOR Equal to K | 🇺🇸 🇨🇳 | Medium | ||
2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | 🇺🇸 🇨🇳 | Easy | ||
🔒 sql | 2995 | Viewers Turned Streamers | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 2994 | Friday Purchases II | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 2993 | Friday Purchases I | 🇺🇸 🇨🇳 | Medium | |
🔒 | 2992 | Number of Self-Divisible Permutations | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 2991 | Top Three Wineries | 🇺🇸 🇨🇳 | Hard | |
🔒 sql | 2990 | Loan Types | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 2989 | Class Performance | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 2988 | Manager of the Largest Department | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 2987 | Find Expensive Cities | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 2986 | Find Third Transaction | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 2985 | Calculate Compressed Mean | 🇺🇸 🇨🇳 | Easy | |
🔒 sql | 2984 | Find Peak Calling Hours for Each City | 🇺🇸 🇨🇳 | Medium | |
✔️ | 2983 | Palindrome Rearrangement Queries | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2982 | Find Longest Special Substring That Occurs Thrice II | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2981 | Find Longest Special Substring That Occurs Thrice I | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2980 | Check if Bitwise OR Has Trailing Zeros | 🇺🇸 🇨🇳 | py | Easy |
🔒 | 2979 | Most Expensive Item That Can Not Be Bought | 🇺🇸 🇨🇳 | Medium | |
🔒 sql | 2978 | Symmetric Coordinates | 🇺🇸 🇨🇳 | Medium | |
✔️ | 2977 | Minimum Cost to Convert String II | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2976 | Minimum Cost to Convert String I | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2975 | Maximum Square Area by Removing Fences From a Field | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2974 | Minimum Number Game | 🇺🇸 🇨🇳 | py | Easy |
2973 | Find Number of Coins to Place in Tree Nodes | 🇺🇸 🇨🇳 | Hard | ||
2972 | Count the Number of Incremovable Subarrays II | 🇺🇸 🇨🇳 | Hard | ||
2971 | Find Polygon With the Largest Perimeter | 🇺🇸 🇨🇳 | Medium | ||
2970 | Count the Number of Incremovable Subarrays I | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 2969 | Minimum Number of Coins for Fruits II | 🇺🇸 🇨🇳 | Hard | |
2968 | Apply Operations to Maximize Frequency Score | 🇺🇸 🇨🇳 | Hard | ||
2967 | Minimum Cost to Make Array Equalindromic | 🇺🇸 🇨🇳 | Medium | ||
2966 | Divide Array Into Arrays With Max Difference | 🇺🇸 🇨🇳 | Medium | ||
2965 | Find Missing and Repeated Values | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 2964 | Number of Divisible Triplet Sums | 🇺🇸 🇨🇳 | Medium | |
✔️ | 2963 | Count the Number of Good Partitions | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2962 | Count Subarrays Where Max Element Appears at Least K Times | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2961 | Double Modular Exponentiation | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2960 | Count Tested Devices After Test Operations | 🇺🇸 🇨🇳 | py | Easy |
2959 | Number of Possible Sets of Closing Branches | 🇺🇸 🇨🇳 | Hard | ||
2958 | Length of Longest Subarray With at Most K Frequency | 🇺🇸 🇨🇳 | Medium | ||
2957 | Remove Adjacent Almost-Equal Characters | 🇺🇸 🇨🇳 | Medium | ||
2956 | Find Common Elements Between Two Arrays | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 2955 | Number of Same-End Substrings | 🇺🇸 🇨🇳 | Medium | |
2954 | Count the Number of Infection Sequences | 🇺🇸 🇨🇳 | Hard | ||
2953 | Count Complete Substrings | 🇺🇸 🇨🇳 | Hard | ||
2952 | Minimum Number of Coins to be Added | 🇺🇸 🇨🇳 | Medium | ||
2951 | Find the Peaks | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 2950 | Number of Divisible Substrings | 🇺🇸 🇨🇳 | Medium | |
✔️ | 2949 | Count Beautiful Substrings II | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2948 | Make Lexicographically Smallest Array by Swapping Elements | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2947 | Count Beautiful Substrings I | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2946 | Matrix Similarity After Cyclic Shifts | 🇺🇸 🇨🇳 | py | Easy |
2945 | Find Maximum Non-decreasing Array Length | 🇺🇸 🇨🇳 | Hard | ||
2944 | Minimum Number of Coins for Fruits | 🇺🇸 🇨🇳 | Medium | ||
2943 | Maximize Area of Square Hole in Grid | 🇺🇸 🇨🇳 | Medium | ||
2942 | Find Words Containing Character | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 2941 | Maximum GCD-Sum of a Subarray | 🇺🇸 🇨🇳 | Hard | |
2940 | Find Building Where Alice and Bob Can Meet | 🇺🇸 🇨🇳 | Hard | ||
✔️ | 2939 | Maximum Xor Product | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2938 | Separate Black and White Balls | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2937 | Make Three Strings Equal | 🇺🇸 🇨🇳 | py | Easy |
🔒 | 2936 | Number of Equal Numbers Blocks | 🇺🇸 🇨🇳 | Medium | |
✔️ | 2935 | Maximum Strong Pair XOR II | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2934 | Minimum Operations to Maximize Last Elements in Arrays | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2933 | High-Access Employees | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2932 | Maximum Strong Pair XOR I | 🇺🇸 🇨🇳 | py | Easy |
2931 | Maximum Spending After Buying Items | 🇺🇸 🇨🇳 | Hard | ||
2930 | Number of Strings Which Can Be Rearranged to Contain Substring | 🇺🇸 🇨🇳 | Medium | ||
2929 | Distribute Candies Among Children II | 🇺🇸 🇨🇳 | Medium | ||
2928 | Distribute Candies Among Children I | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 2927 | Distribute Candies Among Children III | 🇺🇸 🇨🇳 | Hard | |
✔️ | 2926 | Maximum Balanced Subsequence Sum | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2925 | Maximum Score After Applying Operations on a Tree | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2924 | Find Champion II | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2923 | Find Champion I | 🇺🇸 🇨🇳 | py | Easy |
🔒 sql | 2922 | Market Analysis III | 🇺🇸 🇨🇳 | Medium | |
🔒 | 2921 | Maximum Profitable Triplets With Increasing Prices II | 🇺🇸 🇨🇳 | Hard | |
✔️ | 2920 | Maximum Points After Collecting Coins From All Nodes | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2919 | Minimum Increment Operations to Make Array Beautiful | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2917 | Find the K-or of an Array | 🇺🇸 🇨🇳 | py | Easy |
2916 | Subarrays Distinct Element Sum of Squares II | 🇺🇸 🇨🇳 | Hard | ||
2915 | Length of the Longest Subsequence That Sums to Target | 🇺🇸 🇨🇳 | Medium | ||
2914 | Minimum Number of Changes to Make Binary String Beautiful | 🇺🇸 🇨🇳 | Medium | ||
2913 | Subarrays Distinct Element Sum of Squares I | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 2912 | Number of Ways to Reach Destination in the Grid | 🇺🇸 🇨🇳 | Hard | |
✔️ | 2911 | Minimum Changes to Make K Semi-palindromes | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2910 | Minimum Number of Groups to Create a Valid Assignment | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2909 | Minimum Sum of Mountain Triplets II | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2908 | Minimum Sum of Mountain Triplets I | 🇺🇸 🇨🇳 | py | Easy |
🔒 | 2907 | Maximum Profitable Triplets With Increasing Prices I | 🇺🇸 🇨🇳 | Medium | |
✔️⭐ | 2906 | Construct Product Matrix | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2905 | Find Indices With Index and Value Difference II | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2904 | Shortest and Lexicographically Smallest Beautiful String | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2903 | Find Indices With Index and Value Difference I | 🇺🇸 🇨🇳 | py | Easy |
2902 | Count of Sub-Multisets With Bounded Sum | 🇺🇸 🇨🇳 | Hard | ||
2901 | Longest Unequal Adjacent Groups Subsequence II | 🇺🇸 🇨🇳 | Medium | ||
2900 | Longest Unequal Adjacent Groups Subsequence I | 🇺🇸 🇨🇳 | Easy | ||
2899 | Last Visited Integers | 🇺🇸 🇨🇳 | Easy | ||
🔒 | 2898 | Maximum Linear Stock Score | 🇺🇸 🇨🇳 | Medium | |
✔️ | 2897 | Apply Operations on Array to Maximize Sum of Squares | 🇺🇸 🇨🇳 | py | Hard |
✔️ | 2896 | Apply Operations to Make Two Strings Equal | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2895 | Minimum Processing Time | 🇺🇸 🇨🇳 | py | Medium |
✔️ | 2894 | Divisible and Non-divisible Sums Difference | 🇺🇸 🇨🇳 | py | Easy |
🔒 sql | 2893 | Calculate Orders Within Each Interval | 🇺🇸 🇨🇳 | Medium | |
🔒 | 2892 | Minimizing Array After Replacing Pairs With Their Product | 🇺🇸 🇨🇳 | Medium | |
2891 | Method Chaining | 🇺🇸 🇨🇳 | Easy | ||
2890 | Reshape Data: Melt | 🇺🇸 🇨🇳 | Easy | ||
2889 | Reshape Data: Pivot | 🇺🇸 🇨🇳 | Easy | ||
2888 | Reshape Data: Concatenate | 🇺🇸 🇨🇳 | Easy | ||
2887 | Fill Missing Data | 🇺🇸 🇨🇳 | Easy | ||
2886 | Change Data Type | 🇺🇸 🇨🇳 | Easy | ||
2885 | Rename Columns | 🇺🇸 🇨🇳 | Easy | ||
2884 | Modify Columns | 🇺🇸 🇨🇳 | Easy | ||
2883 | Drop Missing Data | 🇺🇸 🇨🇳 | Easy | ||
2882 | Drop Duplicate Rows | 🇺🇸 🇨🇳 | Easy | ||
2881 | Create a New Column | 🇺🇸 🇨🇳 | Easy | ||
2880 | Select Data | 🇺🇸 🇨🇳 | Easy | ||
2879 | Display the First Three Rows | 🇺🇸 🇨🇳 | Easy | ||
2878 | Get the Size of a DataFrame | 🇺🇸 🇨🇳 | Easy | ||
2877 | Create a DataFrame from List | 🇺🇸 🇨🇳 | Easy | ||
✔️ | 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 | 🇺🇸 🇨🇳 | Medium | |
🔒 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 | 🇺🇸 🇨🇳 | Easy | |
🔒 | 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 | 🇺🇸 🇨🇳 | Hard | |
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 | Medium |
✔️ | 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 |