Skip to content

Latest commit

Β 

History

History
514 lines (509 loc) Β· 133 KB

README.md

File metadata and controls

514 lines (509 loc) Β· 133 KB

2001-2500 questions

Total Solved Attempted US site non-DB unsolved w/o lock (solved rate) Starred
500 380 0 15 (96.19%) 2
ts py java c rb js cpp
51.8% 35.9% 6.8% 4.5% 0.5% 0.3% 0.3%
Status # Title Question Links My Solutions Difficulty (CN)
βœ”οΈ 2500 Delete Greatest Value in Each Row πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2499 Minimum Total Cost to Make Arrays Unequal πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2498 Frog Jump II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2497 Maximum Star Sum of a Graph πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2496 Maximum Value of a String in an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2495 Number of Subarrays Having Even Product πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2494 Merge Overlapping Events in the Same Hall πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2493 Divide Nodes Into the Maximum Number of Groups πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2492 Minimum Score of a Path Between Two Cities πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2491 Divide Players Into Teams of Equal Skill πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2490 Circular Sentence πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2489 Number of Substrings With Fixed Ratio πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2488 Count Subarrays With Median K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2487 Remove Nodes From Linked List πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2486 Append Characters to String to Make Subsequence πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2485 Find the Pivot Integer πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2484 Count Palindromic Subsequences πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, ts Hard
βœ”οΈ 2483 Minimum Penalty for a Shop πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2482 Difference Between Ones and Zeros in Row and Column πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2481 Minimum Cuts to Divide a Circle πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2480 Form a Chemical Bond πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
πŸ”’ 2479 Maximum XOR of Two Non-Overlapping Subtrees πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2478 Number of Beautiful Partitions πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2477 Minimum Fuel Cost to Report to the Capital πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2476 Closest Nodes Queries in a Binary Search Tree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, ts Medium
βœ”οΈ 2475 Number of Unequal Triplets in Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ sql 2474 Customers With Strictly Increasing Purchases πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
πŸ”’ 2473 Minimum Cost to Buy Apples πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2472 Maximum Number of Non-overlapping Palindrome Substrings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2471 Minimum Number of Operations to Sort a Binary Tree by Level πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2470 Number of Subarrays With LCM Equal to K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2469 Convert the Temperature πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2468 Split Message Based on Limit πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2467 Most Profitable Path in a Tree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2466 Count Ways To Build Good Strings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2465 Number of Distinct Averages πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2464 Minimum Subarrays in a Valid Split πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
2463 Minimum Total Distance Traveled πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2462 Total Cost to Hire K Workers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2461 Maximum Sum of Distinct Subarrays With Length K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2460 Apply Operations to an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2459 Sort Array by Moving Items to Empty Space πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2458 Height of Binary Tree After Subtree Removal Queries πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2457 Minimum Addition to Make Integer Beautiful πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2456 Most Popular Video Creator πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2455 Average Value of Even Numbers That Are Divisible by Three πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
βœ”οΈ 2454 Next Greater Element IV πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2453 Destroy Sequential Targets πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2452 Words Within Two Edits of Dictionary πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2451 Odd String Difference πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2450 Number of Distinct Binary Strings After Applying Operations πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2449 Minimum Number of Operations to Make Arrays Similar πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2448 Minimum Cost to Make Array Equal πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c, py Hard
βœ”οΈ 2447 Number of Subarrays With GCD Equal to K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2446 Determine if Two Events Have Conflict πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2445 Number of Nodes With Value One πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2444 Count Subarrays With Fixed Bounds πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2443 Sum of Number and Its Reverse πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2442 Count Number of Distinct Integers After Reverse Operations πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2441 Largest Positive Integer That Exists With Its Negative πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
2440 Create Components With Same Value πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2439 Minimize Maximum of Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2438 Range Product Queries of Powers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2437 Number of Valid Clock Times πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2436 Minimum Split Into Subarrays With GCD Greater Than One πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2435 Paths in Matrix Whose Sum Is Divisible by K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2434 Using a Robot to Print the Lexicographically Smallest String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2433 Find The Original Array of Prefix Xor πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2432 The Employee That Worked on the Longest Task πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2431 Maximize Total Tastiness of Purchased Fruits πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2430 Maximum Deletions on a String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2429 Minimize XOR πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2428 Maximum Sum of an Hourglass πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2427 Number of Common Factors πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Easy
βœ”οΈ 2426 Number of Pairs Satisfying Inequality πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2425 Bitwise XOR of All Pairings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2424 Longest Uploaded Prefix πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2423 Remove Letter To Equalize Frequency πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2422 Merge Operations to Turn Array Into a Palindrome πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2421 Number of Good Paths πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2420 Find All Good Indices πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2419 Longest Subarray With Maximum Bitwise AND πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2418 Sort the People πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2417 Closest Fair Integer πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2416 Sum of Prefix Scores of Strings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2415 Reverse Odd Levels of Binary Tree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, ts Medium
βœ”οΈ 2414 Length of the Longest Alphabetical Continuous Substring πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2413 Smallest Even Multiple πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ cpp Easy
βœ”οΈ 2412 Minimum Money Required Before Transactions πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2411 Smallest Subarrays With Maximum Bitwise OR πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2410 Maximum Matching of Players With Trainers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2409 Count Days Spent Together πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Easy
πŸ”’ 2408 Design SQL πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈβ­ 2407 Longest Increasing Subsequence II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Hard
βœ”οΈ 2406 Divide Intervals Into Minimum Number of Groups πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2405 Optimal Partition of String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2404 Most Frequent Even Element πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2403 Minimum Time to Kill All Monsters πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2402 Meeting Rooms III πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2401 Longest Nice Subarray πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2400 Number of Ways to Reach a Position After Exactly k Steps πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2399 Check Distances Between Same Letters πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Easy
βœ”οΈ 2398 Maximum Number of Robots Within Budget πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Hard
βœ”οΈ 2397 Maximum Rows Covered by Columns πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2396 Strictly Palindromic Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2395 Find Subarrays With Equal Sum πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Easy
πŸ”’ sql 2394 Employees With Deductions πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2393 Count Strictly Increasing Subarrays πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2392 Build a Matrix With Conditions πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Hard
βœ”οΈ 2391 Minimum Amount of Time to Collect Garbage πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2390 Removing Stars From a String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2389 Longest Subsequence With Limited Sum πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ sql 2388 Change Null Values in a Table to the Previous Value πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2387 Median of a Row Wise Sorted Matrix πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2386 Find the K-Sum of an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2385 Amount of Time for Binary Tree to Be Infected πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2384 Largest Palindromic Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2383 Minimum Hours of Training to Win a Competition πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2382 Maximum Segment Sum After Removals πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, ts Hard
βœ”οΈ 2381 Shifting Letters II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2380 Time Needed to Rearrange a Binary String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2379 Minimum Recolors to Get K Consecutive Black Blocks πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2378 Choose Edges to Maximize Score in a Tree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2377 Sort the Olympic Table πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
βœ”οΈ 2376 Count Special Integers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2375 Construct Smallest Number From DI String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2374 Node With Highest Edge Score πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2373 Largest Local Values in a Matrix πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ sql 2372 Calculate the Influence of Each Salesperson πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2371 Minimize Maximum Value in a Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2370 Longest Ideal Subsequence πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2369 Check if There is a Valid Partition For The Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2368 Reachable Nodes With Restrictions πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2367 Number of Arithmetic Triplets πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts, ts Easy
βœ”οΈ 2366 Minimum Replacements to Sort the Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2365 Task Scheduler II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2364 Count Number of Bad Pairs πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2363 Merge Similar Items πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2362 Generate the Invoice πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
πŸ”’ 2361 Minimum Costs Using the Train Line πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2360 Longest Cycle in a Graph πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2359 Find Closest Node to Given Two Nodes πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2358 Maximum Number of Groups Entering a Competition πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2357 Make Array Zero by Subtracting Equal Amounts πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
sql 2356 Number of Unique Subjects Taught by Each Teacher πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
πŸ”’ 2355 Maximum Number of Books You Can Take πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2354 Number of Excellent Pairs πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2353 Design a Food Rating System πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2352 Equal Row and Column Pairs πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2351 First Letter to Appear Twice πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2350 Shortest Impossible Sequence of Rolls πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2349 Design a Number Container System πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2348 Number of Zero-Filled Subarrays πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2347 Best Poker Hand πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2346 Compute the Rank as a Percentage πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2345 Finding the Number of Visible Mountains πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2344 Minimum Deletions to Make Array Divisible πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2343 Query Kth Smallest Trimmed Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2342 Max Sum of a Pair With Equal Sum of Digits πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2341 Maximum Number of Pairs in Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2340 Minimum Adjacent Swaps to Make a Valid Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2339 All the Matches of the League πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
2338 Count the Number of Ideal Arrays πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
2337 Move Pieces to Obtain a String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
2336 Smallest Number in Infinite Set πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
2335 Minimum Amount of Time to Fill Cups πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
βœ”οΈ 2334 Subarray With Elements Greater Than Varying Threshold πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c, py Hard
βœ”οΈ 2333 Minimum Sum of Squared Difference πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2332 The Latest Time to Catch a Bus πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2331 Evaluate Boolean Binary Tree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Easy
πŸ”’ 2330 Valid Palindrome IV πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2329 Product Sales Analysis V πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
βœ”οΈ 2328 Number of Increasing Paths in a Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2327 Number of People Aware of a Secret πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2326 Spiral Matrix IV πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2325 Decode the Message πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2324 Product Sales Analysis IV πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2323 Find Minimum Time to Finish All Jobs II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
2322 Minimum Score After Removals on a Tree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2321 Maximum Score Of Spliced Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2320 Count Number of Ways to Place Houses πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2319 Check if Matrix Is X-Matrix πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2318 Number of Distinct Roll Sequences πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2317 Maximum XOR After Operations πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2316 Count Unreachable Pairs of Nodes in an Undirected Graph πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2315 Count Asterisks πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2314 The First Day of the Maximum Recorded Degree in Each City πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2313 Minimum Flips in Binary Tree to Get Result πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2312 Selling Pieces of Wood πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2311 Longest Binary Subsequence Less Than or Equal to K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2310 Sum of Numbers With Units Digit K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2309 Greatest English Letter in Upper and Lower Case πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ sql 2308 Arrange Table by Gender πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2307 Check for Contradictions in Equations πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2306 Naming a Company πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2305 Fair Distribution of Cookies πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2304 Minimum Path Cost in a Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2303 Calculate Amount Paid in Taxes πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2302 Count Subarrays With Score Less Than K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2301 Match Substring After Replacement πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2300 Successful Pairs of Spells and Potions πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2299 Strong Password Checker II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2298 Tasks Count in the Weekend πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2297 Jump Game VIII πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2296 Design a Text Editor πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Hard
βœ”οΈ 2295 Replace Elements in an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2294 Partition Array Such That Maximum Difference Is K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2293 Min Max Game πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2292 Products With Three or More Orders in Two Consecutive Years πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2291 Maximum Profit From Trading Stocks πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2290 Minimum Obstacle Removal to Reach Corner πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2289 Steps to Make Array Non-decreasing πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ js, py Medium
βœ”οΈ 2288 Apply Discount to Prices πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2287 Rearrange Characters to Make Target String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
βœ”οΈ 2286 Booking Concert Tickets in Groups πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2285 Maximum Total Importance of Roads πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2284 Sender With Largest Word Count πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2283 Check if Number Has Equal Digit Count and Digit Value πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2282 Number of People That Can Be Seen in a Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2281 Sum of Total Strength of Wizards πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2280 Minimum Lines to Represent a Line Chart πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2279 Maximum Bags With Full Capacity of Rocks πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2278 Percentage of Letter in String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2277 Closest Node to Path in Tree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2276 Count Integers in Intervals πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2275 Largest Combination With Bitwise AND Greater Than Zero πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2274 Maximum Consecutive Floors Without Special Floors πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2273 Find Resultant Array After Removing Anagrams πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
βœ”οΈ 2272 Substring With Largest Variance πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2271 Maximum White Tiles Covered by a Carpet πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2270 Number of Ways to Split Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2269 Find the K-Beauty of a Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2268 Minimum Number of Keypresses πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2267 Check if There Is a Valid Parentheses String Path πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2266 Count Number of Texts πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2265 Count Nodes Equal to Average of Subtree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2264 Largest 3-Same-Digit Number in String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2263 Make Array Non-decreasing or Non-increasing πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2262 Total Appeal of A String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2261 K Divisible Elements Subarrays πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2260 Minimum Consecutive Cards to Pick Up πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2259 Remove Digit From Number to Maximize Result πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2258 Escape the Spreading Fire πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2257 Count Unguarded Cells in the Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2256 Minimum Average Difference πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2255 Count Prefixes of a Given String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2254 Design Video Sharing Platform πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
πŸ”’ sql 2253 Dynamic Unpivoting of a Table πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
πŸ”’ sql 2252 Dynamic Pivoting of a Table πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2251 Number of Flowers in Full Bloom πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2250 Count Number of Rectangles Containing Each Point πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2249 Count Lattice Points Inside a Circle πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2248 Intersection of Multiple Arrays πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2247 Maximum Cost of Trip With K Highways πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2246 Longest Path With Different Adjacent Characters πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2245 Maximum Trailing Zeros in a Cornered Path πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2244 Minimum Rounds to Complete All Tasks πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2243 Calculate Digit Sum of a String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2242 Maximum Score of a Node Sequence πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2241 Design an ATM Machine πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2240 Number of Ways to Buy Pens and Pencils πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2239 Find Closest Number to Zero πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2238 Number of Times a Driver Was a Passenger πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2237 Count Positions on Street With Required Brightness πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2236 Root Equals Sum of Children πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2235 Add Two Integers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2234 Maximum Total Beauty of the Gardens πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2233 Maximum Product After K Increments πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2232 Minimize Result by Adding Parentheses to Expression πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2231 Largest Number After Digit Swaps by Parity πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2230 The Users That Are Eligible for Discount πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
πŸ”’ 2229 Check if an Array Is Consecutive πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
πŸ”’ sql 2228 Users With Two Purchases Within Seven Days πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2227 Encrypt and Decrypt Strings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2226 Maximum Candies Allocated to K Children πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2225 Find Players With Zero or One Losses πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2224 Minimum Number of Operations to Convert Time πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
2223 Sum of Scores of Built Strings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2222 Number of Ways to Select Buildings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2221 Find Triangular Sum of an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2220 Minimum Bit Flips to Convert Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈπŸ”’ 2219 Maximum Sum Score of Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2218 Maximum Value of K Coins From Piles πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2217 Find Palindrome With Fixed Length πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2216 Minimum Deletions to Make Array Beautiful πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2215 Find the Difference of Two Arrays πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2214 Minimum Health to Beat Game πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2213 Longest Substring of One Repeating Character πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2212 Maximum Points in an Archery Competition πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2211 Count Collisions on a Road πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2210 Count Hills and Valleys in an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
βœ”οΈ 2209 Minimum White Tiles After Covering With Carpets πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2208 Minimum Operations to Halve Array Sum πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2207 Maximize Number of Subsequences in a String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2206 Divide Array Into Equal Pairs πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2205 The Number of Users That Are Eligible for Discount πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
πŸ”’ 2204 Distance to a Cycle in Undirected Graph πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2203 Minimum Weighted Subgraph With the Required Paths πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2202 Maximize the Topmost Element After K Moves πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2201 Count Artifacts That Can Be Extracted πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2200 Find All K-Distant Indices in an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2199 Finding the Topic of Each Post πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
πŸ”’ 2198 Number of Single Divisor Triplets πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2197 Replace Non-Coprime Numbers in Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2196 Create Binary Tree From Descriptions πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2195 Append K Integers With Minimal Sum πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2194 Cells in a Range on an Excel Sheet πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
βœ”οΈ 2193 Minimum Number of Moves to Make Palindrome πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts, ts Hard
βœ”οΈ 2192 All Ancestors of a Node in a Directed Acyclic Graph πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2191 Sort the Jumbled Numbers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2190 Most Frequent Number Following Key In an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2189 Number of Ways to Build House of Cards πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2188 Minimum Time to Finish the Race πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2187 Minimum Time to Complete Trips πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2186 Minimum Number of Steps to Make Two Strings Anagram II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2185 Counting Words With a Given Prefix πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2184 Number of Ways to Build Sturdy Brick Wall πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2183 Count Array Pairs Divisible by K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2182 Construct String With Repeat Limit πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2181 Merge Nodes in Between Zeros πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2180 Count Integers With Even Digit Sum πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2179 Count Good Triplets in an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2178 Maximum Split of Positive Even Integers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2177 Find Three Consecutive Integers That Sum to a Given Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2176 Count Equal and Divisible Pairs in an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2175 The Change in Global Rankings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2174 Remove All Ones With Row and Column Flips II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2173 Longest Winning Streak πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2172 Maximum AND Sum of Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2171 Removing Minimum Number of Magic Beans πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2170 Minimum Operations to Make the Array Alternating πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2169 Count Operations to Obtain Zero πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Easy
πŸ”’ 2168 Unique Substrings With Equal Digit Frequency πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2167 Minimum Time to Remove All Cars Containing Illegal Goods πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java, ts Hard
βœ”οΈ 2166 Design Bitset πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java, java Medium
βœ”οΈ 2165 Smallest Value of the Rearranged Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2164 Sort Even and Odd Indices Independently πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
βœ”οΈ 2163 Minimum Difference in Sums After Removal of Elements πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Hard
βœ”οΈ 2162 Minimum Cost to Set Cooking Time πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2161 Partition Array According to Given Pivot πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2160 Minimum Sum of Four Digit Number After Splitting Digits πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2159 Order Two Columns Independently πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2158 Amount of New Area Painted Each Day πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2157 Groups of Strings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2156 Find Substring With Given Hash Value πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2155 All Divisions With the Highest Score of a Binary Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2154 Keep Multiplying Found Values by Two πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2153 The Number of Passengers in Each Bus II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
πŸ”’ 2152 Minimum Number of Lines to Cover Points πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2151 Maximum Good People Based on Statements πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2150 Find All Lonely Numbers in the Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2149 Rearrange Array Elements by Sign πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts, ts Medium
βœ”οΈ 2148 Count Elements With Strictly Smaller and Greater Elements πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2147 Number of Ways to Divide a Long Corridor πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2146 K Highest Ranked Items Within a Price Range πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2145 Count the Hidden Sequences πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2144 Minimum Cost of Buying Candies With Discount πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2143 Choose Numbers From Two Arrays in Range πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
πŸ”’ sql 2142 The Number of Passengers in Each Bus I πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2141 Maximum Running Time of N Computers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2140 Solving Questions With Brainpower πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2139 Minimum Moves to Reach Target Score πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2138 Divide a String Into Groups of Size k πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2137 Pour Water Between Buckets to Make Water Levels Equal πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2136 Earliest Possible Day of Full Bloom πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2135 Count Words Obtained After Adding a Letter πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2134 Minimum Swaps to Group All 1's Together II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2133 Check if Every Row and Column Contains All Numbers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
2132 Stamping the Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2131 Longest Palindrome by Concatenating Two Letter Words πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2130 Maximum Twin Sum of a Linked List πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2129 Capitalize the Title πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Easy
πŸ”’ 2128 Remove All Ones With Row and Column Flips πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2127 Maximum Employees to Be Invited to a Meeting πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2126 Destroying Asteroids πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2125 Number of Laser Beams in a Bank πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, ts Medium
βœ”οΈ 2124 Check if All A's Appears Before All B's πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2123 Minimum Operations to Remove Adjacent Ones in Matrix πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
2122 Recover the Original Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
2121 Intervals Between Identical Elements πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2120 Execution of All Suffix Instructions Staying in a Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2119 A Number After a Double Reversal πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2118 Build the Equation πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2117 Abbreviating the Product of a Range πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2116 Check if a Parentheses String Can Be Valid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2115 Find All Possible Recipes from Given Supplies πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2114 Maximum Number of Words Found in Sentences πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2113 Elements in Array After Removing and Replacing Elements πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2112 The Airport With the Most Traffic πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2111 Minimum Operations to Make the Array K-Increasing πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2110 Number of Smooth Descent Periods of a Stock πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2109 Adding Spaces to a String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2108 Find First Palindromic String in the Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2107 Number of Unique Flavors After Sharing K Candies πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2106 Maximum Fruits Harvested After at Most K Steps πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Hard
βœ”οΈ 2105 Watering Plants II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2104 Sum of Subarray Ranges πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2103 Rings and Rods πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2102 Sequentially Ordinal Rank Tracker πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Hard
βœ”οΈ 2101 Detonate the Maximum Bombs πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2100 Find Good Days to Rob the Bank πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2099 Find Subsequence of Length K With the Largest Sum πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2098 Subsequence of Size K With the Largest Even Sum πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2097 Valid Arrangement of Pairs πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2096 Step-By-Step Directions From a Binary Tree Node to Another πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2095 Delete the Middle Node of a Linked List πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2094 Finding 3-Digit Even Numbers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2093 Minimum Cost to Reach City With Discounts πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2092 Find All People With Secret πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2091 Removing Minimum and Maximum From Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2090 K Radius Subarray Averages πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2089 Find Target Indices After Sorting Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2088 Count Fertile Pyramids in a Land πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2087 Minimum Cost Homecoming of a Robot in a Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2086 Minimum Number of Food Buckets to Feed the Hamsters πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2085 Count Common Words With One Occurrence πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2084 Drop Type 1 Orders for Customers With Type 0 Orders πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ 2083 Substrings That Begin and End With the Same Letter πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2082 The Number of Rich Customers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
βœ”οΈ 2081 Sum of k-Mirror Numbers πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2080 Range Frequency Queries πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2079 Watering Plants πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2078 Two Furthest Houses With Different Colors πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2077 Paths in Maze That Lead to Same Room πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2076 Process Restricted Friend Requests πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Hard
βœ”οΈ 2075 Decode the Slanted Ciphertext πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2074 Reverse Nodes in Even Length Groups πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2073 Time Needed to Buy Tickets πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2072 The Winner University πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
βœ”οΈ 2071 Maximum Number of Tasks You Can Assign πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2070 Most Beautiful Item for Each Query πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2069 Walking Robot Simulation II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2068 Check Whether Two Strings are Almost Equivalent πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2067 Number of Equal Count Substrings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2066 Account Balance πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2065 Maximum Path Quality of a Graph πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2064 Minimized Maximum of Products Distributed to Any Store πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2063 Vowels of All Substrings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2062 Count Vowel Substrings of a String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, ts Easy
πŸ”’ 2061 Number of Spaces Cleaning Robot Cleaned πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2060 Check if an Original String Exists Given Two Encoded Strings πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2059 Minimum Operations to Convert Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2058 Find the Minimum and Maximum Number of Nodes Between Critical Points πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2057 Smallest Index With Equal Value πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
βœ”οΈ 2056 Number of Valid Move Combinations On Chessboard πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2055 Plates Between Candles πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, ts Medium
βœ”οΈ 2054 Two Best Non-Overlapping Events πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2053 Kth Distinct String in an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2052 Minimum Cost to Separate Sentence Into Rows πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2051 The Category of Each Member in the Store πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2050 Parallel Courses III πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2049 Count Nodes With the Highest Score πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2048 Next Greater Numerically Balanced Number πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2047 Number of Valid Words in a Sentence πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, ts Easy
πŸ”’ 2046 Sort Linked List Already Sorted Using Absolute Values πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2045 Second Minimum Time to Reach Destination πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2044 Count Number of Maximum Bitwise-OR Subsets πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2043 Simple Bank System πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2042 Check if Numbers Are Ascending in a Sentence πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, rb Easy
πŸ”’ sql 2041 Accepted Candidates From the Interviews πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈβ­ 2040 Kth Smallest Product of Two Sorted Arrays πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2039 The Time When the Network Becomes Idle πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2038 Remove Colored Pieces if Both Neighbors are the Same Color πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2037 Minimum Number of Moves to Seat Everyone πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ rb Easy
πŸ”’ 2036 Maximum Alternating Subarray Sum πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2035 Partition Array Into Two Arrays to Minimize Sum Difference πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2034 Stock Price Fluctuation πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2033 Minimum Operations to Make a Uni-Value Grid πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2032 Two Out of Three πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py, py Easy
πŸ”’ 2031 Count Subarrays With More Ones Than Zeros πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
2030 Smallest K-Length Subsequence With Occurrences of a Letter πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2029 Stone Game IX πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2028 Find Missing Observations πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2027 Minimum Moves to Convert String πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ sql 2026 Low-Quality Problems πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Easy
2025 Maximum Number of Ways to Partition an Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2024 Maximize the Confusion of an Exam πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Medium
βœ”οΈ 2023 Number of Pairs of Strings With Concatenation Equal to Target πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2022 Convert 1D Array Into 2D Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ ts Easy
πŸ”’ 2021 Brightest Position on Street πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
πŸ”’ sql 2020 Number of Accounts That Did Not Stream πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
βœ”οΈ 2019 The Score of Students Solving Math Expression πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Hard
βœ”οΈ 2018 Check if Word Can Be Placed In Crossword πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2017 Grid Game πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2016 Maximum Difference Between Increasing Elements πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2015 Average Height of Buildings in Each Segment πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Medium
2014 Longest Subsequence Repeated k Times πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2013 Detect Squares πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ java Medium
βœ”οΈ 2012 Sum of Beauty in the Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2011 Final Value of Variable After Performing Operations πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Easy
πŸ”’ sql 2010 The Number of Seniors and Juniors to Join the Company II πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2009 Minimum Number of Operations to Make Array Continuous πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Hard
βœ”οΈ 2008 Maximum Earnings From Taxi πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ c Medium
βœ”οΈ 2007 Find Original Array From Doubled Array πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2006 Count Number of Pairs With Absolute Difference K πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Easy
πŸ”’ 2005 Subtree Removal Game with Fibonacci Tree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
πŸ”’ sql 2004 The Number of Seniors and Juniors to Join the Company πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
2003 Smallest Missing Genetic Value in Each Subtree πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ Hard
βœ”οΈ 2002 Maximum Product of the Length of Two Palindromic Subsequences πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium
βœ”οΈ 2001 Number of Pairs of Interchangeable Rectangles πŸ‡ΊπŸ‡Έ πŸ‡¨πŸ‡³ py Medium