π |
3205 |
Maximum Array Hopping Score I |
πΊπΈ π¨π³ |
|
Medium |
π sql |
3204 |
Bitwise User Permissions Analysis |
πΊπΈ π¨π³ |
|
Medium |
βοΈ |
3203 |
Find Minimum Diameter After Merging Two Trees |
πΊπΈ π¨π³ |
py |
Hard |
βοΈ |
3202 |
Find the Maximum Length of Valid Subsequence II |
πΊπΈ π¨π³ |
py |
Medium |
βοΈ |
3201 |
Find the Maximum Length of Valid Subsequence I |
πΊπΈ π¨π³ |
py |
Medium |
βοΈ |
3200 |
Maximum Height of a Triangle |
πΊπΈ π¨π³ |
py |
Easy |
π |
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 |