βοΈ |
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 |