Skip to content

Latest commit

Β 

History

History
219 lines (214 loc) Β· 44.8 KB

README.md

File metadata and controls

219 lines (214 loc) Β· 44.8 KB

3001-3500 questions

Total Solved Attempted US site non-DB unsolved w/o lock (solved rate)
205 35 0 116 (23.18%)
py kt ts c
88.6% 5.7% 2.9% 2.9%
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