Skip to content

kaiwensun/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Kaiwen's LeetCode solutions [FORK NOT PERMITTED]

Total Solved Attempted US site non-DB unsolved w/o lock (solved rate) Starred
3599 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)
πŸ”’ 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
βœ”οΈ 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