3611 | Find Overbooked Employees | Medium | Database | 516 | 100.00 |
3609 | Minimum Moves to Reach Target in Grid | Hard | Math | 1 | 100.00 |
3608 | Minimum Time for K Connected Components | Medium | Sorting, Binary_Search, Graph, Union_Find | 31 | 100.00 |
3607 | Power Grid Maintenance | Medium | Array, Hash_Table, Depth_First_Search, Breadth_First_Search, Heap_Priority_Queue, Graph, Union_Find, Ordered_Set | 91 | 100.00 |
3606 | Coupon Code Validator | Easy | Array, String, Hash_Table, Sorting | 32 | 100.00 |
3605 | Minimum Stability Factor of Array | Hard | Array, Math, Greedy, Binary_Search, Segment_Tree, Number_Theory | 95 | 100.00 |
3604 | Minimum Time to Reach Destination in Directed Graph | Medium | Heap_Priority_Queue, Graph, Shortest_Path | 18 | 100.00 |
3603 | Minimum Cost Path with Alternating Directions II | Medium | Array, Dynamic_Programming, Matrix | 12 | 100.00 |
3602 | Hexadecimal and Hexatrigesimal Conversion | Easy | String, Math | 2 | 100.00 |
3601 | Find Drivers with Improved Fuel Efficiency | Medium | Database | 521 | 62.61 |
3600 | Maximize Spanning Tree Stability with Upgrades | Hard | Greedy, Binary_Search, Graph, Union_Find, Minimum_Spanning_Tree | 34 | 100.00 |
3599 | Partition Array to Minimize XOR | Medium | Array, Dynamic_Programming, Bit_Manipulation, Prefix_Sum | 136 | 100.00 |
3598 | Longest Common Prefix Between Adjacent Strings After Removals | Medium | Array, String | 28 | 71.43 |
3597 | Partition String | Medium | String, Hash_Table, Simulation, Trie | 43 | 100.00 |
3594 | Minimum Time to Transport All Individuals | Hard | Array, Dynamic_Programming, Bit_Manipulation, Heap_Priority_Queue, Graph, Bitmask, Shortest_Path | 213 | 100.00 |
3593 | Minimum Increments to Equalize Leaf Paths | Medium | Array, Dynamic_Programming, Depth_First_Search, Tree | 37 | 100.00 |
3592 | Inverse Coin Change | Easy | Array, Dynamic_Programming | 2 | 100.00 |
3591 | Check if Any Element Has Prime Frequency | Easy | Array, Hash_Table, Math, Counting, Number_Theory | 1 | 100.00 |
3590 | Kth Smallest Path XOR Sum | Hard | Array, Depth_First_Search, Tree, Ordered_Set | 395 | 100.00 |
3589 | Count Prime-Gap Balanced Subarrays | Medium | Array, Math, Sliding_Window, Queue, Number_Theory, Monotonic_Queue | 341 | 100.00 |
3588 | Find Maximum Area of a Triangle | Medium | Array, Hash_Table, Math, Greedy, Enumeration, Geometry | 470 | 100.00 |
3587 | Minimum Adjacent Swaps to Alternate Parity | Medium | Array, Greedy | 38 | 100.00 |
3586 | Find COVID Recovery Patients | Medium | Database | 471 | 97.17 |
3585 | Find Weighted Median Node in Tree | Hard | Array, Dynamic_Programming, Depth_First_Search, Tree, Binary_Search | 123 | 100.00 |
3584 | Maximum Product of First and Last Elements of a Subsequence | Medium | Array, Two_Pointers | 8 | 100.00 |
3583 | Count Special Triplets | Medium | Array, Hash_Table, Counting | 238 | 55.56 |
3582 | Generate Tag for Video Caption | Easy | String, Simulation | 3 | 100.00 |
3580 | Find Consistently Improving Employees | Medium | Database | 449 | 91.67 |
3579 | Minimum Steps to Convert String with Operations | Hard | String, Dynamic_Programming, Greedy | 107 | 100.00 |
3578 | Count Partitions With Max-Min Difference at Most K | Medium | Array, Dynamic_Programming, Prefix_Sum, Sliding_Window, Queue, Monotonic_Queue | 33 | 100.00 |
3577 | Count the Number of Computer Unlocking Permutations | Medium | Array, Math, Combinatorics, Brainteaser | 2 | 100.00 |
3576 | Transform Array to All Equal Elements | Medium | Array, Greedy | 11 | 92.31 |
3575 | Maximum Good Subtree Score | Hard | Array, Dynamic_Programming, Depth_First_Search, Tree, Bit_Manipulation, Bitmask | 71 | 100.00 |
3574 | Maximize Subarray GCD Score | Hard | Array, Math, Enumeration, Number_Theory | 19 | 100.00 |
3573 | Best Time to Buy and Sell Stock V | Medium | Array, Dynamic_Programming | 27 | 100.00 |
3572 | Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | Medium | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue | 5 | 100.00 |
3570 | Find Books with No Available Copies | Easy | Database | 512 | 100.00 |
3569 | Maximize Count of Distinct Primes After Split | Hard | Array, Math, Segment_Tree, Number_Theory | 441 | 100.00 |
3568 | Minimum Moves to Clean the Classroom | Medium | Array, Hash_Table, Breadth_First_Search, Matrix, Bit_Manipulation | 149 | 100.00 |
3567 | Minimum Absolute Difference in Sliding Submatrix | Medium | Array, Sorting, Matrix | 18 | 100.00 |
3566 | Partition Array into Two Equal Product Subsets | Medium | Array, Bit_Manipulation, Recursion, Enumeration | 1 | 100.00 |
3564 | Seasonal Sales Analysis | Medium | Database | 505 | 100.00 |
3563 | Lexicographically Smallest String After Adjacent Removals | Hard | String, Dynamic_Programming | 186 | 100.00 |
3562 | Maximum Profit from Trading Stocks with Discounts | Hard | Array, Dynamic_Programming, Depth_First_Search, Tree | 40 | 100.00 |
3561 | Resulting String After Adjacent Removals | Medium | String, Stack, Simulation | 43 | 100.00 |
3560 | Find Minimum Log Transportation Cost | Easy | Math | 0 | 100.00 |
3559 | Number of Ways to Assign Edge Weights II | Hard | Array, Dynamic_Programming, Math, Depth_First_Search, Tree | 197 | 100.00 |
3558 | Number of Ways to Assign Edge Weights I | Medium | Math, Depth_First_Search, Tree | 21 | 100.00 |
3557 | Find Maximum Number of Non Intersecting Substrings | Medium | String, Hash_Table, Dynamic_Programming, Greedy | 28 | 70.59 |
3556 | Sum of Largest Prime Substrings | Medium | String, Hash_Table, Math, Sorting, Number_Theory | 25 | 100.00 |
3554 | Find Category Recommendation Pairs | Hard | Database | 623 | 82.76 |
3553 | Minimum Weighted Subgraph With the Required Paths II | Hard | Array, Depth_First_Search, Tree | 142 | 100.00 |
3552 | Grid Teleportation Traversal | Medium | Array, Hash_Table, Breadth_First_Search, Matrix | 147 | 100.00 |
3551 | Minimum Swaps to Sort by Digit Sum | Medium | Array, Hash_Table, Sorting | 481 | 83.33 |
3550 | Smallest Index With Digit Sum Equal to Index | Easy | Array, Math | 1 | 100.00 |
3548 | Equal Sum Grid Partition II | Hard | Array, Hash_Table, Matrix, Prefix_Sum, Enumeration | 61 | 100.00 |
3547 | Maximum Sum of Edge Values in a Graph | Hard | Sorting, Depth_First_Search, Greedy, Graph | 61 | 100.00 |
3546 | Equal Sum Grid Partition I | Medium | Array, Matrix, Prefix_Sum, Enumeration | 7 | 82.61 |
3545 | Minimum Deletions for At Most K Distinct Characters | Easy | String, Hash_Table, Sorting, Greedy, Counting | 3 | 100.00 |
3544 | Subtree Inversion Sum | Hard | Array, Dynamic_Programming, Depth_First_Search, Tree | 114 | 100.00 |
3543 | Maximum Weighted K-Edge Path | Medium | Hash_Table, Dynamic_Programming, Graph | 29 | 100.00 |
3542 | Minimum Operations to Convert All Elements to Zero | Medium | Array, Hash_Table, Greedy, Stack, Monotonic_Stack | 11 | 100.00 |
3541 | Find Most Frequent Vowel and Consonant | Easy | String, Hash_Table, Counting | 8 | 100.00 |
3539 | Find Sum of Array Product of Magical Sequences | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Bitmask, Combinatorics | 60 | 100.00 |
3538 | Merge Operations for Minimum Travel Time | Hard | Array, Dynamic_Programming, Prefix_Sum | 10 | 100.00 |
3537 | Fill a Special Grid | Medium | Array, Matrix, Divide_and_Conquer | 2 | 100.00 |
3536 | Maximum Product of Two Digits | Easy | Math, Sorting | 1 | 100.00 |
3534 | Path Existence Queries in a Graph II | Hard | Array, Sorting, Greedy, Binary_Search, Graph | 152 | 100.00 |
3533 | Concatenated Divisibility | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 20 | 100.00 |
3532 | Path Existence Queries in a Graph I | Medium | Array, Binary_Search, Graph, Union_Find | 5 | 90.91 |
3531 | Count Covered Buildings | Medium | Array, Hash_Table, Sorting | 34 | 100.00 |
3530 | Maximum Profit from Valid Topological Order in DAG | Hard | Array, Dynamic_Programming, Bit_Manipulation, Graph, Bitmask, Topological_Sort | 833 | 100.00 |
3529 | Count Cells in Overlapping Horizontal and Vertical Substrings | Medium | Array, String, Matrix, Hash_Function, String_Matching, Rolling_Hash | 51 | 100.00 |
3528 | Unit Conversion I | Medium | Depth_First_Search, Breadth_First_Search, Graph | 3 | 100.00 |
3527 | Find the Most Common Response | Medium | Array, String, Hash_Table, Counting | 73 | 100.00 |
3525 | Find X Value of Array II | Hard | Array, Math, Segment_Tree | 237 | 50.00 |
3524 | Find X Value of Array I | Medium | Array, Dynamic_Programming, Math | 12 | 100.00 |
3523 | Make Array Non-decreasing | Medium | Array, Greedy, Stack, Monotonic_Stack | 4 | 75.00 |
3522 | Calculate Score After Performing Instructions | Medium | Array, String, Hash_Table, Simulation | 3 | 100.00 |
3521 | Find Product Recommendation Pairs | Medium | Database | 611 | 70.71 |
3519 | Count Numbers with Non-Decreasing Digits | Hard | String, Dynamic_Programming, Math | 31 | 100.00 |
3518 | Smallest Palindromic Rearrangement II | Hard | String, Hash_Table, Math, Counting, Combinatorics | 27 | 100.00 |
3517 | Smallest Palindromic Rearrangement I | Medium | String, Sorting, Counting_Sort | 49 | 100.00 |
3516 | Find Closest Person | Easy | Math | 1 | 100.00 |
3515 | Shortest Path in a Weighted Tree | Hard | Array, Depth_First_Search, Tree, Segment_Tree, Binary_Indexed_Tree | 45 | 100.00 |
3514 | Number of Unique XOR Triplets II | Medium | Array, Math, Bit_Manipulation, Enumeration | 778 | 100.00 |
3513 | Number of Unique XOR Triplets I | Medium | Array, Math, Bit_Manipulation | 1 | 100.00 |
3512 | Minimum Operations to Make Array Sum Divisible by K | Easy | Array, Math | 1 | 100.00 |
3510 | Minimum Pair Removal to Sort Array II | Hard | Array, Hash_Table, Heap_Priority_Queue, Simulation, Linked_List, Ordered_Set, Doubly_Linked_List | 172 | 100.00 |
3509 | Maximum Product of Subsequences With an Alternating Sum Equal to K | Hard | Array, Hash_Table, Dynamic_Programming | 99 | 96.30 |
3508 | Implement Router | Medium | Array, Hash_Table, Binary_Search, Design, Ordered_Set, Queue | 202 | 100.00 |
3507 | Minimum Pair Removal to Sort Array I | Easy | Array, Hash_Table, Heap_Priority_Queue, Simulation, Linked_List, Ordered_Set, Doubly_Linked_List | 2 | 100.00 |
3505 | Minimum Operations to Make Elements Within K Subarrays Equal | Hard | Array, Hash_Table, Dynamic_Programming, Math, Heap_Priority_Queue, Sliding_Window | 537 | 100.00 |
3504 | Longest Palindrome After Substring Concatenation II | Hard | String, Dynamic_Programming, Two_Pointers | 59 | 100.00 |
3503 | Longest Palindrome After Substring Concatenation I | Medium | String, Dynamic_Programming, Two_Pointers, Enumeration | 42 | 83.33 |
3502 | Minimum Cost to Reach Every Position | Easy | Array | 1 | 100.00 |
3501 | Maximize Active Section with Trade II | Hard | Array, String, Binary_Search, Segment_Tree | 259 | 100.00 |
3500 | Minimum Cost to Divide Array Into Subarrays | Hard | Array, Dynamic_Programming, Prefix_Sum | 28 | 92.31 |
3499 | Maximize Active Section with Trade I | Medium | String, Enumeration | 52 | 73.08 |
3498 | Reverse Degree of a String | Easy | String, Simulation | 2 | 87.18 |
3497 | Analyze Subscription Conversion | Medium | Database | 347 | 100.00 |
3495 | Minimum Operations to Make Array Elements Zero | Hard | Array, Math, Bit_Manipulation | 12 | 100.00 |
3494 | Find the Minimum Amount of Time to Brew Potions | Medium | Array, Simulation, Prefix_Sum | 70 | 100.00 |
3493 | Properties Graph | Medium | Array, Hash_Table, Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 45 | 100.00 |
3492 | Maximum Containers on a Ship | Easy | Math | 0 | 100.00 |
3490 | Count Beautiful Numbers | Hard | Dynamic_Programming | 246 | 100.00 |
3489 | Zero Array Transformation IV | Medium | Array, Dynamic_Programming | 104 | 100.00 |
3488 | Closest Equal Element Queries | Medium | Array, Hash_Table, Binary_Search | 93 | 100.00 |
3487 | Maximum Unique Subarray Sum After Deletion | Easy | Array, Hash_Table, Greedy | 4 | 100.00 |
3486 | Longest Special Path II | Hard | Array, Hash_Table, Depth_First_Search, Tree, Prefix_Sum | 255 | 100.00 |
3485 | Longest Common Prefix of K Strings After Removal | Hard | Array, String, Trie | 251 | 100.00 |
3484 | Design Spreadsheet | Medium | Array, String, Hash_Table, Matrix, Design | 176 | 100.00 |
3483 | Unique 3-Digit Even Numbers | Easy | Array, Hash_Table, Recursion, Enumeration | 6 | 100.00 |
3482 | Analyze Organization Hierarchy | Hard | Database | 294 | 80.03 |
3480 | Maximize Subarrays After Removing One Conflicting Pair | Hard | Array, Prefix_Sum, Enumeration, Segment_Tree | 48 | 100.00 |
3479 | Fruits Into Baskets III | Medium | Array, Binary_Search, Ordered_Set, Segment_Tree | 53 | 92.86 |
3478 | Choose K Elements With Maximum Sum | Medium | Array, Sorting, Heap_Priority_Queue | 171 | 95.45 |
3477 | Fruits Into Baskets II | Easy | Array, Binary_Search, Simulation, Segment_Tree | 3 | 100.00 |
3475 | DNA Pattern Recognition | Medium | Database | 362 | 83.49 |
3474 | Lexicographically Smallest Generated String | Hard | String, Greedy, String_Matching | 30 | 100.00 |
3473 | Sum of K Subarrays With Length at Least M | Medium | Array, Dynamic_Programming, Prefix_Sum | 33 | 98.18 |
3472 | Longest Palindromic Subsequence After at Most K Operations | Medium | String, Dynamic_Programming | 142 | 55.00 |
3471 | Find the Largest Almost Missing Integer | Easy | Array, Hash_Table | 6 | 86.49 |
3470 | Permutations IV | Hard | Array, Math, Enumeration, Combinatorics | 4 | 96.77 |
3469 | Find Minimum Cost to Remove Array Elements | Medium | Array, Dynamic_Programming | 27 | 100.00 |
3468 | Find the Number of Copy Arrays | Medium | Array, Math | 3 | 100.00 |
3467 | Transform Array by Parity | Easy | Array, Sorting, Counting | 1 | 100.00 |
3465 | Find Products with Valid Serial Numbers | Easy | Database | 292 | 90.91 |
3464 | Maximize the Distance Between Points on a Square | Hard | Array, Greedy, Binary_Search | 24 | 100.00 |
3463 | Check If Digits Are Equal in String After Operations II | Hard | String, Math, Number_Theory, Combinatorics | 38 | 100.00 |
3462 | Maximum Sum With at Most K Elements | Medium | Array, Sorting, Greedy, Matrix, Heap_Priority_Queue | 139 | 100.00 |
3461 | Check If Digits Are Equal in String After Operations I | Easy | String, Math, Simulation, Number_Theory, Combinatorics | 3 | 100.00 |
3459 | Length of Longest V-Shaped Diagonal Segment | Hard | Array, Dynamic_Programming, Matrix, Memoization | 287 | 100.00 |
3458 | Select K Disjoint Special Substrings | Medium | String, Hash_Table, Dynamic_Programming, Sorting, Greedy | 24 | 100.00 |
3457 | Eat Pizzas! | Medium | Array, Sorting, Greedy | 101 | 90.91 |
3456 | Find Special Substring of Length K | Easy | String | 1 | 100.00 |
3455 | Shortest Matching Substring | Hard | String, Binary_Search, Two_Pointers, String_Matching | 100 | 100.00 |
3454 | Separate Squares II | Hard | Array, Binary_Search, Segment_Tree, Line_Sweep | 277 | 100.00 |
3453 | Separate Squares I | Medium | Array, Binary_Search | 57 | 100.00 |
3452 | Sum of Good Numbers | Easy | Array | 1 | 100.00 |
3451 | Find Invalid IP Addresses | Hard | Database | 309 | 90.61 |
3449 | Maximize the Minimum Game Score | Hard | Array, Greedy, Binary_Search | 123 | 100.00 |
3448 | Count Substrings Divisible By Last Digit | Hard | String, Dynamic_Programming | 28 | 77.78 |
3447 | Assign Elements to Groups with Constraints | Medium | Array, Hash_Table | 24 | 100.00 |
3446 | Sort Matrix by Diagonals | Medium | Array, Sorting, Matrix | 12 | 93.75 |
3445 | Maximum Difference Between Even and Odd Frequency II | Hard | String, Prefix_Sum, Sliding_Window, Enumeration | 84 | 83.33 |
3444 | Minimum Increments for Target Multiples in an Array | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Bitmask, Number_Theory | 34 | 100.00 |
3443 | Maximum Manhattan Distance After K Changes | Medium | String, Hash_Table, Math, Counting | 52 | 100.00 |
3442 | Maximum Difference Between Even and Odd Frequency I | Easy | String, Hash_Table, Counting | 1 | 100.00 |
3441 | Minimum Cost Good Caption | Hard | String, Dynamic_Programming | 48 | 83.33 |
3440 | Reschedule Meetings for Maximum Free Time II | Medium | Array, Greedy, Enumeration | 8 | 100.00 |
3439 | Reschedule Meetings for Maximum Free Time I | Medium | Array, Greedy, Sliding_Window | 5 | 80.00 |
3438 | Find Valid Pair of Adjacent Digits in String | Easy | String, Hash_Table, Counting | 2 | 93.18 |
3436 | Find Valid Emails | Easy | Database | 451 | 70.84 |
3435 | Frequencies of Shortest Supersequences | Hard | Array, String, Bit_Manipulation, Graph, Enumeration, Topological_Sort | 275 | 100.00 |
3434 | Maximum Frequency After Subarray Operation | Medium | Array, Hash_Table, Dynamic_Programming, Greedy, Prefix_Sum | 51 | 100.00 |
3433 | Count Mentions Per User | Medium | Array, Math, Sorting, Simulation | 52 | 100.00 |
3432 | Count Partitions with Even Sum Difference | Easy | Array, Math, Prefix_Sum | 2 | 100.00 |
3430 | Maximum and Minimum Sums of at Most Size K Subarrays | Hard | Array, Math, Stack, Monotonic_Stack | 31 | 100.00 |
3429 | Paint House IV | Medium | Array, Dynamic_Programming | 10 | 100.00 |
3428 | Maximum and Minimum Sums of at Most Size K Subsequences | Medium | Array, Dynamic_Programming, Math, Sorting, Combinatorics | 167 | 77.78 |
3427 | Sum of Variable Length Subarrays | Easy | Array, Prefix_Sum | 0 | 100.00 |
3426 | Manhattan Distances of All Arrangements of Pieces | Hard | Math, Combinatorics | 21 | 100.00 |
3425 | Longest Special Path | Hard | Array, Hash_Table, Depth_First_Search, Tree, Sliding_Window | 59 | 100.00 |
3424 | Minimum Cost to Make Arrays Identical | Medium | Array, Sorting, Greedy | 38 | 100.00 |
3423 | Maximum Difference Between Adjacent Elements in a Circular Array | Easy | Array | 2 | 100.00 |
3421 | Find Students Who Improved | Medium | Database | 466 | 74.56 |
3420 | Count Non-Decreasing Subarrays After K Operations | Hard | Array, Two_Pointers, Stack, Monotonic_Stack, Queue, Segment_Tree, Monotonic_Queue | 28 | 100.00 |
3419 | Minimize the Maximum Edge Weight of Graph | Medium | Depth_First_Search, Breadth_First_Search, Binary_Search, Graph, Shortest_Path | 88 | 100.00 |
3418 | Maximum Amount of Money Robot Can Earn | Medium | Array, Dynamic_Programming, Matrix | 60 | 81.82 |
3417 | Zigzag Grid Traversal With Skip | Easy | Array, Matrix, Simulation | 2 | 100.00 |
3414 | Maximum Score of Non-overlapping Intervals | Hard | Array, Dynamic_Programming, Sorting, Binary_Search | 892 | 100.00 |
3413 | Maximum Coins From K Consecutive Bags | Medium | Array, Sorting, Greedy, Binary_Search, Prefix_Sum, Sliding_Window | 275 | 86.67 |
3412 | Find Mirror Score of a String | Medium | String, Hash_Table, Stack, Simulation | 17 | 96.15 |
3411 | Maximum Subarray With Equal Products | Easy | Array, Math, Sliding_Window, Enumeration, Number_Theory | 7 | 60.71 |
3410 | Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | Array, Dynamic_Programming, Segment_Tree | 80 | 100.00 |
3409 | Longest Subsequence With Decreasing Adjacent Difference | Medium | Array, Dynamic_Programming | 70 | 100.00 |
3408 | Design Task Manager | Medium | Hash_Table, Design, Heap_Priority_Queue, Ordered_Set | 405 | 88.24 |
3407 | Substring Matching Pattern | Easy | String, String_Matching | 2 | 100.00 |
3405 | Count the Number of Arrays with K Matching Adjacent Elements | Hard | Math, Combinatorics | 57 | 100.00 |
3404 | Count Special Subsequences | Medium | Array, Hash_Table, Math, Enumeration | 276 | 100.00 |
3403 | Find the Lexicographically Largest String From the Box I | Medium | String, Two_Pointers, Enumeration | 22 | 100.00 |
3402 | Minimum Operations to Make Columns Strictly Increasing | Easy | Matrix, Simulation | 1 | 100.00 |
3399 | Smallest Substring With Identical Characters II | Hard | Bit_Manipulation, Sliding_Window | 26 | 100.00 |
3398 | Smallest Substring With Identical Characters I | Hard | Array, Binary_Search, Enumeration | 2 | 100.00 |
3397 | Maximum Number of Distinct Elements After Operations | Medium | Array, Sorting, Greedy | 517 | 100.00 |
3396 | Minimum Number of Operations to Make Elements in Array Distinct | Easy | Array, Greedy, Simulation | 9 | 100.00 |
3395 | Subsequences with a Unique Middle Mode I | Hard | Array, Hash_Table, Math, Combinatorics | 49 | 100.00 |
3394 | Check if Grid can be Cut into Sections | Medium | Geometry, Line_Sweep | 61 | 100.00 |
3393 | Count Paths With the Given XOR Value | Medium | Array, Dynamic_Programming, Math, Matrix, Bit_Manipulation | 57 | 68.42 |
3392 | Count Subarrays of Length Three With a Condition | Easy | Array | 3 | 100.00 |
3389 | Minimum Operations to Make Character Frequencies Equal | Hard | String, Hash_Table, Dynamic_Programming, Counting, Enumeration | 9 | 78.95 |
3388 | Count Beautiful Splits in an Array | Medium | Array, Dynamic_Programming | 155 | 100.00 |
3387 | Maximize Amount After Two Days of Conversions | Medium | Array, String, Depth_First_Search, Breadth_First_Search, Graph | 10 | 93.75 |
3386 | Button with Longest Push Time | Easy | Array | 1 | 100.00 |
3382 | Maximum Area Rectangle With Point Constraints II | Hard | Array, Math, Sorting, Geometry, Segment_Tree, Binary_Indexed_Tree | 518 | 100.00 |
3381 | Maximum Subarray Sum With Length Divisible by K | Medium | Array, Hash_Table, Prefix_Sum | 6 | 100.00 |
3380 | Maximum Area Rectangle With Point Constraints I | Medium | Array, Math, Sorting, Enumeration, Geometry, Segment_Tree, Binary_Indexed_Tree | 10 | 94.74 |
3379 | Transformed Array | Easy | Array, Simulation | 206 | 84.38 |
3378 | Count Connected Components in LCM Graph | Hard | Array, Hash_Table, Math, Union_Find, Number_Theory | 58 | 100.00 |
3377 | Digit Operations to Make Two Integers Equal | Medium | Math, Heap_Priority_Queue, Graph, Shortest_Path, Number_Theory | 215 | 100.00 |
3376 | Minimum Time to Break Locks I | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 202 | 100.00 |
3375 | Minimum Operations to Make Array Values Equal to K | Easy | Array, Hash_Table | 191 | 100.00 |
3374 | First Letter Capitalization II | Hard | Database | 261 | 84.21 |
3373 | Maximize the Number of Target Nodes After Connecting Trees II | Hard | Depth_First_Search, Breadth_First_Search, Tree | 26 | 98.75 |
3372 | Maximize the Number of Target Nodes After Connecting Trees I | Medium | Depth_First_Search, Breadth_First_Search, Tree | 50 | 99.49 |
3371 | Identify the Largest Outlier in an Array | Medium | Array, Hash_Table, Counting, Enumeration | 5 | 100.00 |
3370 | Smallest Number With All Set Bits | Easy | Math, Bit_Manipulation | 0 | 100.00 |
3367 | Maximize Sum of Weights after Edge Removals | Hard | Dynamic_Programming, Depth_First_Search, Tree | 113 | 100.00 |
3366 | Minimum Array Sum | Medium | Array, Dynamic_Programming | 15 | 100.00 |
3365 | Rearrange K Substrings to Form Target String | Medium | String, Hash_Table, Sorting | 464 | 100.00 |
3364 | Minimum Positive Sum Subarray | Easy | Array, Prefix_Sum, Sliding_Window | 3 | 98.15 |
3363 | Find the Maximum Number of Fruits Collected | Hard | Array, Dynamic_Programming, Matrix | 39 | 88.89 |
3362 | Zero Array Transformation III | Medium | Array, Sorting, Greedy, Heap_Priority_Queue, Prefix_Sum | 142 | 100.00 |
3361 | Shift Distance Between Two Strings | Medium | Array, String, Prefix_Sum | 350 | 82.50 |
3360 | Stone Removal Game | Easy | Math, Simulation | 0 | 100.00 |
3357 | Minimize the Maximum Adjacent Element Difference | Hard | Array, Greedy, Binary_Search | 13 | 100.00 |
3356 | Zero Array Transformation II | Medium | Array, Binary_Search, Prefix_Sum | 5 | 100.00 |
3355 | Zero Array Transformation I | Medium | Array, Prefix_Sum | 6 | 36.84 |
3354 | Make Array Elements Equal to Zero | Easy | Array, Simulation, Prefix_Sum | 153 | 96.67 |
3352 | Count K-Reducible Numbers Less Than N | Hard | String, Dynamic_Programming, Math, Combinatorics | 170 | 100.00 |
3351 | Sum of Good Subsequences | Hard | Array, Hash_Table, Dynamic_Programming | 16 | 100.00 |
3350 | Adjacent Increasing Subarrays Detection II | Medium | Array, Binary_Search | 947 | 48.57 |
3349 | Adjacent Increasing Subarrays Detection I | Easy | Array | 179 | 97.92 |
3348 | Smallest Divisible Digit Product II | Hard | String, Math, Greedy, Backtracking, Number_Theory | 46 | 100.00 |
3347 | Maximum Frequency of an Element After Performing Operations II | Hard | Array, Sorting, Binary_Search, Prefix_Sum, Sliding_Window | 48 | 100.00 |
3346 | Maximum Frequency of an Element After Performing Operations I | Medium | Array, Sorting, Binary_Search, Prefix_Sum, Sliding_Window | 12 | 100.00 |
3345 | Smallest Divisible Digit Product I | Easy | Math, Enumeration | 1 | 100.00 |
3343 | Count Number of Balanced Permutations | Hard | String, Dynamic_Programming, Math, Combinatorics | 66 | 100.00 |
3342 | Find Minimum Time to Reach Last Room II | Medium | Array, Matrix, Heap_Priority_Queue, Graph, Shortest_Path | 122 | 100.00 |
3341 | Find Minimum Time to Reach Last Room I | Medium | Array, Matrix, Heap_Priority_Queue, Graph, Shortest_Path | 257 | 42.10 |
3340 | Check Balanced String | Easy | String | 1 | 100.00 |
3337 | Total Characters in String After Transformations II | Hard | String, Hash_Table, Dynamic_Programming, Math, Counting | 302 | 100.00 |
3336 | Find the Number of Subsequences With Equal GCD | Hard | Array, Dynamic_Programming, Math, Number_Theory | 324 | 100.00 |
3335 | Total Characters in String After Transformations I | Medium | String, Hash_Table, Dynamic_Programming, Math, Counting | 58 | 80.00 |
3334 | Find the Maximum Factor Score of Array | Medium | Array, Math, Number_Theory | 4 | 95.83 |
3333 | Find the Original Typed String II | Hard | String, Dynamic_Programming, Prefix_Sum | 490 | 100.00 |
3332 | Maximum Points Tourist Can Earn | Medium | Array, Dynamic_Programming, Matrix | 216 | 100.00 |
3331 | Find Subtree Sizes After Changes | Medium | Array, String, Hash_Table, Depth_First_Search, Tree | 139 | 95.24 |
3330 | Find the Original Typed String I | Easy | String | 142 | 88.24 |
3327 | Check if DFS Strings Are Palindromes | Hard | Array, String, Hash_Table, Depth_First_Search, Tree, Hash_Function | 86 | 100.00 |
3326 | Minimum Division Operations to Make Array Non Decreasing | Medium | Array, Math, Greedy, Number_Theory | 24 | 94.12 |
3325 | Count Substrings With K-Frequency Characters I | Medium | String, Hash_Table, Sliding_Window | 3 | 88.00 |
3324 | Find the Sequence of Strings Appeared on the Screen | Medium | String, Simulation | 8 | 100.00 |
3321 | Find X-Sum of All K-Long Subarrays II | Hard | Array, Hash_Table, Heap_Priority_Queue, Sliding_Window | 1660 | 100.00 |
3320 | Count The Number of Winning Sequences | Hard | String, Dynamic_Programming | 56 | 100.00 |
3319 | K-th Largest Perfect Subtree Size in Binary Tree | Medium | Sorting, Depth_First_Search, Tree, Binary_Tree | 332 | 45.45 |
3318 | Find X-Sum of All K-Long Subarrays I | Easy | Array, Hash_Table, Heap_Priority_Queue, Sliding_Window | 262 | 86.21 |
3317 | Find the Number of Possible Ways for an Event | Hard | Dynamic_Programming, Math, Combinatorics | 166 | 100.00 |
3316 | Find Maximum Removals From Source String | Medium | Array, String, Hash_Table, Dynamic_Programming, Two_Pointers | 220 | 100.00 |
3315 | Construct the Minimum Bitwise Array II | Medium | Array, Bit_Manipulation | 231 | 77.27 |
3314 | Construct the Minimum Bitwise Array I | Easy | Array, Bit_Manipulation | 226 | 57.14 |
3312 | Sorted GCD Pair Queries | Hard | Array, Hash_Table, Math, Binary_Search, Prefix_Sum, Counting, Number_Theory, Combinatorics | 734 | 100.00 |
3311 | Construct 2D Grid Matching Graph Layout | Hard | Array, Hash_Table, Matrix, Graph | 1423 | 100.00 |
3310 | Remove Methods From Project | Medium | Depth_First_Search, Breadth_First_Search, Graph | 1465 | 100.00 |
3309 | Maximum Possible Number by Binary Concatenation | Medium | Array, Bit_Manipulation, Enumeration | 182 | 73.47 |
3307 | Find the K-th Character in String Game II | Hard | Math, Bit_Manipulation, Recursion | 189 | 50.00 |
3306 | Count of Substrings Containing Every Vowel and K Consonants II | Medium | String, Hash_Table, Sliding_Window | 651 | 100.00 |
3305 | Count of Substrings Containing Every Vowel and K Consonants I | Medium | String, Hash_Table, Sliding_Window | 153 | 100.00 |
3304 | Find the K-th Character in String Game I | Easy | Math, Bit_Manipulation, Simulation, Recursion | 140 | 96.43 |
3303 | Find the Occurrence of First Almost Equal Substring | Hard | String, String_Matching | 364 | 100.00 |
3302 | Find the Lexicographically Smallest Valid Sequence | Medium | String, Dynamic_Programming, Greedy, Two_Pointers | 705 | 100.00 |
3301 | Maximize the Total Height of Unique Towers | Medium | Array, Sorting, Greedy | 761 | 87.50 |
3300 | Minimum Element After Replacement With Digit Sum | Easy | Array, Math | 153 | 100.00 |
3298 | Count Substrings That Can Be Rearranged to Contain a String II | Hard | String, Hash_Table, Sliding_Window | 433 | 78.57 |
3297 | Count Substrings That Can Be Rearranged to Contain a String I | Medium | String, Hash_Table, Sliding_Window | 215 | 93.33 |
3296 | Minimum Number of Seconds to Make Mountain Height Zero | Medium | Array, Math, Binary_Search | 228 | 87.50 |
3295 | Report Spam Message | Medium | Array, String, Hash_Table | 782 | 74.19 |
3292 | Minimum Number of Valid Strings to Form Target II | Hard | Array, String, Dynamic_Programming, Binary_Search, Segment_Tree, Hash_Function, String_Matching, Rolling_Hash | 674 | 50.00 |
3291 | Minimum Number of Valid Strings to Form Target I | Medium | Array, String, Dynamic_Programming, Binary_Search, Trie, Segment_Tree, Hash_Function, String_Matching, Rolling_Hash | 566 | 70.00 |
3290 | Maximum Multiplication Score | Medium | Array, Dynamic_Programming | 749 | 66.67 |
3289 | The Two Sneaky Numbers of Digitville | Easy | Array, Hash_Table, Math | 223 | 68.97 |
3288 | Length of the Longest Increasing Path | Hard | Array, Sorting, Binary_Search | 984 | 83.33 |
3287 | Find the Maximum Sequence Value of Array | Hard | Array, Dynamic_Programming, Bit_Manipulation | 2893 | 33.33 |
3286 | Find a Safe Walk Through a Grid | Medium | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue, Graph, Shortest_Path | 357 | 48.28 |
3285 | Find Indices of Stable Mountains | Easy | Array | 195 | 92.68 |
3283 | Maximum Number of Moves to Kill All Pawns | Hard | Array, Math, Breadth_First_Search, Bit_Manipulation, Bitmask, Game_Theory | 147 | 100.00 |
3282 | Reach End of Array With Max Score | Medium | Array, Greedy | 789 | 90.91 |
3281 | Maximize Score of Numbers in Ranges | Medium | Array, Sorting, Greedy, Binary_Search | 710 | 88.24 |
3280 | Convert Date to Binary | Easy | String, Math | 174 | 79.31 |
3277 | Maximum XOR Score Subarray Queries | Hard | Array, Dynamic_Programming | 1269 | 100.00 |
3276 | Select Cells in Grid With Maximum Score | Hard | Array, Dynamic_Programming, Matrix, Bit_Manipulation, Bitmask | 213 | 92.31 |
3275 | K-th Nearest Obstacle Queries | Medium | Array, Heap_Priority_Queue | 1277 | 100.00 |
3274 | Check if Two Chessboard Squares Have the Same Color | Easy | String, Math | 164 | 38.64 |
3273 | Minimum Amount of Damage Dealt to Bob | Hard | Array, Sorting, Greedy | 793 | 90.00 |
3272 | Find the Count of Good Integers | Hard | Hash_Table, Math, Enumeration, Combinatorics | 452 | 80.00 |
3271 | Hash Divided String | Medium | String, Simulation | 178 | 100.00 |
3270 | Find the Key of the Numbers | Easy | Math | 122 | 97.83 |
3267 | Count Almost Equal Pairs II | Hard | Array, Hash_Table, Sorting, Counting, Enumeration | 814 | 100.00 |
3266 | Final Array State After K Multiplication Operations II | Hard | Array, Heap_Priority_Queue, Simulation | 500 | 100.00 |
3265 | Count Almost Equal Pairs I | Medium | Array, Hash_Table, Sorting, Counting, Enumeration | 184 | 100.00 |
3264 | Final Array State After K Multiplication Operations I | Easy | Array, Math, Heap_Priority_Queue, Simulation | 237 | 55.55 |
3261 | Count Substrings That Satisfy K-Constraint II | Hard | Array, String, Binary_Search, Prefix_Sum, Sliding_Window | 1005 | 100.00 |
3260 | Find the Largest Palindrome Divisible by K | Hard | String, Dynamic_Programming, Math, Greedy, Number_Theory | 211 | 100.00 |
3259 | Maximum Energy Boost From Two Drinks | Medium | Array, Dynamic_Programming | 811 | 96.88 |
3258 | Count Substrings That Satisfy K-Constraint I | Easy | String, Sliding_Window | 155 | 92.86 |
3257 | Maximum Value Sum by Placing Three Rooks II | Hard | Array, Dynamic_Programming, Matrix, Enumeration | 770 | 100.00 |
3256 | Maximum Value Sum by Placing Three Rooks I | Hard | Array, Dynamic_Programming, Matrix, Enumeration | 279 | 100.00 |
3255 | Find the Power of K-Size Subarrays II | Medium | Array, Sliding_Window | 892 | 89.36 |
3254 | Find the Power of K-Size Subarrays I | Medium | Array, Sliding_Window | 245 | 92.59 |
3251 | Find the Count of Monotonic Pairs II | Hard | Array, Dynamic_Programming, Math, Prefix_Sum, Combinatorics | 291 | 100.00 |
3250 | Find the Count of Monotonic Pairs I | Hard | Array, Dynamic_Programming, Math, Prefix_Sum, Combinatorics | 241 | 100.00 |
3249 | Count the Number of Good Nodes | Medium | Depth_First_Search, Tree | 1190 | 100.00 |
3248 | Snake in Matrix | Easy | Array, String, Simulation | 174 | 90.91 |
3245 | Alternating Groups III | Hard | Array, Binary_Indexed_Tree | 70 | 100.00 |
3244 | Shortest Distance After Road Addition Queries II | Hard | Array, Greedy, Graph, Ordered_Set | 794 | 92.31 |
3243 | Shortest Distance After Road Addition Queries I | Medium | Array, Breadth_First_Search, Graph | 313 | 97.06 |
3242 | Design Neighbor Sum Service | Easy | Array, Hash_Table, Matrix, Design, Simulation | 333 | 75.00 |
3241 | Time Taken to Mark All Nodes | Hard | Dynamic_Programming, Depth_First_Search, Tree, Graph | 1228 | 100.00 |
3240 | Minimum Number of Flips to Make Binary Grid Palindromic II | Medium | Array, Matrix, Two_Pointers | 805 | 100.00 |
3239 | Minimum Number of Flips to Make Binary Grid Palindromic I | Medium | Array, Matrix, Two_Pointers | 856 | 87.50 |
3238 | Find the Number of Winning Players | Easy | Array, Hash_Table, Counting | 207 | 90.38 |
3235 | Check if the Rectangle Corner Is Reachable | Hard | Array, Math, Depth_First_Search, Breadth_First_Search, Union_Find, Geometry | 612 | 66.67 |
3234 | Count the Number of Substrings With Dominant Ones | Medium | String, Sliding_Window, Enumeration | 356 | 100.00 |
3233 | Find the Count of Numbers Which Are Not Special | Medium | Array, Math, Number_Theory | 215 | 76.19 |
3232 | Find if Digit Game Can Be Won | Easy | Array, Math | 194 | 36.00 |
3229 | Minimum Operations to Make Array Equal to Target | Hard | Array, Dynamic_Programming, Greedy, Stack, Monotonic_Stack | 636 | 57.14 |
3228 | Maximum Number of Operations to Move Ones to the End | Medium | String, Greedy, Counting | 232 | 44.00 |
3227 | Vowels Game in a String | Medium | String, Math, Game_Theory, Brainteaser | 234 | 90.32 |
3226 | Number of Bit Changes to Make Two Integers Equal | Easy | Bit_Manipulation | 136 | 61.90 |
3225 | Maximum Score From Grid Operations | Hard | Array, Dynamic_Programming, Matrix, Prefix_Sum | 371 | 100.00 |
3224 | Minimum Array Changes to Make Differences Equal | Medium | Array, Hash_Table, Prefix_Sum | 665 | 84.62 |
3223 | Minimum Length of String After Operations | Medium | String, Hash_Table, Counting | 316 | 60.00 |
3222 | Find the Winning Player in Coin Game | Easy | Math, Simulation, Game_Theory | 140 | 86.44 |
3220 | Odd and Even Transactions | Medium | Database | 248 | 85.85 |
3219 | Minimum Cost for Cutting Cake II | Hard | Array, Sorting, Greedy | 776 | 100.00 |
3218 | Minimum Cost for Cutting Cake I | Medium | Array, Dynamic_Programming, Sorting, Greedy | 175 | 78.05 |
3217 | Delete Nodes From Linked List Present in Array | Medium | Array, Hash_Table, Linked_List | 872 | 98.31 |
3216 | Lexicographically Smallest String After a Swap | Easy | String, Greedy | 157 | 95.16 |
3213 | Construct String with Minimum Cost | Hard | Array, String, Dynamic_Programming, Suffix_Array | 1176 | 46.67 |
3212 | Count Submatrices With Equal Frequency of X and Y | Medium | Array, Matrix, Prefix_Sum | 1009 | 78.95 |
3211 | Generate Binary Strings Without Adjacent Zeros | Medium | String, Bit_Manipulation, Recursion | 237 | 38.18 |
3210 | Find the Encrypted String | Easy | String | 170 | 62.69 |
3209 | Number of Subarrays With AND Value of K | Hard | Array, Binary_Search, Bit_Manipulation, Segment_Tree | 530 | 100.00 |
3208 | Alternating Groups II | Medium | Array, Sliding_Window | 449 | 97.62 |
3207 | Maximum Points After Enemy Battles | Medium | Array, Greedy | 470 | 100.00 |
3206 | Alternating Groups I | Easy | Array, Sliding_Window | 167 | 88.14 |
3203 | Find Minimum Diameter After Merging Two Trees | Hard | Depth_First_Search, Breadth_First_Search, Tree, Graph | 1156 | 100.00 |
3202 | Find the Maximum Length of Valid Subsequence II | Medium | Array, Dynamic_Programming | 255 | 97.30 |
3201 | Find the Maximum Length of Valid Subsequence I | Medium | Array, Dynamic_Programming | 512 | 89.36 |
3200 | Maximum Height of a Triangle | Easy | Array, Enumeration | 136 | 81.36 |
3197 | Find the Minimum Area to Cover All Ones II | Hard | Array, Matrix, Enumeration | 216 | 100.00 |
3196 | Maximize Total Cost of Alternating Subarrays | Medium | Array, Dynamic_Programming | 496 | 73.81 |
3195 | Find the Minimum Area to Cover All Ones I | Medium | Array, Matrix | 1068 | 73.91 |
3194 | Minimum Average of Smallest and Largest Elements | Easy | Array, Sorting, Two_Pointers | 192 | 94.25 |
3193 | Count the Number of Inversions | Hard | Array, Dynamic_Programming | 243 | 94.74 |
3192 | Minimum Operations to Make Binary Array Elements Equal to One II | Medium | Array, Dynamic_Programming, Greedy | 684 | 64.29 |
3191 | Minimum Operations to Make Binary Array Elements Equal to One I | Medium | Array, Bit_Manipulation, Prefix_Sum, Sliding_Window, Queue | 653 | 57.35 |
3190 | Find Minimum Operations to Make All Elements Divisible by Three | Easy | Array, Math | 153 | 87.95 |
3187 | Peaks in Array | Hard | Array, Segment_Tree, Binary_Indexed_Tree | 1339 | 80.00 |
3186 | Maximum Total Damage With Spell Casting | Medium | Array, Hash_Table, Dynamic_Programming, Sorting, Binary_Search, Two_Pointers, Counting | 1106 | 92.73 |
3185 | Count Pairs That Form a Complete Day II | Medium | Array, Hash_Table, Counting | 578 | 78.33 |
3184 | Count Pairs That Form a Complete Day I | Easy | Array, Hash_Table, Counting | 171 | 68.42 |
3181 | Maximum Total Reward Using Operations II | Hard | Array, Dynamic_Programming, Bit_Manipulation | 376 | 100.00 |
3180 | Maximum Total Reward Using Operations I | Medium | Array, Dynamic_Programming | 183 | 100.00 |
3179 | Find the N-th Value After K Seconds | Medium | Array, Math, Simulation, Prefix_Sum, Combinatorics | 175 | 100.00 |
3178 | Find the Child Who Has the Ball After K Seconds | Easy | Math, Simulation | 136 | 82.35 |
3177 | Find the Maximum Length of a Good Subsequence II | Hard | Array, Hash_Table, Dynamic_Programming | 284 | 100.00 |
3176 | Find the Maximum Length of a Good Subsequence I | Medium | Array, Hash_Table, Dynamic_Programming | 183 | 100.00 |
3175 | Find The First Player to win K Games in a Row | Medium | Array, Simulation | 536 | 100.00 |
3174 | Clear Digits | Easy | String, Hash_Table, Simulation | 180 | 70.18 |
3171 | Find Subarray With Bitwise AND Closest to K | Hard | Array, Binary_Search, Bit_Manipulation, Segment_Tree | 520 | 100.00 |
3170 | Lexicographically Minimum String After Removing Stars | Medium | String, Hash_Table, Greedy, Stack, Heap_Priority_Queue | 316 | 100.00 |
3169 | Count Days Without Meetings | Medium | Array, Sorting | 733 | 97.59 |
3168 | Minimum Number of Chairs in a Waiting Room | Easy | String, Simulation | 148 | 86.52 |
3165 | Maximum Sum of Subsequence With Non-adjacent Elements | Hard | Array, Dynamic_Programming, Divide_and_Conquer, Segment_Tree | 109 | 100.00 |
3164 | Find the Number of Good Pairs II | Medium | Array, Hash_Table | 1175 | 90.00 |
3163 | String Compression III | Medium | String | 331 | 66.13 |
3162 | Find the Number of Good Pairs I | Easy | Array, Hash_Table | 182 | 54.41 |
3161 | Block Placement Queries | Hard | Array, Binary_Search, Segment_Tree, Binary_Indexed_Tree | 100 | 100.00 |
3160 | Find the Number of Distinct Colors Among the Balls | Medium | Array, Hash_Table, Simulation | 1055 | 58.82 |
3159 | Find Occurrences of an Element in an Array | Medium | Array, Hash_Table | 810 | 98.28 |
3158 | Find the XOR of Numbers Which Appear Twice | Easy | Array, Hash_Table, Bit_Manipulation | 166 | 92.21 |
3154 | Find Number of Ways to Reach the K-th Stair | Hard | Dynamic_Programming, Math, Bit_Manipulation, Memoization, Combinatorics | 122 | 100.00 |
3153 | Sum of Digit Differences of All Pairs | Medium | Array, Hash_Table, Math, Counting | 491 | 95.74 |
3152 | Special Array II | Medium | Array, Binary_Search, Prefix_Sum | 707 | 93.83 |
3151 | Special Array I | Easy | Array | 165 | 92.21 |
3149 | Find the Minimum Cost Array Permutation | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 329 | 100.00 |
3148 | Maximum Difference Score in a Grid | Medium | Array, Dynamic_Programming, Matrix | 777 | 84.62 |
3147 | Taking Maximum Energy From the Mystic Dungeon | Medium | Array, Prefix_Sum | 671 | 79.17 |
3146 | Permutation Difference between Two Strings | Easy | String, Hash_Table | 177 | 58.21 |
3145 | Find Products of Elements of Big Array | Hard | Array, Binary_Search, Bit_Manipulation | 210 | 100.00 |
3144 | Minimum Substring Partition of Equal Character Frequency | Medium | String, Hash_Table, Dynamic_Programming, Counting | 232 | 88.00 |
3143 | Maximum Points Inside the Square | Medium | Array, String, Hash_Table, Sorting, Binary_Search | 650 | 59.52 |
3142 | Check if Grid Satisfies Conditions | Easy | Array, Matrix | 170 | 91.84 |
3139 | Minimum Cost to Equalize Array | Hard | Array, Greedy, Enumeration | 495 | 100.00 |
3138 | Minimum Length of Anagram Concatenation | Medium | String, Hash_Table, Counting | 219 | 91.67 |
3137 | Minimum Number of Operations to Make Word K-Periodic | Medium | String, Hash_Table, Counting | 291 | 96.30 |
3136 | Valid Word | Easy | String | 160 | 92.50 |
3134 | Find the Median of the Uniqueness Array | Hard | Array, Hash_Table, Binary_Search, Sliding_Window | 733 | 100.00 |
3133 | Minimum Array End | Medium | Bit_Manipulation | 131 | 90.91 |
3132 | Find the Integer Added to Array II | Medium | Array, Sorting, Two_Pointers, Enumeration | 189 | 84.85 |
3131 | Find the Integer Added to Array I | Easy | Array | 162 | 98.15 |
3130 | Find All Possible Stable Binary Arrays II | Hard | Dynamic_Programming, Prefix_Sum | 242 | 100.00 |
3129 | Find All Possible Stable Binary Arrays I | Medium | Dynamic_Programming, Prefix_Sum | 169 | 92.86 |
3128 | Right Triangles | Medium | Array, Hash_Table, Math, Counting, Combinatorics | 975 | 40.63 |
3127 | Make a Square with the Same Color | Easy | Array, Matrix, Enumeration | 149 | 80.00 |
3123 | Find Edges in Shortest Paths | Hard | Depth_First_Search, Breadth_First_Search, Heap_Priority_Queue, Graph, Shortest_Path | 931 | 100.00 |
3122 | Minimum Number of Operations to Satisfy Conditions | Medium | Array, Dynamic_Programming, Matrix | 948 | 80.77 |
3121 | Count the Number of Special Characters II | Medium | String, Hash_Table | 274 | 90.74 |
3120 | Count the Number of Special Characters I | Easy | String, Hash_Table | 145 | 97.26 |
3117 | Minimum Sum of Values by Dividing Array | Hard | Array, Dynamic_Programming, Binary_Search, Bit_Manipulation, Queue, Segment_Tree | 244 | 100.00 |
3116 | Kth Smallest Amount With Single Denomination Combination | Hard | Array, Math, Binary_Search, Bit_Manipulation, Number_Theory, Combinatorics | 158 | 100.00 |
3115 | Maximum Prime Difference | Medium | Array, Math, Number_Theory | 555 | 79.63 |
3114 | Latest Time You Can Obtain After Replacing Characters | Easy | String, Enumeration | 161 | 83.58 |
3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard | Array, Binary_Search, Stack, Monotonic_Stack | 606 | 88.89 |
3112 | Minimum Time to Visit Disappearing Nodes | Medium | Array, Heap_Priority_Queue, Graph, Shortest_Path | 828 | 94.44 |
3111 | Minimum Rectangles to Cover Points | Medium | Array, Sorting, Greedy | 701 | 96.15 |
3110 | Score of a String | Easy | String | 144 | 91.51 |
3108 | Minimum Cost Walk in Weighted Graph | Hard | Array, Bit_Manipulation, Graph, Union_Find | 791 | 100.00 |
3107 | Minimum Operations to Make Median of Array Equal to K | Medium | Array, Sorting, Greedy | 554 | 100.00 |
3106 | Lexicographically Smallest String After Operations With Constraint | Medium | String, Greedy | 162 | 74.19 |
3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | Array | 159 | 94.00 |
3102 | Minimize Manhattan Distances | Hard | Array, Math | 701 | 95.83 |
3101 | Count Alternating Subarrays | Medium | Array, Math | 499 | 97.78 |
3100 | Water Bottles II | Medium | Math, Simulation | 137 | 70.49 |
3099 | Harshad Number | Easy | Math | 119 | 82.67 |
3098 | Find the Sum of Subsequence Powers | Hard | Array, Dynamic_Programming, Sorting | 294 | 77.78 |
3097 | Shortest Subarray With OR at Least K II | Medium | Array, Bit_Manipulation, Sliding_Window | 489 | 93.33 |
3096 | Minimum Levels to Gain More Points | Medium | Array, Prefix_Sum | 850 | 100.00 |
3095 | Shortest Subarray With OR at Least K I | Easy | Array, Bit_Manipulation, Sliding_Window | 161 | 95.65 |
3093 | Longest Common Suffix Queries | Hard | Array, String, Trie | 860 | 89.29 |
3092 | Most Frequent IDs | Medium | Array, Hash_Table, Heap_Priority_Queue, Ordered_Set | 758 | 100.00 |
3091 | Apply Operations to Make Sum of Array Greater Than or Equal to k | Medium | Math, Greedy, Enumeration | 134 | 73.21 |
3090 | Maximum Length Substring With Two Occurrences | Easy | String, Hash_Table, Sliding_Window | 157 | 90.24 |
3086 | Minimum Moves to Pick K Ones | Hard | Array, Greedy, Prefix_Sum, Sliding_Window | 368 | 100.00 |
3085 | Minimum Deletions to Make String K-Special | Medium | String, Hash_Table, Sorting, Greedy, Counting | 221 | 93.33 |
3084 | Count Substrings Starting and Ending with Given Character | Medium | String, Math, Counting | 177 | 98.55 |
3083 | Existence of a Substring in a String and Its Reverse | Easy | String, Hash_Table | 168 | 79.49 |
3082 | Find the Sum of the Power of All Subsequences | Hard | Array, Dynamic_Programming | 176 | 90.00 |
3081 | Replace Question Marks in String to Minimize Its Value | Medium | String, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Counting | 249 | 100.00 |
3080 | Mark Elements on Array by Performing Queries | Medium | Array, Hash_Table, Sorting, Heap_Priority_Queue, Simulation | 937 | 97.78 |
3079 | Find the Sum of Encrypted Integers | Easy | Array, Math | 172 | 80.60 |
3077 | Maximum Strength of K Disjoint Subarrays | Hard | Array, Dynamic_Programming, Prefix_Sum | 351 | 75.00 |
3076 | Shortest Uncommon Substring in an Array | Medium | Array, String, Hash_Table, Trie | 256 | 100.00 |
3075 | Maximize Happiness of Selected Children | Medium | Array, Sorting, Greedy | 608 | 93.24 |
3074 | Apple Redistribution into Boxes | Easy | Array, Sorting, Greedy | 168 | 97.37 |
3072 | Distribute Elements Into Two Arrays II | Hard | Array, Simulation, Segment_Tree, Binary_Indexed_Tree | 890 | 100.00 |
3071 | Minimum Operations to Write the Letter Y on a Grid | Medium | Array, Hash_Table, Matrix, Counting | 268 | 91.11 |
3070 | Count Submatrices with Top-Left Element and Sum Less Than k | Medium | Array, Matrix, Prefix_Sum | 773 | 85.71 |
3069 | Distribute Elements Into Two Arrays I | Easy | Array, Simulation | 207 | 96.92 |
3068 | Find the Maximum Sum of Node Values | Hard | Array, Dynamic_Programming, Sorting, Greedy, Tree, Bit_Manipulation | 531 | 66.67 |
3067 | Count Pairs of Connectable Servers in a Weighted Tree Network | Medium | Array, Depth_First_Search, Tree | 578 | 83.33 |
3066 | Minimum Operations to Exceed Threshold Value II | Medium | Array, Heap_Priority_Queue, Simulation | 543 | 98.11 |
3065 | Minimum Operations to Exceed Threshold Value I | Easy | Array | 180 | 71.76 |
3049 | Earliest Second to Mark Indices II | Hard | Array, Greedy, Binary_Search, Heap_Priority_Queue | 220 | 100.00 |
3048 | Earliest Second to Mark Indices I | Medium | Array, Binary_Search | 223 | 75.00 |
3047 | Find the Largest Area of Square Inside Two Rectangles | Medium | Array, Math, Geometry | 753 | 40.42 |
3046 | Split the Array | Easy | Array, Hash_Table, Counting | 173 | 75.00 |
3045 | Count Prefix and Suffix Pairs II | Hard | Array, String, Trie, Hash_Function, String_Matching, Rolling_Hash | 344 | 100.00 |
3044 | Most Frequent Prime | Medium | Array, Hash_Table, Math, Matrix, Counting, Enumeration, Number_Theory | 198 | 100.00 |
3043 | Find the Length of the Longest Common Prefix | Medium | Array, String, Hash_Table, Trie | 623 | 76.32 |
3042 | Count Prefix and Suffix Pairs I | Easy | Array, String, Trie, Hash_Function, String_Matching, Rolling_Hash | 160 | 96.72 |
3041 | Maximize Consecutive Elements in an Array After Modification | Hard | Array, Dynamic_Programming, Sorting | 551 | 100.00 |
3040 | Maximum Number of Operations With the Same Score II | Medium | Array, Dynamic_Programming, Memoization | 179 | 100.00 |
3039 | Apply Operations to Make String Empty | Medium | Array, Hash_Table, Sorting, Counting | 335 | 97.73 |
3038 | Maximum Number of Operations With the Same Score I | Easy | Array, Simulation | 142 | 100.00 |
3036 | Number of Subarrays That Match a Pattern II | Hard | Array, Hash_Function, String_Matching, Rolling_Hash | 768 | 83.33 |
3035 | Maximum Palindromes After Operations | Medium | Array, String, Hash_Table, Sorting, Greedy, Counting | 214 | 100.00 |
3034 | Number of Subarrays That Match a Pattern I | Medium | Array, Hash_Function, String_Matching, Rolling_Hash | 225 | 38.09 |
3033 | Modify the Matrix | Easy | Array, Matrix | 270 | 41.94 |
3031 | Minimum Time to Revert Word to Initial State II | Hard | String, Hash_Function, String_Matching, Rolling_Hash | 328 | 52.94 |
3030 | Find the Grid of Region Average | Medium | Array, Matrix | 1250 | 86.96 |
3029 | Minimum Time to Revert Word to Initial State I | Medium | String, Hash_Function, String_Matching, Rolling_Hash | 160 | 82.05 |
3028 | Ant on the Boundary | Easy | Array, Simulation, Prefix_Sum | 155 | 87.32 |
3027 | Find the Number of Ways to Place People II | Hard | Array, Math, Sorting, Enumeration, Geometry | 477 | 78.95 |
3026 | Maximum Good Subarray Sum | Medium | Array, Hash_Table, Prefix_Sum | 756 | 71.43 |
3025 | Find the Number of Ways to Place People I | Medium | Array, Math, Sorting, Enumeration, Geometry | 252 | 44.12 |
3024 | Type of Triangle | Easy | Array, Math, Sorting | 163 | 81.03 |
3022 | Minimize OR of Remaining Elements Using Operations | Hard | Array, Greedy, Bit_Manipulation | 516 | 77.78 |
3021 | Alice and Bob Playing Flower Game | Medium | Math | 141 | 43.24 |
3020 | Find the Maximum Number of Elements in Subset | Medium | Array, Hash_Table, Enumeration | 626 | 82.22 |
3019 | Number of Changing Keys | Easy | String, Breadth_First_Search, Graph, Prefix_Sum | 157 | 80.52 |
3017 | Count the Number of Houses at a Certain Distance II | Hard | Breadth_First_Search, Graph, Prefix_Sum | 414 | 50.00 |
3016 | Minimum Number of Pushes to Type Word II | Medium | String, Hash_Table, Sorting, Greedy, Breadth_First_Search, Graph, Prefix_Sum, Counting | 290 | 92.00 |
3015 | Count the Number of Houses at a Certain Distance I | Medium | Breadth_First_Search, Graph, Prefix_Sum | 203 | 90.91 |
3014 | Minimum Number of Pushes to Type Word I | Easy | String, Math, Greedy | 152 | 58.67 |
3013 | Divide an Array Into Subarrays With Minimum Cost II | Hard | Array, Hash_Table, Heap_Priority_Queue, Sliding_Window | 1165 | 100.00 |
3012 | Minimize Length of Array Using Operations | Medium | Array, Math, Greedy, Number_Theory | 533 | 86.36 |
3011 | Find if Array Can Be Sorted | Medium | Array, Sorting, Bit_Manipulation | 199 | 79.49 |
3010 | Divide an Array Into Subarrays With Minimum Cost I | Easy | Array, Sorting, Enumeration | 170 | 94.23 |
3008 | Find Beautiful Indices in the Given Array II | Hard | String, Binary_Search, Two_Pointers, Hash_Function, String_Matching, Rolling_Hash | 730 | 96.67 |
3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | Medium | Dynamic_Programming, Binary_Search, Bit_Manipulation | 133 | 100.00 |
3006 | Find Beautiful Indices in the Given Array I | Medium | String, Binary_Search, Two_Pointers, Hash_Function, String_Matching, Rolling_Hash | 287 | 94.92 |
3005 | Count Elements With Maximum Frequency | Easy | Array, Hash_Table, Counting | 168 | 80.00 |
3003 | Maximize the Number of Partitions After Operations | Hard | String, Dynamic_Programming, Bit_Manipulation, Bitmask | 147 | 100.00 |
3002 | Maximum Size of a Set After Removals | Medium | Array, Hash_Table, Greedy | 467 | 100.00 |
3001 | Minimum Moves to Capture The Queen | Medium | Array, Enumeration | 1 | 100.00 |
3000 | Maximum Area of Longest Diagonal Rectangle | Easy | Array | 167 | 94.44 |
2999 | Count the Number of Powerful Integers | Hard | String, Dynamic_Programming, Math | 163 | 100.00 |
2998 | Minimum Number of Operations to Make X and Y Equal | Medium | Dynamic_Programming, Breadth_First_Search, Memoization | 149 | 100.00 |
2997 | Minimum Number of Operations to Make Array XOR Equal to K | Medium | Array, Bit_Manipulation | 452 | 84.38 |
2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | Easy | Array, Hash_Table, Sorting | 174 | 83.33 |
2983 | Palindrome Rearrangement Queries | Hard | String, Hash_Table, Prefix_Sum | 905 | 87.50 |
2982 | Find Longest Special Substring That Occurs Thrice II | Medium | String, Hash_Table, Binary_Search, Counting, Sliding_Window | 343 | 100.00 |
2981 | Find Longest Special Substring That Occurs Thrice I | Medium | String, Hash_Table, Binary_Search, Counting, Sliding_Window | 208 | 90.70 |
2980 | Check if Bitwise OR Has Trailing Zeros | Easy | Array, Bit_Manipulation | 183 | 89.58 |
2977 | Minimum Cost to Convert String II | Hard | Array, String, Dynamic_Programming, Graph, Trie, Shortest_Path | 697 | 100.00 |
2976 | Minimum Cost to Convert String I | Medium | Array, String, Graph, Shortest_Path | 421 | 85.29 |
2975 | Maximum Square Area by Removing Fences From a Field | Medium | Array, Hash_Table, Enumeration | 1283 | 96.77 |
2974 | Minimum Number Game | Easy | Array, Sorting, Heap_Priority_Queue, Simulation | 213 | 97.92 |
2973 | Find Number of Coins to Place in Tree Nodes | Hard | Dynamic_Programming, Sorting, Depth_First_Search, Tree, Heap_Priority_Queue | 1134 | 90.91 |
2972 | Count the Number of Incremovable Subarrays II | Hard | Array, Binary_Search, Two_Pointers | 483 | 100.00 |
2971 | Find Polygon With the Largest Perimeter | Medium | Array, Sorting, Greedy, Prefix_Sum | 534 | 97.06 |
2970 | Count the Number of Incremovable Subarrays I | Easy | Array, Binary_Search, Two_Pointers, Enumeration | 170 | 100.00 |
2968 | Apply Operations to Maximize Frequency Score | Hard | Array, Sorting, Binary_Search, Prefix_Sum, Sliding_Window | 566 | 90.00 |
2967 | Minimum Cost to Make Array Equalindromic | Medium | Array, Math, Sorting, Greedy | 363 | 100.00 |
2966 | Divide Array Into Arrays With Max Difference | Medium | Array, Sorting, Greedy | 977 | 60.00 |
2965 | Find Missing and Repeated Values | Easy | Array, Hash_Table, Math, Matrix | 235 | 91.67 |
2963 | Count the Number of Good Partitions | Hard | Array, Hash_Table, Math, Combinatorics | 600 | 100.00 |
2962 | Count Subarrays Where Max Element Appears at Least K Times | Medium | Array, Sliding_Window | 587 | 88.37 |
2961 | Double Modular Exponentiation | Medium | Array, Math, Simulation | 197 | 92.50 |
2960 | Count Tested Devices After Test Operations | Easy | Array, Simulation | 168 | 86.96 |
2959 | Number of Possible Sets of Closing Branches | Hard | Bit_Manipulation, Heap_Priority_Queue, Graph, Enumeration, Shortest_Path | 231 | 87.50 |
2958 | Length of Longest Subarray With at Most K Frequency | Medium | Array, Hash_Table, Sliding_Window | 485 | 100.00 |
2957 | Remove Adjacent Almost-Equal Characters | Medium | String, Dynamic_Programming, Greedy | 158 | 56.52 |
2956 | Find Common Elements Between Two Arrays | Easy | Array, Hash_Table | 271 | 94.20 |
2954 | Count the Number of Infection Sequences | Hard | Array, Math, Combinatorics | 1493 | 100.00 |
2953 | Count Complete Substrings | Hard | String, Hash_Table, Sliding_Window | 315 | 100.00 |
2952 | Minimum Number of Coins to be Added | Medium | Array, Sorting, Greedy | 439 | 87.10 |
2951 | Find the Peaks | Easy | Array, Enumeration | 188 | 93.75 |
2949 | Count Beautiful Substrings II | Hard | String, Hash_Table, Math, Prefix_Sum, Number_Theory | 299 | 100.00 |
2948 | Make Lexicographically Smallest Array by Swapping Elements | Medium | Array, Sorting, Union_Find | 928 | 94.59 |
2947 | Count Beautiful Substrings I | Medium | String, Prefix_Sum, Enumeration | 291 | 59.52 |
2946 | Matrix Similarity After Cyclic Shifts | Easy | Array, Math, Matrix, Simulation | 210 | 75.00 |
2945 | Find Maximum Non-decreasing Array Length | Hard | Array, Dynamic_Programming, Binary_Search, Stack, Monotonic_Stack, Queue, Monotonic_Queue | 636 | 87.50 |
2944 | Minimum Number of Coins for Fruits | Medium | Array, Dynamic_Programming, Heap_Priority_Queue, Queue, Monotonic_Queue | 194 | 84.62 |
2943 | Maximize Area of Square Hole in Grid | Medium | Array, Sorting | 180 | 86.67 |
2942 | Find Words Containing Character | Easy | Array, String | 216 | 98.97 |
2940 | Find Building Where Alice and Bob Can Meet | Hard | Array, Binary_Search, Stack, Heap_Priority_Queue, Monotonic_Stack, Segment_Tree, Binary_Indexed_Tree | 928 | 90.00 |
2939 | Maximum Xor Product | Medium | Math, Greedy, Bit_Manipulation | 151 | 76.19 |
2938 | Separate Black and White Balls | Medium | String, Greedy, Two_Pointers | 199 | 98.21 |
2937 | Make Three Strings Equal | Easy | String | 186 | 83.78 |
2935 | Maximum Strong Pair XOR II | Hard | Array, Hash_Table, Bit_Manipulation, Sliding_Window, Trie | 748 | 84.38 |
2934 | Minimum Operations to Maximize Last Elements in Arrays | Medium | Array, Greedy | 243 | 81.25 |
2933 | High-Access Employees | Medium | Array, String, Hash_Table, Sorting | 304 | 91.67 |
2932 | Maximum Strong Pair XOR I | Easy | Array, Hash_Table, Bit_Manipulation, Sliding_Window, Trie | 192 | 43.08 |
2931 | Maximum Spending After Buying Items | Hard | Array, Sorting, Greedy, Matrix, Heap_Priority_Queue | 541 | 93.75 |
2930 | Number of Strings Which Can Be Rearranged to Contain Substring | Medium | Dynamic_Programming, Math, Combinatorics | 132 | 100.00 |
2929 | Distribute Candies Among Children II | Medium | Math, Enumeration, Combinatorics | 163 | 66.67 |
2928 | Distribute Candies Among Children I | Easy | Math, Enumeration, Combinatorics | 141 | 86.36 |
2926 | Maximum Balanced Subsequence Sum | Hard | Array, Dynamic_Programming, Binary_Search, Segment_Tree, Binary_Indexed_Tree | 636 | 100.00 |
2925 | Maximum Score After Applying Operations on a Tree | Medium | Dynamic_Programming, Depth_First_Search, Tree | 706 | 81.82 |
2924 | Find Champion II | Medium | Graph | 422 | 81.82 |
2923 | Find Champion I | Easy | Array, Matrix | 320 | 58.62 |
2920 | Maximum Points After Collecting Coins From All Nodes | Hard | Array, Dynamic_Programming, Depth_First_Search, Tree, Bit_Manipulation | 1007 | 100.00 |
2919 | Minimum Increment Operations to Make Array Beautiful | Medium | Array, Dynamic_Programming | 520 | 62.50 |
2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | Array, Greedy | 598 | 100.00 |
2917 | Find the K-or of an Array | Easy | Array, Bit_Manipulation | 191 | 76.47 |
2916 | Subarrays Distinct Element Sum of Squares II | Hard | Array, Dynamic_Programming, Segment_Tree, Binary_Indexed_Tree | 467 | 100.00 |
2915 | Length of the Longest Subsequence That Sums to Target | Medium | Array, Dynamic_Programming | 552 | 66.67 |
2914 | Minimum Number of Changes to Make Binary String Beautiful | Medium | String | 180 | 100.00 |
2913 | Subarrays Distinct Element Sum of Squares I | Easy | Array, Hash_Table | 184 | 95.74 |
2911 | Minimum Changes to Make K Semi-palindromes | Hard | String, Dynamic_Programming, Two_Pointers | 216 | 100.00 |
2910 | Minimum Number of Groups to Create a Valid Assignment | Medium | Array, Hash_Table, Greedy | 745 | 75.00 |
2909 | Minimum Sum of Mountain Triplets II | Medium | Array | 463 | 100.00 |
2908 | Minimum Sum of Mountain Triplets I | Easy | Array | 174 | 73.33 |
2906 | Construct Product Matrix | Medium | Array, Matrix, Prefix_Sum | 1016 | 100.00 |
2905 | Find Indices With Index and Value Difference II | Medium | Array | 485 | 50.00 |
2904 | Shortest and Lexicographically Smallest Beautiful String | Medium | String, Sliding_Window | 169 | 66.67 |
2903 | Find Indices With Index and Value Difference I | Easy | Array | 192 | 100.00 |
2902 | Count of Sub-Multisets With Bounded Sum | Hard | Array, Hash_Table, Dynamic_Programming, Sliding_Window | 263 | 87.50 |
2901 | Longest Unequal Adjacent Groups Subsequence II | Medium | Array, String, Dynamic_Programming | 305 | 100.00 |
2900 | Longest Unequal Adjacent Groups Subsequence I | Easy | Array, String, Dynamic_Programming, Greedy | 294 | 100.00 |
2899 | Last Visited Integers | Easy | Array, String, Simulation | 209 | 72.73 |
2897 | Apply Operations on Array to Maximize Sum of Squares | Hard | Array, Hash_Table, Greedy, Bit_Manipulation | 572 | 100.00 |
2896 | Apply Operations to Make Two Strings Equal | Medium | String, Dynamic_Programming | 181 | 66.67 |
2895 | Minimum Processing Time | Medium | Array, Sorting, Greedy | 662 | 80.00 |
2894 | Divisible and Non-divisible Sums Difference | Easy | Math | 135 | 76.92 |
2891 | Method Chaining | Easy | | 412 | 99.23 |
2890 | Reshape Data: Melt | Easy | | 446 | 97.89 |
2889 | Reshape Data: Pivot | Easy | | 416 | 99.87 |
2888 | Reshape Data: Concatenate | Easy | | 441 | 96.26 |
2887 | Fill Missing Data | Easy | | 404 | 97.11 |
2886 | Change Data Type | Easy | | 421 | 94.57 |
2885 | Rename Columns | Easy | | 467 | 68.13 |
2884 | Modify Columns | Easy | | 401 | 96.35 |
2883 | Drop Missing Data | Easy | | 429 | 94.97 |
2882 | Drop Duplicate Rows | Easy | | 405 | 97.36 |
2881 | Create a New Column | Easy | | 437 | 81.98 |
2880 | Select Data | Easy | | 428 | 94.99 |
2879 | Display the First Three Rows | Easy | | 406 | 96.44 |
2878 | Get the Size of a DataFrame | Easy | | 413 | 94.68 |
2877 | Create a DataFrame from List | Easy | | 406 | 82.57 |
2876 | Count Visited Nodes in a Directed Graph | Hard | Dynamic_Programming, Graph, Memoization | 922 | 100.00 |
2875 | Minimum Size Subarray in Infinite Array | Medium | Array, Hash_Table, Prefix_Sum, Sliding_Window | 372 | 100.00 |
2874 | Maximum Value of an Ordered Triplet II | Medium | Array | 508 | 100.00 |
2873 | Maximum Value of an Ordered Triplet I | Easy | Array | 157 | 94.12 |
2872 | Maximum Number of K-Divisible Components | Hard | Dynamic_Programming, Depth_First_Search, Tree | 780 | 100.00 |
2871 | Split Array Into Maximum Number of Subarrays | Medium | Array, Greedy, Bit_Manipulation | 490 | 100.00 |
2870 | Minimum Number of Operations to Make Array Empty | Medium | Array, Hash_Table, Greedy, Counting | 503 | 80.00 |
2869 | Minimum Operations to Collect Elements | Easy | Array, Hash_Table | 156 | 100.00 |
2867 | Count Valid Paths in a Tree | Hard | Dynamic_Programming, Math, Depth_First_Search, Tree, Number_Theory | 793 | 100.00 |
2866 | Beautiful Towers II | Medium | Array, Stack, Monotonic_Stack | 676 | 85.71 |
2865 | Beautiful Towers I | Medium | Array, Stack, Monotonic_Stack | 232 | 75.00 |
2864 | Maximum Odd Binary Number | Easy | String, Math, Greedy | 176 | 90.91 |
2862 | Maximum Element-Sum of a Complete Subset of Indices | Hard | Array, Math, Number_Theory | 259 | 100.00 |
2861 | Maximum Number of Alloys | Medium | Array, Binary_Search | 289 | 100.00 |
2860 | Happy Students | Medium | Array, Sorting, Enumeration | 512 | 100.00 |
2859 | Sum of Values at Indices With K Set Bits | Easy | Array, Bit_Manipulation | 177 | 100.00 |
2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Graph | 1161 | 100.00 |
2857 | Count Pairs of Points With Distance k | Medium | Array, Hash_Table, Bit_Manipulation | 1212 | 100.00 |
2856 | Minimum Array Length After Pair Removals | Medium | Array, Hash_Table, Greedy, Binary_Search, Two_Pointers, Counting | 647 | 100.00 |
2855 | Minimum Right Shifts to Sort the Array | Easy | Array | 169 | 75.00 |
2851 | String Transformation | Hard | String, Dynamic_Programming, Math, String_Matching | 377 | 100.00 |
2850 | Minimum Moves to Spread Stones Over Grid | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 133 | 100.00 |
2849 | Determine if a Cell Is Reachable at a Given Time | Medium | Math | 138 | 80.95 |
2848 | Points That Intersect With Cars | Easy | Hash_Table, Math, Prefix_Sum | 190 | 100.00 |
2846 | Minimum Edge Weight Equilibrium Queries in a Tree | Hard | Array, Tree, Graph, Strongly_Connected_Component | 982 | 100.00 |
2845 | Count of Interesting Subarrays | Medium | Array, Hash_Table, Prefix_Sum | 703 | 100.00 |
2844 | Minimum Operations to Make a Special Number | Medium | String, Math, Greedy, Enumeration | 162 | 60.00 |
2843 | Count Symmetric Integers | Easy | Math, Enumeration | 203 | 88.24 |
2842 | Count K-Subsequences of a String With Maximum Beauty | Hard | String, Hash_Table, Math, Greedy, Combinatorics | 217 | 100.00 |
2841 | Maximum Sum of Almost Unique Subarray | Medium | Array, Hash_Table, Sliding_Window | 387 | 100.00 |
2840 | Check if Strings Can be Made Equal With Operations II | Medium | String, Hash_Table, Sorting | 225 | 100.00 |
2839 | Check if Strings Can be Made Equal With Operations I | Easy | String | 154 | 100.00 |
2836 | Maximize Value of Function in a Ball Passing Game | Hard | Array, Dynamic_Programming, Bit_Manipulation | 933 | 100.00 |
2835 | Minimum Operations to Form Subsequence With Target Sum | Hard | Array, Greedy, Bit_Manipulation | 183 | 100.00 |
2834 | Find the Minimum Possible Sum of a Beautiful Array | Medium | Math, Greedy | 130 | 100.00 |
2833 | Furthest Point From Origin | Easy | Array, Counting | 160 | 81.25 |
2831 | Find the Longest Equal Subarray | Medium | Array, Hash_Table, Binary_Search, Sliding_Window | 663 | 100.00 |
2830 | Maximize the Profit as the Salesman | Medium | Array, Dynamic_Programming, Sorting, Binary_Search | 776 | 100.00 |
2829 | Determine the Minimum Sum of a k-avoiding Array | Medium | Math, Greedy | 162 | 75.00 |
2828 | Check if a String Is an Acronym of Words | Easy | Array, String | 180 | 90.14 |
2827 | Number of Beautiful Integers in the Range | Hard | Dynamic_Programming, Math | 169 | 100.00 |
2826 | Sorting Three Groups | Medium | Array, Dynamic_Programming | 250 | 100.00 |
2825 | Make String a Subsequence Using Cyclic Increments | Medium | String, Two_Pointers | 227 | 83.33 |
2824 | Count Pairs Whose Sum is Less than Target | Easy | Array, Sorting, Two_Pointers | 168 | 90.62 |
2818 | Apply Operations to Maximize Score | Hard | Array, Math, Greedy, Stack, Monotonic_Stack, Number_Theory | 727 | 100.00 |
2817 | Minimum Absolute Difference Between Elements With Constraint | Medium | Array, Binary_Search, Ordered_Set | 759 | 100.00 |
2816 | Double a Number Represented as a Linked List | Medium | Math, Stack, Linked_List | 393 | 100.00 |
2815 | Max Pair Sum in an Array | Easy | Array, Hash_Table | 223 | 82.35 |
2813 | Maximum Elegance of a K-Length Subsequence | Hard | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue | 853 | 100.00 |
2812 | Find the Safest Path in a Grid | Medium | Array, Breadth_First_Search, Binary_Search, Matrix, Union_Find | 902 | 100.00 |
2811 | Check if it is Possible to Split Array | Medium | Array, Dynamic_Programming, Greedy | 180 | 100.00 |
2810 | Faulty Keyboard | Easy | String, Simulation | 196 | 91.67 |
2809 | Minimum Time to Make Array Sum At Most x | Hard | Array, Dynamic_Programming, Sorting | 325 | 100.00 |
2808 | Minimum Seconds to Equalize a Circular Array | Medium | Array, Hash_Table, Greedy | 847 | 50.00 |
2807 | Insert Greatest Common Divisors in Linked List | Medium | Array, Math, Linked_List | 225 | 67.65 |
2806 | Account Balance After Rounded Purchase | Easy | Math | 108 | 100.00 |
2801 | Count Stepping Numbers in Range | Hard | String, Dynamic_Programming | 288 | 100.00 |
2800 | Shortest String That Contains Three Strings | Medium | String, Greedy, Enumeration | 259 | 100.00 |
2799 | Count Complete Subarrays in an Array | Medium | Array, Hash_Table, Sliding_Window | 206 | 96.97 |
2798 | Number of Employees Who Met the Target | Easy | Array, Enumeration | 153 | 92.50 |
2791 | Count Paths That Can Form a Palindrome in a Tree | Hard | Dynamic_Programming, Depth_First_Search, Tree, Bit_Manipulation, Bitmask | 683 | 100.00 |
2790 | Maximum Number of Groups With Increasing Length | Hard | Array, Math, Sorting, Greedy, Binary_Search | 545 | 100.00 |
2789 | Largest Element in an Array after Merge Operations | Medium | Array, Greedy, Prefix_Sum | 683 | 73.68 |
2788 | Split Strings by Separator | Easy | Array, String | 314 | 85.45 |
2787 | Ways to Express an Integer as Sum of Powers | Medium | Dynamic_Programming | 152 | 100.00 |
2786 | Visit Array Positions to Maximize Score | Medium | Array, Dynamic_Programming | 625 | 84.00 |
2785 | Sort Vowels in a String | Medium | String, Sorting | 233 | 100.00 |
2784 | Check if Array is Good | Easy | Array, Hash_Table, Sorting | 177 | 88.89 |
2781 | Length of the Longest Valid Substring | Hard | Array, String, Hash_Table, Sliding_Window | 647 | 100.00 |
2780 | Minimum Index of a Valid Split | Medium | Array, Hash_Table, Sorting | 640 | 91.67 |
2779 | Maximum Beauty of an Array After Applying Operation | Medium | Array, Sorting, Binary_Search, Sliding_Window | 649 | 96.97 |
2778 | Sum of Squares of Special Elements | Easy | Array, Simulation | 183 | 86.44 |
2772 | Apply Operations to Make All Array Elements Equal to Zero | Medium | Array, Prefix_Sum | 578 | 97.06 |
2771 | Longest Non-decreasing Subarray From Two Arrays | Medium | Array, Dynamic_Programming | 665 | 96.88 |
2770 | Maximum Number of Jumps to Reach the Last Index | Medium | Array, Dynamic_Programming | 325 | 51.16 |
2769 | Find the Maximum Achievable Number | Easy | Math | 134 | 97.89 |
2768 | Number of Black Blocks | Medium | Array, Hash_Table, Enumeration | 719 | 100.00 |
2767 | Partition String Into Minimum Beautiful Substrings | Medium | String, Hash_Table, Dynamic_Programming, Backtracking | 162 | 96.00 |
2766 | Relocate Marbles | Medium | Array, Hash_Table, Sorting, Simulation | 1038 | 100.00 |
2765 | Longest Alternating Subarray | Easy | Array, Enumeration | 191 | 97.92 |
2763 | Sum of Imbalance Numbers of All Subarrays | Hard | Array, Hash_Table, Ordered_Set | 417 | 95.24 |
2762 | Continuous Subarrays | Medium | Array, Heap_Priority_Queue, Sliding_Window, Ordered_Set, Queue, Monotonic_Queue | 492 | 100.00 |
2761 | Prime Pairs With Target Sum | Medium | Array, Math, Enumeration, Number_Theory | 537 | 100.00 |
2760 | Longest Even Odd Subarray With Threshold | Easy | Array, Sliding_Window | 285 | 95.45 |
2751 | Robot Collisions | Hard | Array, Sorting, Stack, Simulation | 1049 | 100.00 |
2750 | Ways to Split Array Into Good Subarrays | Medium | Array, Dynamic_Programming, Math | 916 | 100.00 |
2749 | Minimum Operations to Make the Integer Zero | Medium | Bit_Manipulation, Brainteaser | 132 | 91.67 |
2748 | Number of Beautiful Pairs | Easy | Array, Math, Number_Theory | 227 | 100.00 |
2747 | Count Zero Request Servers | Medium | Array, Hash_Table, Sorting, Sliding_Window | 991 | 100.00 |
2746 | Decremental String Concatenation | Medium | Array, String, Dynamic_Programming | 264 | 100.00 |
2745 | Construct the Longest New String | Medium | Math, Greedy, Brainteaser | 146 | 97.37 |
2744 | Find Maximum Number of String Pairs | Easy | Array, String, Hash_Table, Simulation | 162 | 96.81 |
2742 | Painting the Walls | Hard | Array, Dynamic_Programming | 268 | 100.00 |
2741 | Special Permutations | Medium | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 623 | 82.35 |
2740 | Find the Value of the Partition | Medium | Array, Sorting | 431 | 100.00 |
2739 | Total Distance Traveled | Easy | Math, Simulation | 177 | 100.00 |
2736 | Maximum Sum Queries | Hard | Array, Sorting, Binary_Search, Stack, Monotonic_Stack, Segment_Tree, Binary_Indexed_Tree | 1043 | 100.00 |
2735 | Collecting Chocolates | Medium | Array, Enumeration | 237 | 100.00 |
2734 | Lexicographically Smallest String After Substring Operation | Medium | String, Greedy | 384 | 100.00 |
2733 | Neither Minimum nor Maximum | Easy | Array, Sorting | 286 | 100.00 |
2732 | Find a Good Subset of the Matrix | Hard | Array, Greedy, Matrix, Bit_Manipulation | 760 | 98.36 |
2731 | Movement of Robots | Medium | Array, Sorting, Prefix_Sum, Brainteaser | 414 | 100.00 |
2730 | Find the Longest Semi-Repetitive Substring | Medium | String, Sliding_Window | 251 | 84.62 |
2729 | Check if The Number is Fascinating | Easy | Hash_Table, Math | 131 | 100.00 |
2727 | Is Object Empty | Easy | | 49 | 98.24 |
2726 | Calculator with Method Chaining | Easy | | 43 | 99.15 |
2725 | Interval Cancellation | Easy | | 51 | 98.87 |
2724 | Sort By | Easy | | 132 | 96.70 |
2723 | Add Two Promises | Easy | | 56 | 97.63 |
2722 | Join Two Arrays by ID | Medium | | 280 | 98.29 |
2721 | Execute Asynchronous Functions in Parallel | Medium | | 63 | 99.09 |
2719 | Count of Integers | Hard | String, Dynamic_Programming, Math | 208 | 100.00 |
2718 | Sum of Matrix After Queries | Medium | Array, Hash_Table | 668 | 100.00 |
2717 | Semi-Ordered Permutation | Easy | Array, Simulation | 186 | 100.00 |
2716 | Minimize String Length | Easy | String, Hash_Table | 204 | 97.62 |
2715 | Timeout Cancellation | Easy | | 53 | 97.68 |
2713 | Maximum Strictly Increasing Cells in a Matrix | Hard | Array, Dynamic_Programming, Sorting, Binary_Search, Matrix, Memoization | 1141 | 100.00 |
2712 | Minimum Cost to Make All Characters Equal | Medium | String, Dynamic_Programming, Greedy | 200 | 100.00 |
2711 | Difference of Number of Distinct Values on Diagonals | Medium | Array, Hash_Table, Matrix | 281 | 100.00 |
2710 | Remove Trailing Zeros From a String | Easy | String | 191 | 93.02 |
2709 | Greatest Common Divisor Traversal | Hard | Array, Math, Union_Find, Number_Theory | 892 | 81.82 |
2708 | Maximum Strength of a Group | Medium | Array, Sorting, Greedy, Backtracking | 183 | 100.00 |
2707 | Extra Characters in a String | Medium | Array, String, Hash_Table, Dynamic_Programming, Trie | 276 | 85.71 |
2706 | Buy Two Chocolates | Easy | Array, Sorting | 187 | 96.43 |
2705 | Compact Object | Medium | | 78 | 99.38 |
2704 | To Be Or Not To Be | Easy | | 49 | 97.88 |
2703 | Return Length of Arguments Passed | Easy | | 47 | 98.59 |
2699 | Modify Graph Edge Weights | Hard | Heap_Priority_Queue, Graph, Shortest_Path | 1592 | 40.00 |
2698 | Find the Punishment Number of an Integer | Medium | Math, Backtracking | 133 | 100.00 |
2697 | Lexicographically Smallest Palindrome | Easy | String, Two_Pointers | 267 | 100.00 |
2696 | Minimum String Length After Removing Substrings | Easy | String, Stack, Simulation | 185 | 100.00 |
2695 | Array Wrapper | Easy | | 40 | 100.00 |
2694 | Event Emitter | Medium | | 45 | 99.58 |
2693 | Call Function with Custom Context | Medium | Array, Dynamic_Programming, Matrix | 51 | 97.92 |
2685 | Count the Number of Complete Components | Medium | Array, Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Matrix, Graph | 436 | 100.00 |
2684 | Maximum Number of Moves in a Grid | Medium | Array, Dynamic_Programming, Matrix | 509 | 100.00 |
2683 | Neighboring Bitwise XOR | Medium | Array, Bit_Manipulation | 988 | 100.00 |
2682 | Find the Losers of the Circular Game | Easy | Array, Hash_Table, Simulation | 186 | 100.00 |
2681 | Power of Heroes | Hard | Array, Math, Sorting, Prefix_Sum | 454 | 85.71 |
2680 | Maximum OR | Medium | Array, Greedy, Bit_Manipulation, Prefix_Sum | 592 | 90.91 |
2679 | Sum in a Matrix | Medium | Array, Sorting, Matrix, Heap_Priority_Queue, Simulation | 581 | 100.00 |
2678 | Number of Senior Citizens | Easy | Array, String | 163 | 96.30 |
2677 | Chunk Array | Easy | | 55 | 96.89 |
2673 | Make Costs of Paths Equal in a Binary Tree | Medium | Array, Dynamic_Programming, Greedy, Tree, Binary_Tree | 645 | 75.00 |
2672 | Number of Adjacent Elements With the Same Color | Medium | Array | 1208 | 100.00 |
2671 | Frequency Tracker | Medium | Hash_Table, Design | 1109 | 80.00 |
2670 | Find the Distinct Difference Array | Easy | Array, Hash_Table | 320 | 94.74 |
2667 | Create Hello World Function | Easy | | 45 | 94.20 |
2666 | Allow One Function Call | Easy | | 50 | 88.35 |
2665 | Counter II | Easy | | 54 | 94.09 |
2663 | Lexicographically Smallest Beautiful String | Hard | String, Greedy | 324 | 100.00 |
2662 | Minimum Cost of a Path With Special Roads | Medium | Array, Heap_Priority_Queue, Graph, Shortest_Path | 690 | 100.00 |
2661 | First Completely Painted Row or Column | Medium | Array, Hash_Table, Matrix | 901 | 100.00 |
2660 | Determine the Winner of a Bowling Game | Easy | Array, Simulation | 263 | 85.71 |
2659 | Make Array Empty | Hard | Array, Sorting, Greedy, Binary_Search, Ordered_Set, Segment_Tree, Binary_Indexed_Tree | 728 | 100.00 |
2658 | Maximum Number of Fish in a Grid | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 269 | 80.00 |
2657 | Find the Prefix Common Array of Two Arrays | Medium | Array, Hash_Table | 288 | 88.89 |
2656 | Maximum Sum With Exactly K Elements | Easy | Array, Greedy | 241 | 93.94 |
2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | Medium | Array, Math, Number_Theory | 172 | 100.00 |
2653 | Sliding Subarray Beauty | Medium | Array, Hash_Table, Sliding_Window | 1264 | 66.67 |
2652 | Sum Multiples | Easy | Array, Math, Number_Theory | 136 | 97.53 |
2651 | Calculate Delayed Arrival Time | Easy | Math | 129 | 88.00 |
2650 | Design Cancellable Function | Hard | | 58 | 93.15 |
2649 | Nested Array Generator | Medium | | 138 | 86.92 |
2648 | Generate Fibonacci Sequence | Easy | | 42 | 98.08 |
2646 | Minimize the Total Price of the Trips | Hard | Array, Dynamic_Programming, Depth_First_Search, Tree, Graph | 264 | 100.00 |
2645 | Minimum Additions to Make Valid String | Medium | String, Dynamic_Programming, Greedy, Stack | 154 | 100.00 |
2644 | Find the Maximum Divisibility Score | Easy | Array | 585 | 100.00 |
2643 | Row With Maximum Ones | Easy | Array, Matrix | 530 | 100.00 |
2642 | Design Graph With Shortest Path Calculator | Hard | Design, Heap_Priority_Queue, Graph, Shortest_Path | 789 | 100.00 |
2641 | Cousins in Binary Tree II | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 922 | 90.91 |
2640 | Find the Score of All Prefixes of an Array | Medium | Array, Prefix_Sum | 587 | 100.00 |
2639 | Find the Width of Columns of a Grid | Easy | Array, Matrix | 222 | 100.00 |
2637 | Promise Time Limit | Medium | | 57 | 84.99 |
2635 | Apply Transform Over Each Element in Array | Easy | | 43 | 98.46 |
2634 | Filter Elements from Array | Easy | | 44 | 98.04 |
2631 | Group By | Medium | | 101 | 99.50 |
2630 | Memoize II | Hard | | 264 | 98.86 |
2629 | Function Composition | Easy | | 58 | 95.63 |
2627 | Debounce | Medium | | 50 | 98.23 |
2626 | Array Reduce Transformation | Easy | | 52 | 91.40 |
2625 | Flatten Deeply Nested Array | Medium | | 84 | 98.71 |
2624 | Snail Traversal | Medium | | 157 | 81.82 |
2623 | Memoize | Medium | | 264 | 97.20 |
2622 | Cache With Time Limit | Medium | | 51 | 94.82 |
2621 | Sleep | Easy | | 40 | 99.59 |
2620 | Counter | Easy | | 43 | 98.60 |
2619 | Array Prototype Last | Easy | | 41 | 98.99 |
2618 | Check if Object Instance of Class | Medium | | 82 | 99.55 |
2617 | Minimum Number of Visited Cells in a Grid | Hard | Array, Dynamic_Programming, Binary_Search, Stack, Union_Find, Segment_Tree, Binary_Indexed_Tree | 1255 | 100.00 |
2616 | Minimize the Maximum Difference of Pairs | Medium | Array, Greedy, Binary_Search | 556 | 100.00 |
2615 | Sum of Distances | Medium | Array, Hash_Table, Prefix_Sum | 902 | 100.00 |
2614 | Prime In Diagonal | Easy | Array, Math, Matrix, Number_Theory | 465 | 100.00 |
2612 | Minimum Reverse Operations | Hard | Array, Breadth_First_Search, Ordered_Set | 923 | 100.00 |
2611 | Mice and Cheese | Medium | Array, Sorting, Greedy, Heap_Priority_Queue | 554 | 100.00 |
2610 | Convert an Array Into a 2D Array With Conditions | Medium | Array, Hash_Table | 240 | 88.24 |
2609 | Find the Longest Balanced Substring of a Binary String | Easy | String | 174 | 100.00 |
2608 | Shortest Cycle in a Graph | Hard | Breadth_First_Search, Graph | 1061 | 100.00 |
2607 | Make K-Subarray Sums Equal | Medium | Array, Math, Sorting, Number_Theory | 1062 | 100.00 |
2606 | Find the Substring With Maximum Cost | Medium | Array, String, Hash_Table, Dynamic_Programming | 238 | 100.00 |
2605 | Form Smallest Number From Two Digit Arrays | Easy | Array, Hash_Table, Enumeration | 161 | 100.00 |
2603 | Collect Coins in a Tree | Hard | Array, Tree, Graph, Topological_Sort | 986 | 100.00 |
2602 | Minimum Operations to Make All Array Elements Equal | Medium | Array, Sorting, Binary_Search, Prefix_Sum | 790 | 100.00 |
2601 | Prime Subtraction Operation | Medium | Array, Math, Greedy, Binary_Search, Number_Theory | 233 | 100.00 |
2600 | K Items With the Maximum Sum | Easy | Math, Greedy | 145 | 100.00 |
2598 | Smallest Missing Non-negative Integer After Operations | Medium | Array, Hash_Table, Math, Greedy | 594 | 100.00 |
2597 | The Number of Beautiful Subsets | Medium | Array, Dynamic_Programming, Backtracking | 194 | 100.00 |
2596 | Check Knight Tour Configuration | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Simulation | 179 | 100.00 |
2595 | Number of Even and Odd Bits | Easy | Bit_Manipulation | 177 | 100.00 |
2594 | Minimum Time to Repair Cars | Medium | Array, Binary_Search | 416 | 100.00 |
2593 | Find Score of an Array After Marking All Elements | Medium | Array, Sorting, Heap_Priority_Queue, Simulation | 738 | 100.00 |
2592 | Maximize Greatness of an Array | Medium | Array, Sorting, Greedy, Two_Pointers | 748 | 100.00 |
2591 | Distribute Money to Maximum Children | Easy | Math, Greedy | 155 | 100.00 |
2589 | Minimum Time to Complete All Tasks | Hard | Array, Sorting, Greedy, Binary_Search, Stack | 422 | 100.00 |
2588 | Count the Number of Beautiful Subarrays | Medium | Array, Hash_Table, Bit_Manipulation, Prefix_Sum | 785 | 100.00 |
2587 | Rearrange Array to Maximize Prefix Score | Medium | Array, Sorting, Greedy, Prefix_Sum | 612 | 100.00 |
2586 | Count the Number of Vowel Strings in Range | Easy | Array, String | 195 | 100.00 |
2585 | Number of Ways to Earn Points | Hard | Array, Dynamic_Programming | 263 | 100.00 |
2584 | Split the Array to Make Coprime Products | Hard | Array, Hash_Table, Math, Number_Theory | 341 | 100.00 |
2583 | Kth Largest Sum in a Binary Tree | Medium | Breadth_First_Search, Tree, Binary_Search | 557 | 83.33 |
2582 | Pass the Pillow | Easy | Math, Simulation | 122 | 85.71 |
2581 | Count Number of Possible Root Nodes | Hard | Hash_Table, Dynamic_Programming, Depth_First_Search, Tree | 1352 | 100.00 |
2580 | Count Ways to Group Overlapping Ranges | Medium | Array, Sorting | 669 | 100.00 |
2579 | Count Total Number of Colored Cells | Medium | Math | 109 | 100.00 |
2578 | Split With Minimum Sum | Easy | Math, Sorting, Greedy | 121 | 75.00 |
2577 | Minimum Time to Visit a Cell In a Grid | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue, Graph, Shortest_Path | 1446 | 100.00 |
2576 | Find the Maximum Number of Marked Indices | Medium | Array, Sorting, Greedy, Binary_Search, Two_Pointers | 610 | 100.00 |
2575 | Find the Divisibility Array of a String | Medium | Array, String, Math | 507 | 100.00 |
2574 | Left and Right Sum Differences | Easy | Array, Prefix_Sum | 203 | 100.00 |
2573 | Find the String with LCP | Hard | String, Dynamic_Programming, Greedy, Union_Find | 853 | 100.00 |
2572 | Count the Number of Square-Free Subsets | Medium | Array, Dynamic_Programming, Math, Bit_Manipulation, Bitmask | 218 | 100.00 |
2571 | Minimum Operations to Reduce an Integer to 0 | Medium | Dynamic_Programming, Greedy, Bit_Manipulation | 131 | 100.00 |
2570 | Merge Two 2D Arrays by Summing Values | Easy | Array, Hash_Table, Two_Pointers | 221 | 91.67 |
2569 | Handling Sum Queries After Update | Hard | Array, Segment_Tree | 1751 | 100.00 |
2568 | Minimum Impossible OR | Medium | Array, Bit_Manipulation, Brainteaser | 468 | 100.00 |
2567 | Minimum Score by Changing Two Elements | Medium | Array, Sorting, Greedy | 496 | 100.00 |
2566 | Maximum Difference by Remapping a Digit | Easy | Math, Greedy | 125 | 100.00 |
2565 | Subsequence With the Minimum Score | Hard | String, Binary_Search, Two_Pointers | 204 | 100.00 |
2564 | Substring XOR Queries | Medium | Array, String, Hash_Table, Bit_Manipulation | 1603 | 100.00 |
2563 | Count the Number of Fair Pairs | Medium | Array, Sorting, Binary_Search, Two_Pointers | 553 | 100.00 |
2562 | Find the Array Concatenation Value | Easy | Array, Two_Pointers, Simulation | 175 | 100.00 |
2561 | Rearranging Fruits | Hard | Array, Hash_Table, Greedy | 746 | 100.00 |
2560 | House Robber IV | Medium | Array, Binary_Search | 467 | 100.00 |
2559 | Count Vowel Strings in Ranges | Medium | Array, String, Prefix_Sum | 638 | 100.00 |
2558 | Take Gifts From the Richest Pile | Easy | Array, Heap_Priority_Queue, Simulation | 169 | 100.00 |
2556 | Disconnect Path in a Binary Matrix by at Most One Flip | Medium | Array, Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Matrix | 571 | 100.00 |
2555 | Maximize Win From Two Segments | Medium | Array, Binary_Search, Sliding_Window | 388 | 100.00 |
2554 | Maximum Number of Integers to Choose From a Range I | Medium | Array, Hash_Table, Sorting, Greedy, Binary_Search | 543 | 100.00 |
2553 | Separate the Digits in an Array | Easy | Array, Simulation | 210 | 100.00 |
2552 | Count Increasing Quadruplets | Hard | Array, Dynamic_Programming, Prefix_Sum, Enumeration, Binary_Indexed_Tree | 268 | 66.67 |
2551 | Put Marbles in Bags | Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 818 | 100.00 |
2550 | Count Collisions of Monkeys on a Polygon | Medium | Math, Recursion | 111 | 100.00 |
2549 | Count Distinct Numbers on Board | Easy | Array, Hash_Table, Math, Simulation | 113 | 100.00 |
2547 | Minimum Cost to Split an Array | Hard | Array, Hash_Table, Dynamic_Programming, Counting | 400 | 100.00 |
2546 | Apply Bitwise Operations to Make Strings Equal | Medium | String, Bit_Manipulation | 246 | 100.00 |
2545 | Sort the Students by Their Kth Score | Medium | Array, Sorting, Matrix | 442 | 100.00 |
2544 | Alternating Digit Sum | Easy | Math | 122 | 60.00 |
2543 | Check if Point Is Reachable | Hard | Math, Number_Theory | 134 | 100.00 |
2542 | Maximum Subsequence Score | Medium | Array, Sorting, Greedy, Heap_Priority_Queue, LeetCode_75_Heap/Priority_Queue | 780 | 81.97 |
2541 | Minimum Operations to Make Array Equal II | Medium | Array, Math, Greedy | 521 | 100.00 |
2540 | Minimum Common Value | Easy | Array, Hash_Table, Binary_Search, Two_Pointers | 412 | 100.00 |
2538 | Difference Between Maximum and Minimum Price Sum | Hard | Array, Dynamic_Programming, Depth_First_Search, Tree | 1054 | 100.00 |
2537 | Count the Number of Good Subarrays | Medium | Array, Hash_Table, Sliding_Window | 553 | 100.00 |
2536 | Increment Submatrices by One | Medium | Array, Matrix, Prefix_Sum | 827 | 100.00 |
2535 | Difference Between Element Sum and Digit Sum of an Array | Easy | Array, Math | 231 | 66.67 |
2532 | Time to Cross a Bridge | Hard | Array, Heap_Priority_Queue, Simulation | 420 | 100.00 |
2531 | Make Number of Distinct Characters Equal | Medium | String, Hash_Table, Counting | 287 | 100.00 |
2530 | Maximal Score After Applying K Operations | Medium | Array, Greedy, Heap_Priority_Queue | 726 | 100.00 |
2529 | Maximum Count of Positive Integer and Negative Integer | Easy | Array, Binary_Search, Counting | 215 | 83.33 |
2528 | Maximize the Minimum Powered City | Hard | Array, Greedy, Binary_Search, Prefix_Sum, Sliding_Window, Queue | 496 | 100.00 |
2527 | Find Xor-Beauty of Array | Medium | Array, Math, Bit_Manipulation | 434 | 100.00 |
2526 | Find Consecutive Integers from a Data Stream | Medium | Hash_Table, Design, Counting, Queue, Data_Stream | 867 | 100.00 |
2525 | Categorize Box According to Criteria | Easy | Math | 119 | 100.00 |
2523 | Closest Prime Numbers in Range | Medium | Math, Number_Theory | 136 | 100.00 |
2522 | Partition String Into Substrings With Values at Most K | Medium | String, Dynamic_Programming, Greedy | 174 | 100.00 |
2521 | Distinct Prime Factors of Product of Array | Medium | Array, Hash_Table, Math, Number_Theory | 229 | 100.00 |
2520 | Count the Digits That Divide a Number | Easy | Math | 121 | 80.95 |
2518 | Number of Great Partitions | Hard | Array, Dynamic_Programming | 164 | 100.00 |
2517 | Maximum Tastiness of Candy Basket | Medium | Array, Sorting, Binary_Search | 547 | 33.33 |
2516 | Take K of Each Character From Left and Right | Medium | String, Hash_Table, Sliding_Window | 189 | 100.00 |
2515 | Shortest Distance to Target String in a Circular Array | Easy | Array, String | 209 | 100.00 |
2514 | Count Anagrams | Hard | String, Hash_Table, Math, Counting, Combinatorics | 236 | 100.00 |
2513 | Minimize the Maximum of Two Arrays | Medium | Math, Binary_Search, Number_Theory | 135 | 100.00 |
2512 | Reward Top K Students | Medium | Array, String, Hash_Table, Sorting, Heap_Priority_Queue | 691 | 100.00 |
2511 | Maximum Enemy Forts That Can Be Captured | Easy | Array, Two_Pointers | 142 | 100.00 |
2509 | Cycle Length Queries in a Tree | Hard | Tree, Binary_Tree | 825 | 75.00 |
2508 | Add Edges to Make Degrees of All Nodes Even | Hard | Hash_Table, Graph | 1045 | 100.00 |
2507 | Smallest Value After Replacing With Sum of Prime Factors | Medium | Math, Number_Theory | 149 | 100.00 |
2506 | Count Pairs Of Similar Strings | Easy | Array, String, Hash_Table | 208 | 100.00 |
2503 | Maximum Number of Points From Grid Queries | Hard | Array, Sorting, Breadth_First_Search, Heap_Priority_Queue, Union_Find | 581 | 100.00 |
2502 | Design Memory Allocator | Medium | Array, Hash_Table, Design, Simulation | 284 | 100.00 |
2501 | Longest Square Streak in an Array | Medium | Array, Hash_Table, Dynamic_Programming, Sorting, Binary_Search | 585 | 100.00 |
2500 | Delete Greatest Value in Each Row | Easy | Array, Sorting, Matrix | 204 | 80.00 |
2499 | Minimum Total Cost to Make Arrays Unequal | Hard | Array, Hash_Table, Greedy, Counting | 628 | 100.00 |
2498 | Frog Jump II | Medium | Array, Greedy, Binary_Search | 482 | 100.00 |
2497 | Maximum Star Sum of a Graph | Medium | Array, Sorting, Greedy, Heap_Priority_Queue, Graph | 773 | 100.00 |
2496 | Maximum Value of a String in an Array | Easy | Array, String | 138 | 100.00 |
2493 | Divide Nodes Into the Maximum Number of Groups | Hard | Breadth_First_Search, Graph, Union_Find | 862 | 100.00 |
2492 | Minimum Score of a Path Between Two Cities | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 929 | 91.67 |
2491 | Divide Players Into Teams of Equal Skill | Medium | Array, Hash_Table, Sorting, Two_Pointers | 459 | 100.00 |
2490 | Circular Sentence | Easy | String | 152 | 100.00 |
2488 | Count Subarrays With Median K | Hard | Array, Hash_Table, Prefix_Sum | 464 | 100.00 |
2487 | Remove Nodes From Linked List | Medium | Stack, Linked_List, Monotonic_Stack, Recursion | 770 | 50.00 |
2486 | Append Characters to String to Make Subsequence | Medium | String, Greedy, Two_Pointers | 196 | 100.00 |
2485 | Find the Pivot Integer | Easy | Math, Prefix_Sum | 134 | 100.00 |
2484 | Count Palindromic Subsequences | Hard | String, Dynamic_Programming | 494 | 100.00 |
2483 | Minimum Penalty for a Shop | Medium | String, Prefix_Sum | 210 | 66.67 |
2482 | Difference Between Ones and Zeros in Row and Column | Medium | Array, Matrix, Simulation | 1061 | 100.00 |
2481 | Minimum Cuts to Divide a Circle | Easy | Math, Geometry | 128 | 50.00 |
2478 | Number of Beautiful Partitions | Hard | String, Dynamic_Programming | 230 | 100.00 |
2477 | Minimum Fuel Cost to Report to the Capital | Medium | Depth_First_Search, Breadth_First_Search, Tree, Graph | 969 | 100.00 |
2476 | Closest Nodes Queries in a Binary Search Tree | Medium | Array, Depth_First_Search, Tree, Binary_Search, Binary_Tree | 1404 | 33.33 |
2475 | Number of Unequal Triplets in Array | Easy | Array, Hash_Table | 143 | 100.00 |
2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard | String, Dynamic_Programming | 183 | 100.00 |
2471 | Minimum Number of Operations to Sort a Binary Tree by Level | Medium | Breadth_First_Search, Tree, Binary_Tree | 789 | 100.00 |
2470 | Number of Subarrays With LCM Equal to K | Medium | Array, Math, Number_Theory | 232 | 100.00 |
2469 | Convert the Temperature | Easy | Math | 130 | 100.00 |
2468 | Split Message Based on Limit | Hard | String, Binary_Search | 427 | 100.00 |
2467 | Most Profitable Path in a Tree | Medium | Array, Depth_First_Search, Breadth_First_Search, Tree, Graph | 850 | 100.00 |
2466 | Count Ways To Build Good Strings | Medium | Dynamic_Programming | 150 | 75.00 |
2465 | Number of Distinct Averages | Easy | Array, Hash_Table, Sorting, Two_Pointers | 141 | 89.47 |
2463 | Minimum Total Distance Traveled | Hard | Array, Dynamic_Programming, Sorting | 153 | 100.00 |
2462 | Total Cost to Hire K Workers | Medium | Array, Two_Pointers, Heap_Priority_Queue, Simulation, LeetCode_75_Heap/Priority_Queue | 588 | 81.43 |
2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | Array, Hash_Table, Sliding_Window | 638 | 62.50 |
2460 | Apply Operations to an Array | Easy | Array, Simulation | 165 | 100.00 |
2458 | Height of Binary Tree After Subtree Removal Queries | Hard | Array, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 951 | 80.00 |
2457 | Minimum Addition to Make Integer Beautiful | Medium | Math, Greedy | 132 | 66.67 |
2456 | Most Popular Video Creator | Medium | Array, String, Hash_Table, Sorting, Heap_Priority_Queue | 1162 | 100.00 |
2455 | Average Value of Even Numbers That Are Divisible by Three | Easy | Array, Math | 196 | 80.00 |
2454 | Next Greater Element IV | Hard | Array, Sorting, Binary_Search, Stack, Heap_Priority_Queue, Monotonic_Stack | 749 | 100.00 |
2453 | Destroy Sequential Targets | Medium | Array, Hash_Table, Counting | 681 | 100.00 |
2452 | Words Within Two Edits of Dictionary | Medium | Array, String | 256 | 100.00 |
2451 | Odd String Difference | Easy | String, Hash_Table, Math | 141 | 100.00 |
2449 | Minimum Number of Operations to Make Arrays Similar | Hard | Array, Sorting, Greedy | 791 | 100.00 |
2448 | Minimum Cost to Make Array Equal | Hard | Array, Sorting, Binary_Search, Prefix_Sum | 387 | 80.40 |
2447 | Number of Subarrays With GCD Equal to K | Medium | Array, Math, Number_Theory | 180 | 100.00 |
2446 | Determine if Two Events Have Conflict | Easy | Array, String | 140 | 87.50 |
2444 | Count Subarrays With Fixed Bounds | Hard | Array, Sliding_Window, Queue, Monotonic_Queue | 469 | 100.00 |
2443 | Sum of Number and Its Reverse | Medium | Math, Enumeration | 216 | 100.00 |
2442 | Count Number of Distinct Integers After Reverse Operations | Medium | Array, Hash_Table, Math | 652 | 83.33 |
2441 | Largest Positive Integer That Exists With Its Negative | Easy | Array, Hash_Table | 266 | 66.67 |
2440 | Create Components With Same Value | Hard | Array, Math, Depth_First_Search, Tree, Enumeration | 751 | 100.00 |
2439 | Minimize Maximum of Array | Medium | Array, Dynamic_Programming, Greedy, Binary_Search, Prefix_Sum | 508 | 100.00 |
2438 | Range Product Queries of Powers | Medium | Array, Bit_Manipulation, Prefix_Sum | 1115 | 100.00 |
2437 | Number of Valid Clock Times | Easy | String, Enumeration | 133 | 64.29 |
2435 | Paths in Matrix Whose Sum Is Divisible by K | Hard | Array, Dynamic_Programming, Matrix | 752 | 100.00 |
2434 | Using a Robot to Print the Lexicographically Smallest String | Medium | String, Hash_Table, Greedy, Stack | 319 | 100.00 |
2433 | Find The Original Array of Prefix Xor | Medium | Array, Bit_Manipulation | 618 | 80.00 |
2432 | The Employee That Worked on the Longest Task | Easy | Array | 250 | 100.00 |
2430 | Maximum Deletions on a String | Hard | String, Dynamic_Programming, Hash_Function, String_Matching, Rolling_Hash | 280 | 100.00 |
2429 | Minimize XOR | Medium | Greedy, Bit_Manipulation | 117 | 100.00 |
2428 | Maximum Sum of an Hourglass | Medium | Array, Matrix, Prefix_Sum | 274 | 50.00 |
2427 | Number of Common Factors | Easy | Math, Enumeration, Number_Theory | 127 | 100.00 |
2426 | Number of Pairs Satisfying Inequality | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 490 | 100.00 |
2425 | Bitwise XOR of All Pairings | Medium | Array, Bit_Manipulation, Brainteaser | 424 | 100.00 |
2424 | Longest Uploaded Prefix | Medium | Binary_Search, Design, Heap_Priority_Queue, Union_Find, Ordered_Set, Segment_Tree, Binary_Indexed_Tree | 897 | 100.00 |
2423 | Remove Letter To Equalize Frequency | Easy | String, Hash_Table, Counting | 135 | 100.00 |
2421 | Number of Good Paths | Hard | Array, Tree, Graph, Union_Find | 909 | 100.00 |
2420 | Find All Good Indices | Medium | Array, Dynamic_Programming, Prefix_Sum | 621 | 100.00 |
2419 | Longest Subarray With Maximum Bitwise AND | Medium | Array, Bit_Manipulation, Brainteaser | 487 | 100.00 |
2418 | Sort the People | Easy | Array, String, Hash_Table, Sorting | 248 | 100.00 |
2416 | Sum of Prefix Scores of Strings | Hard | Array, String, Counting, Trie | 2062 | 50.00 |
2415 | Reverse Odd Levels of Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 499 | 87.50 |
2414 | Length of the Longest Alphabetical Continuous Substring | Medium | String | 235 | 100.00 |
2413 | Smallest Even Multiple | Easy | Math, Number_Theory | 121 | 85.71 |
2412 | Minimum Money Required Before Transactions | Hard | Array, Sorting, Greedy | 965 | 100.00 |
2411 | Smallest Subarrays With Maximum Bitwise OR | Medium | Array, Binary_Search, Bit_Manipulation, Sliding_Window | 562 | 100.00 |
2410 | Maximum Matching of Players With Trainers | Medium | Array, Sorting, Greedy, Two_Pointers | 565 | 83.33 |
2409 | Count Days Spent Together | Easy | String, Math | 143 | 60.00 |
2407 | Longest Increasing Subsequence II | Hard | Array, Dynamic_Programming, Divide_and_Conquer, Queue, Segment_Tree, Binary_Indexed_Tree, Monotonic_Queue | 518 | 100.00 |
2406 | Divide Intervals Into Minimum Number of Groups | Medium | Array, Sorting, Greedy, Two_Pointers, Heap_Priority_Queue, Prefix_Sum | 772 | 100.00 |
2405 | Optimal Partition of String | Medium | String, Hash_Table, Greedy | 185 | 100.00 |
2404 | Most Frequent Even Element | Easy | Array, Hash_Table, Counting | 349 | 90.91 |
2402 | Meeting Rooms III | Hard | Array, Sorting, Heap_Priority_Queue | 976 | 100.00 |
2401 | Longest Nice Subarray | Medium | Array, Bit_Manipulation, Sliding_Window | 507 | 100.00 |
2400 | Number of Ways to Reach a Position After Exactly k Steps | Medium | Dynamic_Programming, Math, Combinatorics | 126 | 100.00 |
2399 | Check Distances Between Same Letters | Easy | Array, String, Hash_Table | 173 | 66.67 |
2398 | Maximum Number of Robots Within Budget | Hard | Array, Binary_Search, Heap_Priority_Queue, Prefix_Sum, Sliding_Window, Queue | 507 | 100.00 |
2397 | Maximum Rows Covered by Columns | Medium | Array, Matrix, Bit_Manipulation, Backtracking, Enumeration | 154 | 100.00 |
2396 | Strictly Palindromic Number | Medium | Math, Two_Pointers, Brainteaser | 130 | 58.06 |
2395 | Find Subarrays With Equal Sum | Easy | Array, Hash_Table | 143 | 100.00 |
2392 | Build a Matrix With Conditions | Hard | Array, Matrix, Graph, Topological_Sort | 706 | 100.00 |
2391 | Minimum Amount of Time to Collect Garbage | Medium | Array, String, Prefix_Sum | 537 | 100.00 |
2390 | Removing Stars From a String | Medium | String, Stack, Simulation, LeetCode_75_Stack | 337 | 62.92 |
2389 | Longest Subsequence With Limited Sum | Easy | Array, Sorting, Greedy, Binary_Search, Prefix_Sum | 257 | 80.00 |
2386 | Find the K-Sum of an Array | Hard | Array, Sorting, Heap_Priority_Queue | 675 | 100.00 |
2385 | Amount of Time for Binary Tree to Be Infected | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 609 | 100.00 |
2384 | Largest Palindromic Number | Medium | String, Hash_Table, Greedy | 252 | 100.00 |
2383 | Minimum Hours of Training to Win a Competition | Easy | Array, Greedy | 156 | 100.00 |
2382 | Maximum Segment Sum After Removals | Hard | Array, Prefix_Sum, Union_Find, Ordered_Set | 857 | 50.00 |
2381 | Shifting Letters II | Medium | Array, String, Prefix_Sum | 669 | 100.00 |
2380 | Time Needed to Rearrange a Binary String | Medium | String, Dynamic_Programming, Simulation | 149 | 100.00 |
2379 | Minimum Recolors to Get K Consecutive Black Blocks | Easy | String, Sliding_Window | 132 | 95.24 |
2376 | Count Special Integers | Hard | Dynamic_Programming, Math | 125 | 100.00 |
2375 | Construct Smallest Number From DI String | Medium | String, Greedy, Stack, Backtracking | 156 | 66.67 |
2374 | Node With Highest Edge Score | Medium | Hash_Table, Graph | 673 | 100.00 |
2373 | Largest Local Values in a Matrix | Easy | Array, Matrix | 264 | 100.00 |
2370 | Longest Ideal Subsequence | Medium | String, Hash_Table, Dynamic_Programming | 255 | 100.00 |
2369 | Check if There is a Valid Partition For The Array | Medium | Array, Dynamic_Programming | 533 | 100.00 |
2368 | Reachable Nodes With Restrictions | Medium | Array, Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Graph | 1199 | 76.92 |
2367 | Number of Arithmetic Triplets | Easy | Array, Hash_Table, Two_Pointers, Enumeration | 146 | 91.18 |
2366 | Minimum Replacements to Sort the Array | Hard | Array, Math, Greedy | 4 | 100.00 |
2365 | Task Scheduler II | Medium | Array, Hash_Table, Simulation | 595 | 100.00 |
2364 | Count Number of Bad Pairs | Medium | Array, Hash_Table | 590 | 100.00 |
2363 | Merge Similar Items | Easy | Array, Hash_Table, Sorting, Ordered_Set | 320 | 100.00 |
2360 | Longest Cycle in a Graph | Hard | Depth_First_Search, Graph, Topological_Sort | 517 | 80.00 |
2359 | Find Closest Node to Given Two Nodes | Medium | Depth_First_Search, Graph | 552 | 40.00 |
2358 | Maximum Number of Groups Entering a Competition | Medium | Array, Math, Greedy, Binary_Search | 441 | 100.00 |
2357 | Make Array Zero by Subtracting Equal Amounts | Easy | Array, Hash_Table, Sorting, Heap_Priority_Queue, Simulation | 156 | 78.95 |
2356 | Number of Unique Subjects Taught by Each Teacher | Easy | Database | 839 | 96.77 |
2354 | Number of Excellent Pairs | Hard | Array, Hash_Table, Binary_Search, Bit_Manipulation | 700 | 100.00 |
2353 | Design a Food Rating System | Medium | Hash_Table, Design, Heap_Priority_Queue, Ordered_Set | 1204 | 100.00 |
2352 | Equal Row and Column Pairs | Medium | Array, Hash_Table, Matrix, Simulation, LeetCode_75_Hash_Map/Set | 339 | 100.00 |
2351 | First Letter to Appear Twice | Easy | String, Hash_Table, Counting | 122 | 100.00 |
2350 | Shortest Impossible Sequence of Rolls | Hard | Array, Hash_Table, Greedy | 495 | 100.00 |
2349 | Design a Number Container System | Medium | Hash_Table, Design, Heap_Priority_Queue, Ordered_Set | 1011 | 100.00 |
2348 | Number of Zero-Filled Subarrays | Medium | Array, Math | 559 | 80.00 |
2347 | Best Poker Hand | Easy | Array, Hash_Table, Counting | 146 | 33.33 |
2344 | Minimum Deletions to Make Array Divisible | Hard | Array, Math, Sorting, Heap_Priority_Queue, Number_Theory | 542 | 100.00 |
2343 | Query Kth Smallest Trimmed Number | Medium | Array, String, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Radix_Sort | 382 | 100.00 |
2342 | Max Sum of a Pair With Equal Sum of Digits | Medium | Array, Hash_Table, Sorting, Heap_Priority_Queue | 636 | 83.33 |
2341 | Maximum Number of Pairs in Array | Easy | Array, Hash_Table, Sorting | 160 | 100.00 |
2338 | Count the Number of Ideal Arrays | Hard | Dynamic_Programming, Math, Number_Theory, Combinatorics | 201 | 100.00 |
2337 | Move Pieces to Obtain a String | Medium | String, Two_Pointers | 261 | 100.00 |
2336 | Smallest Number in Infinite Set | Medium | Hash_Table, Design, Heap_Priority_Queue, LeetCode_75_Heap/Priority_Queue | 308 | 95.45 |
2335 | Minimum Amount of Time to Fill Cups | Easy | Array, Greedy, Heap_Priority_Queue | 140 | 100.00 |
2334 | Subarray With Elements Greater Than Varying Threshold | Hard | Array, Stack, Union_Find, Monotonic_Stack | 889 | 100.00 |
2333 | Minimum Sum of Squared Difference | Medium | Array, Math, Sorting, Heap_Priority_Queue | 502 | 100.00 |
2332 | The Latest Time to Catch a Bus | Medium | Array, Sorting, Binary_Search, Two_Pointers | 522 | 75.00 |
2331 | Evaluate Boolean Binary Tree | Easy | Depth_First_Search, Tree, Binary_Search | 199 | 91.67 |
2328 | Number of Increasing Paths in a Grid | Hard | Array, Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Matrix, Graph, Memoization, Topological_Sort | 689 | 79.53 |
2327 | Number of People Aware of a Secret | Medium | Dynamic_Programming, Simulation, Queue | 121 | 100.00 |
2326 | Spiral Matrix IV | Medium | Array, Matrix, Simulation, Linked_List | 908 | 66.67 |
2325 | Decode the Message | Easy | String, Hash_Table | 169 | 96.88 |
2322 | Minimum Score After Removals on a Tree | Hard | Array, Depth_First_Search, Tree, Bit_Manipulation | 412 | 100.00 |
2321 | Maximum Score Of Spliced Array | Hard | Array, Dynamic_Programming | 497 | 50.00 |
2320 | Count Number of Ways to Place Houses | Medium | Dynamic_Programming | 122 | 100.00 |
2319 | Check if Matrix Is X-Matrix | Easy | Array, Matrix | 247 | 100.00 |
2318 | Number of Distinct Roll Sequences | Hard | Dynamic_Programming, Memoization | 441 | 100.00 |
2317 | Maximum XOR After Operations | Medium | Array, Math, Bit_Manipulation | 373 | 100.00 |
2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 981 | 87.50 |
2315 | Count Asterisks | Easy | String | 137 | 94.44 |
2312 | Selling Pieces of Wood | Hard | Backtracking | 396 | 100.00 |
2311 | Longest Binary Subsequence Less Than or Equal to K | Medium | String, Dynamic_Programming, Greedy, Memoization | 140 | 100.00 |
2310 | Sum of Numbers With Units Digit K | Medium | Math | 133 | 100.00 |
2309 | Greatest English Letter in Upper and Lower Case | Easy | Array | 154 | 87.50 |
2306 | Naming a Company | Hard | Array, String, Hash_Table, Bit_Manipulation, Enumeration | 590 | 100.00 |
2305 | Fair Distribution of Cookies | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 255 | 100.00 |
2304 | Minimum Path Cost in a Grid | Medium | Array, Dynamic_Programming, Matrix | 1048 | 100.00 |
2303 | Calculate Amount Paid in Taxes | Easy | Array, Simulation | 213 | 100.00 |
2302 | Count Subarrays With Score Less Than K | Hard | Array, Binary_Search, Prefix_Sum, Sliding_Window | 556 | 100.00 |
2301 | Match Substring After Replacement | Hard | Array, String, Hash_Table, String_Matching | 343 | 100.00 |
2300 | Successful Pairs of Spells and Potions | Medium | Array, Sorting, Binary_Search, Two_Pointers, LeetCode_75_Binary_Search | 818 | 72.22 |
2299 | Strong Password Checker II | Easy | String | 139 | 100.00 |
2296 | Design a Text Editor | Hard | String, Stack, Design, Simulation, Linked_List, Doubly_Linked_List | 1268 | 100.00 |
2295 | Replace Elements in an Array | Medium | Array, Hash_Table, Simulation | 913 | 100.00 |
2294 | Partition Array Such That Maximum Difference Is K | Medium | Array, Sorting, Greedy | 747 | 33.33 |
2293 | Min Max Game | Easy | Array, Simulation | 183 | 100.00 |
2290 | Minimum Obstacle Removal to Reach Corner | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue, Graph, Shortest_Path | 765 | 100.00 |
2289 | Steps to Make Array Non-decreasing | Medium | Array, Stack, Linked_List, Monotonic_Stack | 509 | 50.00 |
2288 | Apply Discount to Prices | Medium | String | 465 | 100.00 |
2287 | Rearrange Characters to Make Target String | Easy | String, Hash_Table, Counting | 122 | 100.00 |
2286 | Booking Concert Tickets in Groups | Hard | Binary_Search, Design, Segment_Tree, Binary_Indexed_Tree | 1292 | 100.00 |
2285 | Maximum Total Importance of Roads | Medium | Sorting, Greedy, Heap_Priority_Queue, Graph | 947 | 100.00 |
2284 | Sender With Largest Word Count | Medium | Array, String, Hash_Table, Counting | 672 | 100.00 |
2283 | Check if Number Has Equal Digit Count and Digit Value | Easy | String, Hash_Table, Counting | 136 | 100.00 |
2281 | Sum of Total Strength of Wizards | Hard | Array, Stack, Prefix_Sum, Monotonic_Stack | 673 | 100.00 |
2280 | Minimum Lines to Represent a Line Chart | Medium | Array, Math, Sorting, Geometry, Number_Theory | 765 | 100.00 |
2279 | Maximum Bags With Full Capacity of Rocks | Medium | Array, Sorting, Greedy | 551 | 80.00 |
2278 | Percentage of Letter in String | Easy | String | 122 | 100.00 |
2276 | Count Integers in Intervals | Hard | Design, Ordered_Set, Segment_Tree | 1256 | 100.00 |
2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium | Array, Hash_Table, Bit_Manipulation, Counting | 426 | 100.00 |
2274 | Maximum Consecutive Floors Without Special Floors | Medium | Array, Sorting | 532 | 100.00 |
2273 | Find Resultant Array After Removing Anagrams | Easy | Array, String, Hash_Table, Sorting | 200 | 93.75 |
2272 | Substring With Largest Variance | Hard | Array, Dynamic_Programming | 338 | 100.00 |
2271 | Maximum White Tiles Covered by a Carpet | Medium | Array, Sorting, Greedy, Binary_Search, Prefix_Sum | 692 | 100.00 |
2270 | Number of Ways to Split Array | Medium | Array, Prefix_Sum | 627 | 36.36 |
2269 | Find the K-Beauty of a Number | Easy | String, Math, Sliding_Window | 123 | 100.00 |
2267 | Check if There Is a Valid Parentheses String Path | Hard | Array, Dynamic_Programming, Matrix | 408 | 100.00 |
2266 | Count Number of Texts | Medium | String, Hash_Table, Dynamic_Programming, Math | 216 | 100.00 |
2265 | Count Nodes Equal to Average of Subtree | Medium | Depth_First_Search, Tree, Binary_Tree | 174 | 100.00 |
2264 | Largest 3-Same-Digit Number in String | Easy | String | 145 | 100.00 |
2262 | Total Appeal of A String | Hard | String, Hash_Table, Dynamic_Programming | 202 | 100.00 |
2261 | K Divisible Elements Subarrays | Medium | Array, Hash_Table, Trie, Enumeration, Hash_Function, Rolling_Hash | 263 | 100.00 |
2260 | Minimum Consecutive Cards to Pick Up | Medium | Array, Hash_Table, Sliding_Window | 646 | 33.33 |
2259 | Remove Digit From Number to Maximize Result | Easy | String, Greedy, Enumeration | 137 | 100.00 |
2258 | Escape the Spreading Fire | Hard | Array, Breadth_First_Search, Binary_Search, Matrix | 304 | 100.00 |
2257 | Count Unguarded Cells in the Grid | Medium | Array, Matrix, Simulation | 901 | 100.00 |
2256 | Minimum Average Difference | Medium | Array, Prefix_Sum | 527 | 100.00 |
2255 | Count Prefixes of a Given String | Easy | Array, String | 162 | 100.00 |
2251 | Number of Flowers in Full Bloom | Hard | Array, Hash_Table, Sorting, Binary_Search, Prefix_Sum, Ordered_Set | 973 | 100.00 |
2250 | Count Number of Rectangles Containing Each Point | Medium | Array, Sorting, Binary_Search, Binary_Indexed_Tree | 967 | 100.00 |
2249 | Count Lattice Points Inside a Circle | Medium | Array, Hash_Table, Math, Enumeration, Geometry | 204 | 100.00 |
2248 | Intersection of Multiple Arrays | Easy | Array, Hash_Table, Counting | 197 | 100.00 |
2246 | Longest Path With Different Adjacent Characters | Hard | Array, String, Depth_First_Search, Tree, Graph, Topological_Sort | 828 | 100.00 |
2245 | Maximum Trailing Zeros in a Cornered Path | Medium | Array, Matrix, Prefix_Sum | 888 | 100.00 |
2244 | Minimum Rounds to Complete All Tasks | Medium | Array, Hash_Table, Greedy, Counting | 584 | 73.68 |
2243 | Calculate Digit Sum of a String | Easy | String, Simulation | 141 | 100.00 |
2242 | Maximum Score of a Node Sequence | Hard | Array, Sorting, Graph, Enumeration | 844 | 100.00 |
2241 | Design an ATM Machine | Medium | Array, Greedy, Design | 764 | 100.00 |
2240 | Number of Ways to Buy Pens and Pencils | Medium | Math, Enumeration | 143 | 100.00 |
2239 | Find Closest Number to Zero | Easy | Array | 245 | 66.67 |
2236 | Root Equals Sum of Children | Easy | Tree, Binary_Tree | 141 | 86.73 |
2235 | Add Two Integers | Easy | Math | 131 | 65.81 |
2234 | Maximum Total Beauty of the Gardens | Hard | Array, Sorting, Greedy, Binary_Search, Two_Pointers | 699 | 100.00 |
2233 | Maximum Product After K Increments | Medium | Array, Greedy, Heap_Priority_Queue | 766 | 100.00 |
2232 | Minimize Result by Adding Parentheses to Expression | Medium | String, Enumeration | 191 | 100.00 |
2231 | Largest Number After Digit Swaps by Parity | Easy | Sorting, Heap_Priority_Queue | 124 | 100.00 |
2227 | Encrypt and Decrypt Strings | Hard | Array, String, Hash_Table, Design, Trie | 483 | 75.00 |
2226 | Maximum Candies Allocated to K Children | Medium | Array, Binary_Search | 544 | 66.67 |
2225 | Find Players With Zero or One Losses | Medium | Array, Hash_Table, Sorting, Counting | 1323 | 65.79 |
2224 | Minimum Number of Operations to Convert Time | Easy | String, Greedy | 155 | 66.67 |
2223 | Sum of Scores of Built Strings | Hard | String, Binary_Search, Hash_Function, String_Matching, Rolling_Hash, Suffix_Array | 264 | 100.00 |
2222 | Number of Ways to Select Buildings | Medium | String, Dynamic_Programming, Prefix_Sum | 261 | 100.00 |
2221 | Find Triangular Sum of an Array | Medium | Array, Math, Simulation, Combinatorics | 257 | 100.00 |
2220 | Minimum Bit Flips to Convert Number | Easy | Bit_Manipulation | 131 | 70.59 |
2218 | Maximum Value of K Coins From Piles | Hard | Array, Dynamic_Programming, Prefix_Sum | 313 | 100.00 |
2217 | Find Palindrome With Fixed Length | Medium | Array, Math | 541 | 100.00 |
2216 | Minimum Deletions to Make Array Beautiful | Medium | Array, Greedy, Stack | 567 | 66.67 |
2215 | Find the Difference of Two Arrays | Easy | Array, Hash_Table, LeetCode_75_Hash_Map/Set | 352 | 98.63 |
2213 | Longest Substring of One Repeating Character | Hard | Array, String, Ordered_Set, Segment_Tree | 73 | 100.00 |
2212 | Maximum Points in an Archery Competition | Medium | Array, Bit_Manipulation, Recursion, Enumeration | 210 | 100.00 |
2211 | Count Collisions on a Road | Medium | String, Stack | 325 | 100.00 |
2210 | Count Hills and Valleys in an Array | Easy | Array | 153 | 80.00 |
2209 | Minimum White Tiles After Covering With Carpets | Hard | String, Dynamic_Programming, Prefix_Sum | 373 | 100.00 |
2208 | Minimum Operations to Halve Array Sum | Medium | Array, Greedy, Heap_Priority_Queue | 628 | 33.33 |
2207 | Maximize Number of Subsequences in a String | Medium | String, Greedy, Prefix_Sum | 295 | 100.00 |
2206 | Divide Array Into Equal Pairs | Easy | Array, Hash_Table, Bit_Manipulation, Counting | 221 | 71.43 |
2203 | Minimum Weighted Subgraph With the Required Paths | Hard | Graph, Shortest_Path | 1126 | 100.00 |
2202 | Maximize the Topmost Element After K Moves | Medium | Array, Greedy | 491 | 50.00 |
2201 | Count Artifacts That Can Be Extracted | Medium | Array, Hash_Table, Simulation | 1011 | 100.00 |
2200 | Find All K-Distant Indices in an Array | Easy | Array | 200 | 100.00 |
2197 | Replace Non-Coprime Numbers in Array | Hard | Array, Math, Stack, Number_Theory | 917 | 100.00 |
2196 | Create Binary Tree From Descriptions | Medium | Array, Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 933 | 100.00 |
2195 | Append K Integers With Minimal Sum | Medium | Array, Math, Sorting, Greedy | 542 | 100.00 |
2194 | Cells in a Range on an Excel Sheet | Easy | String | 176 | 100.00 |
2193 | Minimum Number of Moves to Make Palindrome | Hard | String, Greedy, Two_Pointers, Binary_Indexed_Tree | 176 | 100.00 |
2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 841 | 100.00 |
2191 | Sort the Jumbled Numbers | Medium | Array, Sorting | 821 | 100.00 |
2190 | Most Frequent Number Following Key In an Array | Easy | Array, Hash_Table, Counting | 188 | 100.00 |
2188 | Minimum Time to Finish the Race | Hard | Array, Dynamic_Programming | 1220 | 100.00 |
2187 | Minimum Time to Complete Trips | Medium | Array, Binary_Search | 660 | 90.91 |
2186 | Minimum Number of Steps to Make Two Strings Anagram II | Medium | String, Hash_Table, Counting | 304 | 100.00 |
2185 | Counting Words With a Given Prefix | Easy | Array, String | 172 | 100.00 |
2183 | Count Array Pairs Divisible by K | Hard | Array, Math, Number_Theory | 756 | 100.00 |
2182 | Construct String With Repeat Limit | Medium | String, Greedy, Heap_Priority_Queue, Counting | 311 | 100.00 |
2181 | Merge Nodes in Between Zeros | Medium | Simulation, Linked_List | 794 | 100.00 |
2180 | Count Integers With Even Digit Sum | Easy | Math, Simulation | 126 | 100.00 |
2179 | Count Good Triplets in an Array | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 563 | 100.00 |
2178 | Maximum Split of Positive Even Integers | Medium | Math, Greedy | 486 | 55.56 |
2177 | Find Three Consecutive Integers That Sum to a Given Number | Medium | Math, Simulation | 160 | 100.00 |
2176 | Count Equal and Divisible Pairs in an Array | Easy | Array | 179 | 69.23 |
2172 | Maximum AND Sum of Array | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 165 | 100.00 |
2171 | Removing Minimum Number of Magic Beans | Medium | Array, Sorting, Prefix_Sum | 728 | 100.00 |
2170 | Minimum Operations to Make the Array Alternating | Medium | Array, Hash_Table, Greedy, Counting | 531 | 100.00 |
2169 | Count Operations to Obtain Zero | Easy | Math, Simulation | 127 | 77.78 |
2167 | Minimum Time to Remove All Cars Containing Illegal Goods | Hard | String, Dynamic_Programming | 312 | 100.00 |
2166 | Design Bitset | Medium | Array, Hash_Table, Design | 1036 | 100.00 |
2165 | Smallest Value of the Rearranged Number | Medium | Math, Sorting | 129 | 100.00 |
2164 | Sort Even and Odd Indices Independently | Easy | Array, Sorting | 200 | 100.00 |
2163 | Minimum Difference in Sums After Removal of Elements | Hard | Array, Dynamic_Programming, Heap_Priority_Queue | 854 | 100.00 |
2162 | Minimum Cost to Set Cooking Time | Medium | Math, Enumeration | 134 | 100.00 |
2161 | Partition Array According to Given Pivot | Medium | Array, Two_Pointers, Simulation | 859 | 46.15 |
2160 | Minimum Sum of Four Digit Number After Splitting Digits | Easy | Math, Sorting, Greedy | 133 | 88.24 |
2157 | Groups of Strings | Hard | String, Bit_Manipulation, Union_Find | 930 | 100.00 |
2156 | Find Substring With Given Hash Value | Hard | String, Sliding_Window, Hash_Function, Rolling_Hash | 248 | 100.00 |
2155 | All Divisions With the Highest Score of a Binary Array | Medium | Array | 1171 | 100.00 |
2154 | Keep Multiplying Found Values by Two | Easy | Array, Hash_Table, Sorting, Simulation | 183 | 85.71 |
2151 | Maximum Good People Based on Statements | Hard | Array, Bit_Manipulation, Backtracking, Enumeration | 308 | 100.00 |
2150 | Find All Lonely Numbers in the Array | Medium | Array, Hash_Table, Counting | 1045 | 50.00 |
2149 | Rearrange Array Elements by Sign | Medium | Array, Two_Pointers, Simulation | 873 | 42.86 |
2148 | Count Elements With Strictly Smaller and Greater Elements | Easy | Array, Sorting | 148 | 83.33 |
2147 | Number of Ways to Divide a Long Corridor | Hard | String, Dynamic_Programming, Math | 361 | 100.00 |
2146 | K Highest Ranked Items Within a Price Range | Medium | Array, Sorting, Breadth_First_Search, Matrix, Heap_Priority_Queue | 1373 | 100.00 |
2145 | Count the Hidden Sequences | Medium | Array, Prefix_Sum | 641 | 100.00 |
2144 | Minimum Cost of Buying Candies With Discount | Easy | Array, Sorting, Greedy | 169 | 75.00 |
2141 | Maximum Running Time of N Computers | Hard | Array, Sorting, Greedy | ch | ch |
2140 | Solving Questions With Brainpower | Medium | Array, Dynamic_Programming | 753 | 66.97 |
2139 | Minimum Moves to Reach Target Score | Medium | Math, Greedy | 123 | 100.00 |
2138 | Divide a String Into Groups of Size k | Easy | String, Simulation | 173 | 75.00 |
2136 | Earliest Possible Day of Full Bloom | Hard | Array, Sorting, Greedy | 968 | 100.00 |
2135 | Count Words Obtained After Adding a Letter | Medium | Array, String, Hash_Table, Sorting, Bit_Manipulation | 556 | 100.00 |
2134 | Minimum Swaps to Group All 1’s Together II | Medium | Array, Sliding_Window | 465 | 33.33 |
2133 | Check if Every Row and Column Contains All Numbers | Easy | Array, Hash_Table, Matrix | 404 | 100.00 |
2132 | Stamping the Grid | Hard | Array, Greedy, Matrix, Prefix_Sum | 1158 | 100.00 |
2131 | Longest Palindrome by Concatenating Two Letter Words | Medium | Array, String, Hash_Table, Greedy, Counting, Level_2_Day_5_Greedy | 607 | 90.00 |
2130 | Maximum Twin Sum of a Linked List | Medium | Two_Pointers, Stack, Linked_List, LeetCode_75_LinkedList | 458 | 93.88 |
2129 | Capitalize the Title | Easy | String | 140 | 100.00 |
2127 | Maximum Employees to Be Invited to a Meeting | Hard | Depth_First_Search, Graph, Topological_Sort | 572 | 100.00 |
2126 | Destroying Asteroids | Medium | Array, Sorting, Greedy | 560 | 100.00 |
2125 | Number of Laser Beams in a Bank | Medium | Array, String, Math, Matrix | 297 | 100.00 |
2124 | Check if All A’s Appears Before All B’s | Easy | String | 136 | 87.50 |
2122 | Recover the Original Array | Hard | Array, Hash_Table, Sorting, Enumeration | 299 | 100.00 |
2121 | Intervals Between Identical Elements | Medium | Array, Hash_Table, Prefix_Sum | 1022 | 100.00 |
2120 | Execution of All Suffix Instructions Staying in a Grid | Medium | String, Simulation | 215 | 100.00 |
2119 | A Number After a Double Reversal | Easy | Math | 127 | 89.47 |
2117 | Abbreviating the Product of a Range | Hard | Math | 232 | 100.00 |
2116 | Check if a Parentheses String Can Be Valid | Medium | String, Greedy, Stack | 315 | 42.86 |
2115 | Find All Possible Recipes from Given Supplies | Medium | Array, String, Hash_Table, Graph, Topological_Sort | 514 | 100.00 |
2114 | Maximum Number of Words Found in Sentences | Easy | Array, String | 183 | 88.64 |
2111 | Minimum Operations to Make the Array K-Increasing | Hard | Array, Binary_Search | 558 | 100.00 |
2110 | Number of Smooth Descent Periods of a Stock | Medium | Array, Dynamic_Programming, Math | 582 | 100.00 |
2109 | Adding Spaces to a String | Medium | Array, String, Simulation | 624 | 100.00 |
2108 | Find First Palindromic String in the Array | Easy | Array, String, Two_Pointers | 242 | 100.00 |
2106 | Maximum Fruits Harvested After at Most K Steps | Hard | Array, Binary_Search, Prefix_Sum, Sliding_Window | 816 | 100.00 |
2105 | Watering Plants II | Medium | Array, Two_Pointers, Simulation | 531 | 50.00 |
2104 | Sum of Subarray Ranges | Medium | Array, Stack, Monotonic_Stack | 212 | 100.00 |
2103 | Rings and Rods | Easy | String, Hash_Table | 131 | 89.47 |
2102 | Sequentially Ordinal Rank Tracker | Hard | Design, Heap_Priority_Queue, Ordered_Set, Data_Stream | 1208 | 100.00 |
2101 | Detonate the Maximum Bombs | Medium | Array, Math, Depth_First_Search, Breadth_First_Search, Graph, Geometry | 262 | 98.96 |
2100 | Find Good Days to Rob the Bank | Medium | Array, Dynamic_Programming, Prefix_Sum | 695 | 100.00 |
2099 | Find Subsequence of Length K With the Largest Sum | Easy | Array, Hash_Table, Sorting, Heap_Priority_Queue | 203 | 100.00 |
2097 | Valid Arrangement of Pairs | Hard | Depth_First_Search, Graph, Eulerian_Circuit | 2120 | 100.00 |
2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium | String, Depth_First_Search, Tree, Binary_Tree | 690 | 93.33 |
2095 | Delete the Middle Node of a Linked List | Medium | Two_Pointers, Linked_List, LeetCode_75_LinkedList | 1115 | 50.00 |
2094 | Finding 3-Digit Even Numbers | Easy | Array, Hash_Table, Sorting, Enumeration | 181 | 100.00 |
2092 | Find All People With Secret | Hard | Sorting, Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 1086 | 100.00 |
2091 | Removing Minimum and Maximum From Array | Medium | Array, Greedy | 607 | 100.00 |
2090 | K Radius Subarray Averages | Medium | Array, Sliding_Window | 874 | 85.63 |
2089 | Find Target Indices After Sorting Array | Easy | Array, Sorting, Binary_Search | 180 | 90.48 |
2088 | Count Fertile Pyramids in a Land | Hard | Array, Dynamic_Programming, Matrix | 489 | 100.00 |
2087 | Minimum Cost Homecoming of a Robot in a Grid | Medium | Array, Greedy, Matrix | 672 | 100.00 |
2086 | Minimum Number of Buckets Required to Collect Rainwater from Houses | Medium | String, Dynamic_Programming, Greedy | 208 | 100.00 |
2085 | Count Common Words With One Occurrence | Easy | Array, String, Hash_Table, Counting | 192 | 100.00 |
2081 | Sum of k-Mirror Numbers | Hard | Math, Enumeration | 455 | 100.00 |
2080 | Range Frequency Queries | Medium | Array, Hash_Table, Binary_Search, Design, Segment_Tree | 1102 | 100.00 |
2079 | Watering Plants | Medium | Array | 157 | 100.00 |
2078 | Two Furthest Houses With Different Colors | Easy | Array, Greedy | 131 | 100.00 |
2076 | Process Restricted Friend Requests | Hard | Graph, Union_Find | 355 | 100.00 |
2075 | Decode the Slanted Ciphertext | Medium | String, Simulation | 418 | 100.00 |
2074 | Reverse Nodes in Even Length Groups | Medium | Linked_List | 1197 | 50.00 |
2073 | Time Needed to Buy Tickets | Easy | Array, Simulation, Queue | 145 | 100.00 |
2071 | Maximum Number of Tasks You Can Assign | Hard | Array, Sorting, Greedy, Binary_Search, Queue, Monotonic_Queue | 747 | 100.00 |
2070 | Most Beautiful Item for Each Query | Medium | Array, Sorting, Binary_Search | 747 | 100.00 |
2069 | Walking Robot Simulation II | Medium | Design, Simulation | 636 | 100.00 |
2068 | Check Whether Two Strings are Almost Equivalent | Easy | String, Hash_Table, Counting | 131 | 100.00 |
2065 | Maximum Path Quality of a Graph | Hard | Array, Graph, Backtracking | 429 | 100.00 |
2064 | Minimized Maximum of Products Distributed to Any Store | Medium | Array, Binary_Search | 609 | 100.00 |
2063 | Vowels of All Substrings | Medium | String, Dynamic_Programming, Math, Combinatorics | 206 | 100.00 |
2062 | Count Vowel Substrings of a String | Easy | String, Hash_Table | 216 | 60.00 |
2060 | Check if an Original String Exists Given Two Encoded Strings | Hard | String, Dynamic_Programming | 1219 | 100.00 |
2059 | Minimum Operations to Convert Number | Medium | Array, Breadth_First_Search | 285 | 66.67 |
2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | Linked_List | 602 | 50.00 |
2057 | Smallest Index With Equal Value | Easy | Array | 178 | 100.00 |
2056 | Number of Valid Move Combinations On Chessboard | Hard | Array, String, Simulation, Backtracking | 600 | 100.00 |
2055 | Plates Between Candles | Medium | Array, String, Binary_Search, Prefix_Sum | 831 | 100.00 |
2054 | Two Best Non-Overlapping Events | Medium | Array, Dynamic_Programming, Sorting, Binary_Search, Heap_Priority_Queue | 851 | 100.00 |
2053 | Kth Distinct String in an Array | Easy | Array, String, Hash_Table, Counting | 181 | 90.00 |
2050 | Parallel Courses III | Hard | Dynamic_Programming, Graph, Topological_Sort | 974 | 100.00 |
2049 | Count Nodes With the Highest Score | Medium | Array, Depth_First_Search, Tree, Binary_Tree | 483 | 100.00 |
2048 | Next Greater Numerically Balanced Number | Medium | Math, Backtracking, Enumeration | 138 | 100.00 |
2047 | Number of Valid Words in a Sentence | Easy | String | 202 | 100.00 |
2045 | Second Minimum Time to Reach Destination | Hard | Breadth_First_Search, Graph, Shortest_Path | 862 | 100.00 |
2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | Array, Bit_Manipulation, Backtracking | 140 | 100.00 |
2043 | Simple Bank System | Medium | Array, Hash_Table, Design, Simulation | 968 | 100.00 |
2042 | Check if Numbers Are Ascending in a Sentence | Easy | String | 161 | 64.29 |
2040 | Kth Smallest Product of Two Sorted Arrays | Hard | Array, Binary_Search | 1001 | 100.00 |
2039 | The Time When the Network Becomes Idle | Medium | Array, Breadth_First_Search, Graph | 1197 | 100.00 |
2038 | Remove Colored Pieces if Both Neighbors are the Same Color | Medium | String, Math, Greedy, Game_Theory | 216 | 74.36 |
2037 | Minimum Number of Moves to Seat Everyone | Easy | Array, Sorting | 189 | 80.00 |
2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | Array, Dynamic_Programming, Binary_Search, Two_Pointers, Bit_Manipulation, Ordered_Set, Bitmask | 1318 | 100.00 |
2034 | Stock Price Fluctuation | Medium | Hash_Table, Design, Heap_Priority_Queue, Ordered_Set, Data_Stream | 985 | 100.00 |
2033 | Minimum Operations to Make a Uni-Value Grid | Medium | Array, Math, Sorting, Matrix | 744 | 100.00 |
2032 | Two Out of Three | Easy | Array, Hash_Table | 251 | 83.33 |
2030 | Smallest K-Length Subsequence With Occurrences of a Letter | Hard | String, Greedy, Stack, Monotonic_Stack | 501 | 100.00 |
2029 | Stone Game IX | Medium | Array, Math, Greedy, Counting, Game_Theory | 574 | 100.00 |
2028 | Find Missing Observations | Medium | Array, Math, Simulation | 654 | 33.33 |
2027 | Minimum Moves to Convert String | Easy | String, Greedy | 142 | 100.00 |
2025 | Maximum Number of Ways to Partition an Array | Hard | Array, Hash_Table, Prefix_Sum, Counting, Enumeration | 1163 | 100.00 |
2024 | Maximize the Confusion of an Exam | Medium | String, Binary_Search, Prefix_Sum, Sliding_Window | 223 | 83.33 |
2023 | Number of Pairs of Strings With Concatenation Equal to Target | Medium | Array, String | 228 | 40.00 |
2022 | Convert 1D Array Into 2D Array | Easy | Array, Matrix, Simulation | 631 | 100.00 |
2019 | The Score of Students Solving Math Expression | Hard | Array, String, Dynamic_Programming, Math, Stack, Memoization | 1497 | 100.00 |
2018 | Check if Word Can Be Placed In Crossword | Medium | Array, Matrix, Enumeration | 698 | 100.00 |
2017 | Grid Game | Medium | Array, Matrix, Prefix_Sum | 578 | 87.50 |
2016 | Maximum Difference Between Increasing Elements | Easy | Array | 140 | 100.00 |
2014 | Longest Subsequence Repeated k Times | Hard | String, Greedy, Backtracking, Counting, Enumeration | 333 | 100.00 |
2013 | Detect Squares | Medium | Array, Hash_Table, Design, Counting | 511 | 100.00 |
2012 | Sum of Beauty in the Array | Medium | Array | 511 | 100.00 |
2011 | Final Value of Variable After Performing Operations | Easy | Array, String, Simulation | 178 | 44.55 |
2009 | Minimum Number of Operations to Make Array Continuous | Hard | Array, Binary_Search | 603 | 100.00 |
2008 | Maximum Earnings From Taxi | Medium | Array, Dynamic_Programming, Sorting, Binary_Search | 1008 | 100.00 |
2007 | Find Original Array From Doubled Array | Medium | Array, Hash_Table, Sorting, Greedy | 753 | 100.00 |
2006 | Count Number of Pairs With Absolute Difference K | Easy | Array, Hash_Table, Counting | 186 | 100.00 |
2003 | Smallest Missing Genetic Value in Each Subtree | Hard | Dynamic_Programming, Depth_First_Search, Tree, Union_Find | 984 | 100.00 |
2002 | Maximum Product of the Length of Two Palindromic Subsequences | Medium | String, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 389 | 100.00 |
2001 | Number of Pairs of Interchangeable Rectangles | Medium | Array, Hash_Table, Math, Counting, Number_Theory | 797 | 100.00 |
2000 | Reverse Prefix of Word | Easy | String, Two_Pointers | 164 | 31.25 |
1998 | GCD Sort of an Array | Hard | Array, Math, Sorting, Union_Find | 437 | 100.00 |
1997 | First Day Where You Have Been in All the Rooms | Medium | Array, Dynamic_Programming | 572 | 100.00 |
1996 | The Number of Weak Characters in the Game | Medium | Array, Sorting, Greedy, Stack, Monotonic_Stack | 1234 | 100.00 |
1995 | Count Special Quadruplets | Easy | Array, Enumeration | 146 | 100.00 |
1994 | The Number of Good Subsets | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Bitmask | 737 | 100.00 |
1993 | Operations on Tree | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Design | 1117 | 100.00 |
1992 | Find All Groups of Farmland | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 768 | 100.00 |
1991 | Find the Middle Index in Array | Easy | Array, Prefix_Sum | 142 | 100.00 |
1987 | Number of Unique Good Subsequences | Hard | String, Dynamic_Programming | 248 | 100.00 |
1986 | Minimum Number of Work Sessions to Finish the Tasks | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 153 | 100.00 |
1985 | Find the Kth Largest Integer in the Array | Medium | Array, String, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect | 397 | 100.00 |
1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | Array, Sorting, Sliding_Window | 227 | 83.33 |
1982 | Find Array Given Subset Sums | Hard | Array, Divide_and_Conquer | 640 | 100.00 |
1981 | Minimize the Difference Between Target and Chosen Elements | Medium | Array, Dynamic_Programming, Matrix | 588 | 100.00 |
1980 | Find Unique Binary String | Medium | Array, String, Backtracking | 186 | 50.00 |
1979 | Find Greatest Common Divisor of Array | Easy | Array, Math, Number_Theory | 172 | 100.00 |
1978 | Employees Whose Manager Left the Company | Easy | Database | 686 | 64.74 |
1977 | Number of Ways to Separate Numbers | Hard | String, Dynamic_Programming, Suffix_Array | 199 | 100.00 |
1976 | Number of Ways to Arrive at Destination | Medium | Dynamic_Programming, Graph, Topological_Sort, Shortest_Path | 282 | 100.00 |
1975 | Maximum Matrix Sum | Medium | Array, Greedy, Matrix | 535 | 100.00 |
1974 | Minimum Time to Type Word Using Special Typewriter | Easy | String, Greedy | 139 | 71.43 |
1971 | Find if Path Exists in Graph | Easy | Depth_First_Search, Breadth_First_Search, Graph | 949 | 86.89 |
1970 | Last Day Where You Can Still Cross | Hard | Array, Depth_First_Search, Breadth_First_Search, Binary_Search, Matrix, Union_Find | 703 | 100.00 |
1969 | Minimum Non-Zero Product of the Array Elements | Medium | Math, Greedy, Recursion | 131 | 100.00 |
1968 | Array With Elements Not Equal to Average of Neighbors | Medium | Array, Sorting, Greedy | 973 | 83.33 |
1967 | Number of Strings That Appear as Substrings in Word | Easy | String | 157 | 100.00 |
1965 | Employees With Missing Information | Easy | Database, SQL_I_Day_4_Union_and_Select | 949 | 88.66 |
1964 | Find the Longest Valid Obstacle Course at Each Position | Hard | Array, Binary_Search, Binary_Indexed_Tree | 846 | 40.00 |
1963 | Minimum Number of Swaps to Make the String Balanced | Medium | String, Greedy, Two_Pointers, Stack | 291 | 53.85 |
1962 | Remove Stones to Minimize the Total | Medium | Array, Heap_Priority_Queue | 888 | 68.42 |
1961 | Check If String Is a Prefix of Array | Easy | Array, String | 162 | 100.00 |
1960 | Maximum Product of the Length of Two Palindromic Substrings | Hard | String, Hash_Function, Rolling_Hash | 247 | 100.00 |
1959 | Minimum Total Space Wasted With K Resizing Operations | Medium | Array, Dynamic_Programming | 225 | 100.00 |
1958 | Check if Move is Legal | Medium | Array, Matrix, Enumeration | 169 | 100.00 |
1957 | Delete Characters to Make Fancy String | Easy | String | 377 | 50.00 |
1955 | Count Number of Special Subsequences | Hard | Array, Dynamic_Programming | 620 | 100.00 |
1954 | Minimum Garden Perimeter to Collect Enough Apples | Medium | Math, Binary_Search | 132 | 100.00 |
1953 | Maximum Number of Weeks for Which You Can Work | Medium | Array, Greedy | 461 | 100.00 |
1952 | Three Divisors | Easy | Math | 141 | 33.33 |
1948 | Delete Duplicate Folders in System | Hard | Array, String, Hash_Table, Trie, Hash_Function | 1420 | 100.00 |
1947 | Maximum Compatibility Score Sum | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 179 | 100.00 |
1946 | Largest Number After Mutating Substring | Medium | Array, String, Greedy | 346 | 100.00 |
1945 | Sum of Digits of String After Convert | Easy | String, Simulation | 146 | 75.00 |
1944 | Number of Visible People in a Queue | Hard | Array, Stack, Monotonic_Stack | 605 | 90.00 |
1943 | Describe the Painting | Medium | Array, Prefix_Sum | 951 | 100.00 |
1942 | The Number of the Smallest Unoccupied Chair | Medium | Array, Heap_Priority_Queue, Ordered_Set | 549 | 100.00 |
1941 | Check if All Characters Have Equal Number of Occurrences | Easy | String, Hash_Table, Counting | 167 | 78.57 |
1938 | Maximum Genetic Difference Query | Hard | Array, Bit_Manipulation, Trie | 855 | 100.00 |
1937 | Maximum Number of Points with Cost | Medium | Array, Dynamic_Programming | 886 | 100.00 |
1936 | Add Minimum Number of Rungs | Medium | Array, Greedy | 405 | 100.00 |
1935 | Maximum Number of Words You Can Type | Easy | String, Hash_Table | 178 | 37.50 |
1934 | Confirmation Rate | Medium | Database | 1602 | 35.78 |
1932 | Merge BSTs to Create Single BST | Hard | Hash_Table, Depth_First_Search, Tree, Binary_Search, Binary_Tree | 1146 | 100.00 |
1931 | Painting a Grid With Three Different Colors | Hard | Dynamic_Programming | 135 | 100.00 |
1930 | Unique Length-3 Palindromic Subsequences | Medium | String, Hash_Table, Prefix_Sum | 273 | 100.00 |
1929 | Concatenation of Array | Easy | Array | 220 | 94.47 |
1928 | Minimum Cost to Reach Destination in Time | Hard | Dynamic_Programming, Graph | 414 | 100.00 |
1927 | Sum Game | Medium | Math, Greedy, Game_Theory | 211 | 100.00 |
1926 | Nearest Exit from Entrance in Maze | Medium | Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS, Graph_Theory_I_Day_6_Matrix_Related_Problems | 351 | 94.44 |
1925 | Count Square Sum Triples | Easy | Math, Enumeration | 161 | 40.00 |
1923 | Longest Common Subpath | Hard | Array, Binary_Search, Hash_Function, Rolling_Hash, Suffix_Array | 1142 | 100.00 |
1922 | Count Good Numbers | Medium | Math, Recursion | 135 | 100.00 |
1921 | Eliminate Maximum Number of Monsters | Medium | Array, Sorting, Greedy | 507 | 100.00 |
1920 | Build Array from Permutation | Easy | Array, Simulation | 252 | 81.25 |
1916 | Count Ways to Build Rooms in an Ant Colony | Hard | Dynamic_Programming, Math, Tree, Graph, Topological_Sort, Combinatorics | 2564 | 100.00 |
1915 | Number of Wonderful Substrings | Medium | String, Hash_Table, Bit_Manipulation, Prefix_Sum | 267 | 100.00 |
1914 | Cyclically Rotating a Grid | Medium | Array, Matrix, Simulation | 282 | 100.00 |
1913 | Maximum Product Difference Between Two Pairs | Easy | Array, Sorting | 261 | 100.00 |
1912 | Design Movie Rental System | Hard | Array, Hash_Table, Design, Heap_Priority_Queue, Ordered_Set | 3005 | 100.00 |
1911 | Maximum Alternating Subsequence Sum | Medium | Array, Dynamic_Programming | 531 | 100.00 |
1910 | Remove All Occurrences of a Substring | Medium | String | 177 | 100.00 |
1909 | Remove One Element to Make the Array Strictly Increasing | Easy | Array | 176 | 50.00 |
1907 | Count Salary Categories | Medium | Database | 2283 | 89.29 |
1906 | Minimum Absolute Difference Queries | Medium | Array, Hash_Table | 1069 | 50.00 |
1905 | Count Sub Islands | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Graph_Theory_I_Day_3_Matrix_Related_Problems | 866 | 100.00 |
1904 | The Number of Full Rounds You Have Played | Medium | String, Math | 149 | 100.00 |
1903 | Largest Odd Number in String | Easy | String, Math, Greedy | 256 | 75.00 |
1901 | Find a Peak Element II | Medium | Array, Binary_Search, Matrix, Divide_and_Conquer, Binary_Search_II_Day_17 | 726 | 100.00 |
1900 | The Earliest and Latest Rounds Where Players Compete | Hard | Dynamic_Programming, Memoization | 142 | 100.00 |
1899 | Merge Triplets to Form Target Triplet | Medium | Array, Greedy | 954 | 71.43 |
1898 | Maximum Number of Removable Characters | Medium | Array, String, Binary_Search, Binary_Search_II_Day_6 | 636 | 100.00 |
1897 | Redistribute Characters to Make All Strings Equal | Easy | String, Hash_Table, Counting | 179 | 100.00 |
1896 | Minimum Cost to Change the Final Value of Expression | Hard | String, Dynamic_Programming, Math, Stack | 252 | 100.00 |
1895 | Largest Magic Square | Medium | Array, Matrix, Prefix_Sum | 202 | 100.00 |
1894 | Find the Student that Will Replace the Chalk | Medium | Array, Binary_Search, Simulation, Prefix_Sum, Binary_Search_II_Day_2 | 520 | 50.00 |
1893 | Check if All the Integers in a Range Are Covered | Easy | Array, Hash_Table, Prefix_Sum | 140 | 100.00 |
1890 | The Latest Login in 2020 | Easy | Database, SQL_I_Day_8_Function | 1280 | 43.62 |
1889 | Minimum Space Wasted From Packaging | Hard | Array, Sorting, Binary_Search, Prefix_Sum | 910 | 100.00 |
1888 | Minimum Number of Flips to Make the Binary String Alternating | Medium | String, Greedy | 259 | 87.50 |
1887 | Reduction Operations to Make the Array Elements Equal | Medium | Array, Sorting | 457 | 100.00 |
1886 | Determine Whether Matrix Can Be Obtained By Rotation | Easy | Array, Matrix, Programming_Skills_II_Day_7 | 147 | 85.71 |
1884 | Egg Drop With 2 Eggs and N Floors | Medium | Dynamic_Programming, Math | 130 | 100.00 |
1883 | Minimum Skips to Arrive at Meeting On Time | Hard | Array, Dynamic_Programming | 278 | 100.00 |
1882 | Process Tasks Using Servers | Medium | Array, Heap_Priority_Queue | 1085 | 100.00 |
1881 | Maximum Value after Insertion | Medium | String, Greedy | 362 | 100.00 |
1880 | Check if Word Equals Summation of Two Words | Easy | String | 139 | 80.00 |
1879 | Minimum XOR Sum of Two Arrays | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 173 | 100.00 |
1878 | Get Biggest Three Rhombus Sums in a Grid | Medium | Array, Math, Sorting, Matrix, Heap_Priority_Queue, Prefix_Sum | 326 | 100.00 |
1877 | Minimize Maximum Pair Sum in Array | Medium | Array, Sorting, Greedy, Two_Pointers | 668 | 50.00 |
1876 | Substrings of Size Three with Distinct Characters | Easy | String, Hash_Table, Counting, Sliding_Window | 144 | 91.67 |
1873 | Calculate Special Bonus | Easy | Database, SQL_I_Day_2_Select_and_Order | 1321 | 33.12 |
1872 | Stone Game VIII | Hard | Array, Dynamic_Programming, Math, Prefix_Sum, Game_Theory | 569 | 100.00 |
1871 | Jump Game VII | Medium | String, Two_Pointers, Prefix_Sum | 247 | 100.00 |
1870 | Minimum Speed to Arrive on Time | Medium | Array, Binary_Search, Binary_Search_II_Day_6 | 628 | 50.00 |
1869 | Longer Contiguous Segments of Ones than Zeros | Easy | String | 118 | 100.00 |
1866 | Number of Ways to Rearrange Sticks With K Sticks Visible | Hard | Dynamic_Programming, Math, Combinatorics | 188 | 100.00 |
1865 | Finding Pairs With a Certain Sum | Medium | Array, Hash_Table, Design | 1050 | 100.00 |
1864 | Minimum Number of Swaps to Make the Binary String Alternating | Medium | String, Greedy | 140 | 100.00 |
1863 | Sum of All Subset XOR Totals | Easy | Array, Math, Bit_Manipulation, Backtracking, Combinatorics | 128 | 80.00 |
1862 | Sum of Floored Pairs | Hard | Array, Math, Binary_Search, Prefix_Sum | 710 | 100.00 |
1861 | Rotating the Box | Medium | Array, Matrix, Two_Pointers | 882 | 60.00 |
1860 | Incremental Memory Leak | Medium | Simulation | 161 | 100.00 |
1859 | Sorting the Sentence | Easy | String, Sorting | 155 | 89.29 |
1857 | Largest Color Value in a Directed Graph | Hard | Hash_Table, Dynamic_Programming, Graph, Counting, Memoization, Topological_Sort | 1005 | 60.00 |
1856 | Maximum Subarray Min-Product | Medium | Array, Stack, Prefix_Sum, Monotonic_Stack | 517 | 66.67 |
1855 | Maximum Distance Between a Pair of Values | Medium | Array, Greedy, Binary_Search, Two_Pointers, Binary_Search_I_Day_11 | 458 | 100.00 |
1854 | Maximum Population Year | Easy | Array, Counting | 148 | 90.00 |
1851 | Minimum Interval to Include Each Query | Hard | Array, Sorting, Binary_Search, Heap_Priority_Queue, Line_Sweep | 1612 | 87.50 |
1850 | Minimum Adjacent Swaps to Reach the Kth Smallest Number | Medium | String, Greedy, Two_Pointers | 193 | 100.00 |
1849 | Splitting a String Into Descending Consecutive Values | Medium | String, Backtracking | 136 | 100.00 |
1848 | Minimum Distance to the Target Element | Easy | Array | 172 | 80.00 |
1847 | Closest Room | Hard | Array, Sorting, Binary_Search | 1179 | 100.00 |
1846 | Maximum Element After Decreasing and Rearranging | Medium | Array, Sorting, Greedy | 412 | 100.00 |
1845 | Seat Reservation Manager | Medium | Design, Heap_Priority_Queue, Programming_Skills_II_Day_17 | 834 | 100.00 |
1844 | Replace All Digits with Characters | Easy | String | 137 | 100.00 |
1840 | Maximum Building Height | Hard | Array, Math | 1210 | 100.00 |
1839 | Longest Substring Of All Vowels in Order | Medium | String, Sliding_Window | 290 | 80.00 |
1838 | Frequency of the Most Frequent Element | Medium | Array, Sorting, Greedy, Binary_Search, Prefix_Sum, Sliding_Window, Binary_Search_II_Day_9 | 564 | 88.89 |
1837 | Sum of Digits in Base K | Easy | Math | 120 | 100.00 |
1835 | Find XOR Sum of All Pairs Bitwise AND | Hard | Array, Math, Bit_Manipulation | 604 | 100.00 |
1834 | Single-Threaded CPU | Medium | Array, Sorting, Heap_Priority_Queue | 1050 | 100.00 |
1833 | Maximum Ice Cream Bars | Medium | Array, Sorting, Greedy | 439 | 100.00 |
1832 | Check if the Sentence Is Pangram | Easy | String, Hash_Table | 127 | 98.00 |
1830 | Minimum Number of Operations to Make String Sorted | Hard | String, Math, Combinatorics | 226 | 100.00 |
1829 | Maximum XOR for Each Query | Medium | Array, Bit_Manipulation, Prefix_Sum | 680 | 100.00 |
1828 | Queries on Number of Points Inside a Circle | Medium | Array, Math, Geometry | 284 | 100.00 |
1827 | Minimum Operations to Make the Array Increasing | Easy | Array, Greedy | 208 | 100.00 |
1825 | Finding MK Average | Hard | Design, Heap_Priority_Queue, Ordered_Set, Queue | 69 | 100.00 |
1824 | Minimum Sideway Jumps | Medium | Array, Dynamic_Programming, Greedy | 726 | 100.00 |
1823 | Find the Winner of the Circular Game | Medium | Array, Math, Simulation, Recursion, Queue, Data_Structure_II_Day_14_Stack_Queue | 119 | 87.50 |
1822 | Sign of the Product of an Array | Easy | Array, Math, Programming_Skills_I_Day_4_Loop | 170 | 92.51 |
1819 | Number of Different Subsequences GCDs | Hard | Array, Math, Counting, Number_Theory | 624 | 100.00 |
1818 | Minimum Absolute Sum Difference | Medium | Array, Sorting, Binary_Search, Ordered_Set, Binary_Search_II_Day_7 | 447 | 100.00 |
1817 | Finding the Users Active Minutes | Medium | Array, Hash_Table | 652 | 100.00 |
1816 | Truncate Sentence | Easy | Array, String | 147 | 94.74 |
1815 | Maximum Number of Groups Getting Fresh Donuts | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask, Memoization | 1073 | 100.00 |
1814 | Count Nice Pairs in an Array | Medium | Array, Hash_Table, Math, Counting | 520 | 100.00 |
1813 | Sentence Similarity III | Medium | Array, String, Two_Pointers | 162 | 100.00 |
1812 | Determine Color of a Chessboard Square | Easy | String, Math | 127 | 92.86 |
1808 | Maximize Number of Nice Divisors | Hard | Math, Recursion | 135 | 100.00 |
1807 | Evaluate the Bracket Pairs of a String | Medium | Array, String, Hash_Table | 689 | 100.00 |
1806 | Minimum Number of Operations to Reinitialize a Permutation | Medium | Array, Math, Simulation | 117 | 100.00 |
1805 | Number of Different Integers in a String | Easy | String, Hash_Table | 162 | 100.00 |
1803 | Count Pairs With XOR in a Range | Hard | Array, Bit_Manipulation, Trie | 427 | 100.00 |
1802 | Maximum Value at a Given Index in a Bounded Array | Medium | Greedy, Binary_Search, Binary_Search_II_Day_17 | 118 | 100.00 |
1801 | Number of Orders in the Backlog | Medium | Array, Heap_Priority_Queue, Simulation | 668 | 100.00 |
1800 | Maximum Ascending Subarray Sum | Easy | Array | 139 | 100.00 |
1799 | Maximize Score After N Operations | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Backtracking, Bitmask, Number_Theory | 347 | 73.17 |
1798 | Maximum Number of Consecutive Values You Can Make | Medium | Array, Greedy | 414 | 100.00 |
1797 | Design Authentication Manager | Medium | Hash_Table, Design, Programming_Skills_II_Day_19 | 334 | 100.00 |
1796 | Second Largest Digit in a String | Easy | String, Hash_Table | 148 | 100.00 |
1795 | Rearrange Products Table | Easy | Database, SQL_I_Day_4_Union_and_Select | 1027 | 67.57 |
1793 | Maximum Score of a Good Subarray | Hard | Array, Binary_Search, Two_Pointers, Stack, Monotonic_Stack | 568 | 100.00 |
1792 | Maximum Average Pass Ratio | Medium | Array, Greedy, Heap_Priority_Queue | 1111 | 75.00 |
1791 | Find Center of Star Graph | Easy | Graph | 476 | 91.67 |
1790 | Check if One String Swap Can Make Strings Equal | Easy | String, Hash_Table, Counting, Programming_Skills_I_Day_4_Loop | 138 | 100.00 |
1789 | Primary Department for Each Employee | Easy | Database | 1122 | 74.47 |
1787 | Make the XOR of All Segments Equal to Zero | Hard | Array, Dynamic_Programming, Bit_Manipulation | 374 | 100.00 |
1786 | Number of Restricted Paths From First to Last Node | Medium | Dynamic_Programming, Heap_Priority_Queue, Graph, Topological_Sort, Shortest_Path | 977 | 100.00 |
1785 | Minimum Elements to Add to Form a Given Sum | Medium | Array, Greedy | 595 | 100.00 |
1784 | Check if Binary String Has at Most One Segment of Ones | Easy | String | 135 | 85.71 |
1782 | Count Pairs Of Nodes | Hard | Binary_Search, Two_Pointers, Graph | 1441 | 100.00 |
1781 | Sum of Beauty of All Substrings | Medium | String, Hash_Table, Counting | 172 | 100.00 |
1780 | Check if Number is a Sum of Powers of Three | Medium | Math | 133 | 66.67 |
1779 | Find Nearest Point That Has the Same X or Y Coordinate | Easy | Array, Programming_Skills_I_Day_3_Conditional_Statements | 364 | 100.00 |
1776 | Car Fleet II | Hard | Array, Math, Stack, Heap_Priority_Queue, Monotonic_Stack | 2049 | 100.00 |
1775 | Equal Sum Arrays With Minimum Number of Operations | Medium | Array, Hash_Table, Greedy, Counting | 529 | 100.00 |
1774 | Closest Dessert Cost | Medium | Array, Dynamic_Programming, Backtracking | 147 | 100.00 |
1773 | Count Items Matching a Rule | Easy | Array, String | 227 | 97.50 |
1771 | Maximize Palindrome Length From Subsequences | Hard | String, Dynamic_Programming | 248 | 100.00 |
1770 | Maximum Score from Performing Multiplication Operations | Hard | Array, Dynamic_Programming | 436 | 91.67 |
1769 | Minimum Number of Operations to Move All Balls to Each Box | Medium | Array, String | 217 | 75.00 |
1768 | Merge Strings Alternately | Easy | String, Two_Pointers, LeetCode_75_Array/String, Programming_Skills_I_Day_8_String | 138 | 93.81 |
1766 | Tree of Coprimes | Hard | Math, Depth_First_Search, Breadth_First_Search, Tree | 991 | 100.00 |
1765 | Map of Highest Peak | Medium | Array, Breadth_First_Search, Matrix | 1087 | 100.00 |
1764 | Form Array by Concatenating Subarrays of Another Array | Medium | Array, Greedy, String_Matching | 206 | 100.00 |
1763 | Longest Nice Substring | Easy | String, Hash_Table, Bit_Manipulation, Sliding_Window | 158 | 91.67 |
1761 | Minimum Degree of a Connected Trio in a Graph | Hard | Graph | 590 | 50.00 |
1760 | Minimum Limit of Balls in a Bag | Medium | Array, Binary_Search, Binary_Search_II_Day_3 | 460 | 100.00 |
1759 | Count Number of Homogenous Substrings | Medium | String, Math | 230 | 100.00 |
1758 | Minimum Changes To Make Alternating Binary String | Easy | String | 153 | 100.00 |
1757 | Recyclable and Low Fat Products | Easy | Database, SQL_I_Day_1_Select | 1237 | 34.20 |
1755 | Closest Subsequence Sum | Hard | Array, Dynamic_Programming, Two_Pointers, Bit_Manipulation, Bitmask | 620 | 100.00 |
1754 | Largest Merge Of Two Strings | Medium | String, Greedy, Two_Pointers | 217 | 100.00 |
1753 | Maximum Score From Removing Stones | Medium | Math, Greedy, Heap_Priority_Queue | 141 | 100.00 |
1752 | Check if Array Is Sorted and Rotated | Easy | Array | 133 | 85.71 |
1751 | Maximum Number of Events That Can Be Attended II | Hard | Array, Dynamic_Programming, Binary_Search | 608 | 100.00 |
1750 | Minimum Length of String After Deleting Similar Ends | Medium | String, Two_Pointers | 215 | 100.00 |
1749 | Maximum Absolute Sum of Any Subarray | Medium | Array, Dynamic_Programming | 367 | 100.00 |
1748 | Sum of Unique Elements | Easy | Array, Hash_Table, Counting | 143 | 82.35 |
1745 | Palindrome Partitioning IV | Hard | String, Dynamic_Programming | 179 | 100.00 |
1744 | Can You Eat Your Favorite Candy on Your Favorite Day? | Medium | Array, Prefix_Sum | 809 | 100.00 |
1743 | Restore the Array From Adjacent Pairs | Medium | Array, Hash_Table | 1018 | 100.00 |
1742 | Maximum Number of Balls in a Box | Easy | Hash_Table, Math, Counting | 125 | 100.00 |
1741 | Find Total Time Spent by Each Employee | Easy | Database, SQL_I_Day_8_Function | 1101 | 51.40 |
1739 | Building Boxes | Hard | Math, Greedy, Binary_Search | 133 | 100.00 |
1738 | Find Kth Largest XOR Coordinate Value | Medium | Array, Matrix, Bit_Manipulation, Heap_Priority_Queue, Prefix_Sum, Divide_and_Conquer, Quickselect | 936 | 100.00 |
1737 | Change Minimum Characters to Satisfy One of Three Conditions | Medium | String, Hash_Table, Prefix_Sum, Counting | 240 | 100.00 |
1736 | Latest Time by Replacing Hidden Digits | Easy | String, Greedy | 161 | 100.00 |
1735 | Count Ways to Make Array With Product | Hard | Array, Dynamic_Programming, Math | 394 | 100.00 |
1734 | Decode XORed Permutation | Medium | Array, Bit_Manipulation | 684 | 100.00 |
1733 | Minimum Number of People to Teach | Medium | Array, Greedy | 580 | 100.00 |
1732 | Find the Highest Altitude | Easy | Array, Prefix_Sum, LeetCode_75_Prefix_Sum | 139 | 90.70 |
1731 | The Number of Employees Which Report to Each Employee | Easy | Database | 1385 | 39.02 |
1729 | Find Followers Count | Easy | Database, SQL_I_Day_7_Function | 1228 | 38.04 |
1728 | Cat and Mouse II | Hard | Array, Dynamic_Programming, Math, Matrix, Graph, Memoization, Topological_Sort, Game_Theory | 193 | 100.00 |
1727 | Largest Submatrix With Rearrangements | Medium | Array, Sorting, Greedy, Matrix | 650 | 100.00 |
1726 | Tuple with Same Product | Medium | Array, Hash_Table | 762 | 100.00 |
1725 | Number Of Rectangles That Can Form The Largest Square | Easy | Array | 244 | 100.00 |
1723 | Find Minimum Time to Finish All Jobs | Hard | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 167 | 100.00 |
1722 | Minimize Hamming Distance After Swap Operations | Medium | Array, Depth_First_Search, Union_Find | 843 | 100.00 |
1721 | Swapping Nodes in a Linked List | Medium | Two_Pointers, Linked_List | 726 | 91.30 |
1720 | Decode XORed Array | Easy | Array, Bit_Manipulation | 304 | 95.00 |
1719 | Number Of Ways To Reconstruct A Tree | Hard | Tree, Graph, Topological_Sort | 1015 | 100.00 |
1718 | Construct the Lexicographically Largest Valid Sequence | Medium | Array, Backtracking | 140 | 100.00 |
1717 | Maximum Score From Removing Substrings | Medium | String, Greedy, Stack | 265 | 100.00 |
1716 | Calculate Money in Leetcode Bank | Easy | Math | 119 | 66.67 |
1713 | Minimum Operations to Make a Subsequence | Hard | Array, Hash_Table, Greedy, Binary_Search | 862 | 100.00 |
1712 | Ways to Split Array Into Three Subarrays | Medium | Array, Binary_Search, Two_Pointers, Prefix_Sum, Binary_Search_II_Day_10 | 486 | 100.00 |
1711 | Count Good Meals | Medium | Array, Hash_Table | 549 | 100.00 |
1710 | Maximum Units on a Truck | Easy | Array, Sorting, Greedy | 228 | 100.00 |
1707 | Maximum XOR With an Element From Array | Hard | Array, Bit_Manipulation, Trie | 1295 | 100.00 |
1706 | Where Will the Ball Fall | Medium | Array, Dynamic_Programming, Depth_First_Search, Matrix, Simulation, Level_2_Day_1_Implementation/Simulation | 270 | 67.86 |
1705 | Maximum Number of Eaten Apples | Medium | Array, Greedy, Heap_Priority_Queue | 428 | 100.00 |
1704 | Determine if String Halves Are Alike | Easy | String, Counting | 162 | 83.33 |
1703 | Minimum Adjacent Swaps for K Consecutive Ones | Hard | Array, Greedy, Prefix_Sum, Sliding_Window | 518 | 100.00 |
1702 | Maximum Binary String After Change | Medium | String, Greedy | 343 | 100.00 |
1701 | Average Waiting Time | Medium | Array, Simulation | 654 | 100.00 |
1700 | Number of Students Unable to Eat Lunch | Easy | Array, Stack, Simulation, Queue | 143 | 100.00 |
1697 | Checking Existence of Edge Length Limited Paths | Hard | Array, Sorting, Graph, Union_Find | 1411 | 72.90 |
1696 | Jump Game VI | Medium | Array, Dynamic_Programming, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue | 497 | 100.00 |
1695 | Maximum Erasure Value | Medium | Array, Hash_Table, Sliding_Window | 478 | 100.00 |
1694 | Reformat Phone Number | Easy | String | 142 | 100.00 |
1693 | Daily Leads and Partners | Easy | Database, SQL_I_Day_7_Function | 1115 | 52.84 |
1691 | Maximum Height by Stacking Cuboids | Hard | Array, Dynamic_Programming, Sorting | 187 | 100.00 |
1690 | Stone Game VII | Medium | Array, Dynamic_Programming, Math, Game_Theory | 196 | 100.00 |
1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | String, Greedy | 226 | 84.44 |
1688 | Count of Matches in Tournament | Easy | Math, Simulation | 124 | 83.33 |
1687 | Delivering Boxes from Storage to Ports | Hard | Array, Dynamic_Programming, Heap_Priority_Queue, Queue, Segment_Tree, Monotonic_Queue | 778 | 100.00 |
1686 | Stone Game VI | Medium | Array, Math, Sorting, Greedy, Heap_Priority_Queue, Game_Theory | 702 | 100.00 |
1685 | Sum of Absolute Differences in a Sorted Array | Medium | Array, Math, Prefix_Sum | 612 | 100.00 |
1684 | Count the Number of Consistent Strings | Easy | Array, String, Hash_Table, Bit_Manipulation | 234 | 100.00 |
1683 | Invalid Tweets | Easy | Database | 1263 | 53.93 |
1681 | Minimum Incompatibility | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 162 | 100.00 |
1680 | Concatenation of Consecutive Binary Numbers | Medium | Math, Bit_Manipulation, Simulation | 175 | 100.00 |
1679 | Max Number of K-Sum Pairs | Medium | Array, Hash_Table, Sorting, Two_Pointers, LeetCode_75_Two_Pointers | 468 | 92.86 |
1678 | Goal Parser Interpretation | Easy | String, Programming_Skills_I_Day_8_String | 136 | 88.24 |
1675 | Minimize Deviation in Array | Hard | Array, Greedy, Heap_Priority_Queue, Ordered_Set | 769 | 100.00 |
1674 | Minimum Moves to Make Array Complementary | Medium | Array, Hash_Table, Prefix_Sum | 522 | 100.00 |
1673 | Find the Most Competitive Subsequence | Medium | Array, Greedy, Stack, Monotonic_Stack | 741 | 100.00 |
1672 | Richest Customer Wealth | Easy | Array, Matrix, Programming_Skills_I_Day_6_Array | 155 | 94.54 |
1671 | Minimum Number of Removals to Make Mountain Array | Hard | Array, Dynamic_Programming, Greedy, Binary_Search | 264 | 100.00 |
1670 | Design Front Middle Back Queue | Medium | Array, Design, Linked_List, Queue, Data_Stream | 267 | 100.00 |
1669 | Merge In Between Linked Lists | Medium | Linked_List | 531 | 66.67 |
1668 | Maximum Repeating Substring | Easy | String, String_Matching | 170 | 100.00 |
1667 | Fix Names in a Table | Easy | Database, SQL_I_Day_3_String_Processing_Functions | 1196 | 61.40 |
1665 | Minimum Initial Energy to Finish Tasks | Hard | Array, Sorting, Greedy | 823 | 100.00 |
1664 | Ways to Make a Fair Array | Medium | Array, Dynamic_Programming | 475 | 100.00 |
1663 | Smallest String With A Given Numeric Value | Medium | String, Greedy | 202 | 100.00 |
1662 | Check If Two String Arrays are Equivalent | Easy | Array, String | 144 | 86.84 |
1661 | Average Time of Process per Machine | Easy | Database | 429 | 71.35 |
1659 | Maximize Grid Happiness | Hard | Dynamic_Programming, Bit_Manipulation, Bitmask, Memoization | 44 | 100.00 |
1658 | Minimum Operations to Reduce X to Zero | Medium | Array, Hash_Table, Binary_Search, Prefix_Sum, Sliding_Window | 532 | 50.00 |
1657 | Determine if Two Strings Are Close | Medium | String, Hash_Table, Sorting, LeetCode_75_Hash_Map/Set | 287 | 100.00 |
1656 | Design an Ordered Stream | Easy | Array, Hash_Table, Design, Data_Stream | 487 | 91.67 |
1655 | Distribute Repeating Integers | Hard | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 445 | 100.00 |
1654 | Minimum Jumps to Reach Home | Medium | Array, Dynamic_Programming, Breadth_First_Search, Graph_Theory_I_Day_11_Breadth_First_Search | 192 | 100.00 |
1653 | Minimum Deletions to Make String Balanced | Medium | String, Dynamic_Programming, Stack | 291 | 100.00 |
1652 | Defuse the Bomb | Easy | Array | 160 | 100.00 |
1649 | Create Sorted Array through Instructions | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 571 | 100.00 |
1648 | Sell Diminishing-Valued Colored Balls | Medium | Array, Math, Sorting, Greedy, Binary_Search, Heap_Priority_Queue, Binary_Search_II_Day_19 | 509 | 100.00 |
1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | String, Sorting, Greedy | 252 | 100.00 |
1646 | Get Maximum in Generated Array | Easy | Array, Dynamic_Programming, Simulation | 142 | 100.00 |
1643 | Kth Smallest Instructions | Hard | Array, Dynamic_Programming, Math, Combinatorics | 171 | 100.00 |
1642 | Furthest Building You Can Reach | Medium | Array, Greedy, Heap_Priority_Queue | 457 | 71.43 |
1641 | Count Sorted Vowel Strings | Medium | Dynamic_Programming | 141 | 42.86 |
1640 | Check Array Formation Through Concatenation | Easy | Array, Hash_Table | 154 | 100.00 |
1639 | Number of Ways to Form a Target String Given a Dictionary | Hard | Array, String, Dynamic_Programming | 408 | 100.00 |
1638 | Count Substrings That Differ by One Character | Medium | String, Hash_Table, Dynamic_Programming | 143 | 100.00 |
1637 | Widest Vertical Area Between Two Points Containing No Points | Easy | Array, Sorting | 616 | 100.00 |
1636 | Sort Array by Increasing Frequency | Easy | Array, Hash_Table, Sorting | 222 | 95.65 |
1633 | Percentage of Users Attended a Contest | Easy | Database | 1556 | 93.74 |
1632 | Rank Transform of a Matrix | Hard | Array, Greedy, Matrix, Graph, Union_Find, Topological_Sort | 807 | 100.00 |
1631 | Path With Minimum Effort | Medium | Array, Depth_First_Search, Breadth_First_Search, Binary_Search, Matrix, Heap_Priority_Queue, Union_Find | 384 | 100.00 |
1630 | Arithmetic Subarrays | Medium | Array, Sorting, Programming_Skills_II_Day_9 | 264 | 100.00 |
1629 | Slowest Key | Easy | Array, String | 200 | 75.00 |
1627 | Graph Connectivity With Threshold | Hard | Array, Math, Union_Find | 703 | 100.00 |
1626 | Best Team With No Conflicts | Medium | Array, Dynamic_Programming, Sorting | 370 | 100.00 |
1625 | Lexicographically Smallest String After Applying Operations | Medium | String, Breadth_First_Search | 415 | 100.00 |
1624 | Largest Substring Between Two Equal Characters | Easy | String, Hash_Table | 132 | 100.00 |
1622 | Fancy Sequence | Hard | Math, Design, Segment_Tree | 1050 | 100.00 |
1621 | Number of Sets of K Non-Overlapping Line Segments | Medium | Dynamic_Programming, Math | 147 | 100.00 |
1620 | Coordinate With Maximum Network Quality | Medium | Array, Enumeration | 233 | 100.00 |
1619 | Mean of Array After Removing Some Elements | Easy | Array, Sorting | 178 | 100.00 |
1617 | Count Subtrees With Max Distance Between Cities | Hard | Dynamic_Programming, Tree, Bit_Manipulation, Bitmask, Enumeration | 297 | 100.00 |
1616 | Split Two Strings to Make Palindrome | Medium | String, Greedy, Two_Pointers | 277 | 100.00 |
1615 | Maximal Network Rank | Medium | Graph, Graph_Theory_I_Day_14_Graph_Theory | 282 | 100.00 |
1614 | Maximum Nesting Depth of the Parentheses | Easy | String, Stack | 130 | 81.25 |
1611 | Minimum One Bit Operations to Make Integers Zero | Hard | Dynamic_Programming, Bit_Manipulation, Memoization | 127 | 100.00 |
1610 | Maximum Number of Visible Points | Hard | Array, Math, Sorting, Sliding_Window, Geometry | 1343 | 100.00 |
1609 | Even Odd Tree | Medium | Breadth_First_Search, Tree, Binary_Tree | 497 | 100.00 |
1608 | Special Array With X Elements Greater Than or Equal X | Easy | Array, Sorting, Binary_Search, Binary_Search_I_Day_7 | 147 | 81.82 |
1606 | Find Servers That Handled Most Number of Requests | Hard | Array, Greedy, Heap_Priority_Queue, Ordered_Set | 973 | 33.33 |
1605 | Find Valid Matrix Given Row and Column Sums | Medium | Array, Greedy, Matrix | 574 | 100.00 |
1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | Array, String, Hash_Table, Sorting | 704 | 83.33 |
1603 | Design Parking System | Easy | Design, Simulation, Counting, Programming_Skills_I_Day_12_Class_and_Object | 376 | 31.83 |
1601 | Maximum Number of Achievable Transfer Requests | Hard | Array, Bit_Manipulation, Backtracking, Enumeration | 206 | 100.00 |
1600 | Throne Inheritance | Medium | Hash_Table, Depth_First_Search, Tree, Design | 1847 | 100.00 |
1599 | Maximum Profit of Operating a Centennial Wheel | Medium | Array, Simulation | 593 | 100.00 |
1598 | Crawler Log Folder | Easy | Array, String, Stack | 150 | 92.31 |
1595 | Minimum Cost to Connect Two Groups of Points | Hard | Array, Dynamic_Programming, Matrix, Bit_Manipulation, Bitmask | 278 | 100.00 |
1594 | Maximum Non Negative Product in a Matrix | Medium | Array, Dynamic_Programming, Matrix | 224 | 100.00 |
1593 | Split a String Into the Max Number of Unique Substrings | Medium | String, Hash_Table, Backtracking | 161 | 100.00 |
1592 | Rearrange Spaces Between Words | Easy | String | 182 | 75.00 |
1591 | Strange Printer II | Hard | Array, Matrix, Graph, Topological_Sort | 321 | 100.00 |
1590 | Make Sum Divisible by P | Medium | Array, Hash_Table, Prefix_Sum | 464 | 100.00 |
1589 | Maximum Sum Obtained of Any Permutation | Medium | Array, Sorting, Greedy, Prefix_Sum | 867 | 66.67 |
1588 | Sum of All Odd Length Subarrays | Easy | Array, Math, Prefix_Sum, Programming_Skills_I_Day_6_Array | 157 | 64.00 |
1587 | Bank Account Summary II | Easy | Database, SQL_I_Day_10_Where | 1582 | 52.96 |
1585 | Check If String Is Transformable With Substring Sort Operations | Hard | String, Sorting, Greedy | 271 | 100.00 |
1584 | Min Cost to Connect All Points | Medium | Array, Union_Find, Minimum_Spanning_Tree | 331 | 95.12 |
1583 | Count Unhappy Friends | Medium | Array, Simulation | 324 | 100.00 |
1582 | Special Positions in a Binary Matrix | Easy | Array, Matrix | 212 | 60.00 |
1581 | Customer Who Visited but Did Not Make Any Transactions | Easy | Database, SQL_I_Day_5_Union | 2771 | 54.68 |
1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | Graph, Union_Find | 942 | 32.52 |
1578 | Minimum Time to Make Rope Colorful | Medium | Array, String, Dynamic_Programming, Greedy | 577 | 100.00 |
1577 | Number of Ways Where Square of Number Is Equal to Product of Two Numbers | Medium | Array, Hash_Table, Math, Two_Pointers | 209 | 100.00 |
1576 | Replace All ?’s to Avoid Consecutive Repeating Characters | Easy | String | 180 | 37.50 |
1575 | Count All Possible Routes | Hard | Array, Dynamic_Programming, Memoization | 246 | 100.00 |
1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium | Array, Binary_Search, Two_Pointers, Stack, Monotonic_Stack, Binary_Search_II_Day_14 | 477 | 50.00 |
1573 | Number of Ways to Split a String | Medium | String, Math | 247 | 100.00 |
1572 | Matrix Diagonal Sum | Easy | Array, Matrix, Programming_Skills_I_Day_7_Array, Udemy_2D_Arrays/Matrix | 221 | 67.61 |
1569 | Number of Ways to Reorder Array to Get Same BST | Hard | Array, Dynamic_Programming, Math, Tree, Binary_Tree, Union_Find, Binary_Search_Tree, Divide_and_Conquer, Memoization, Combinatorics | 256 | 100.00 |
1568 | Minimum Number of Days to Disconnect Island | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Strongly_Connected_Component | 210 | 100.00 |
1567 | Maximum Length of Subarray With Positive Product | Medium | Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_6 | 468 | 33.33 |
1566 | Detect Pattern of Length M Repeated K or More Times | Easy | Array, Enumeration | 168 | 33.33 |
1563 | Stone Game V | Hard | Array, Dynamic_Programming, Math, Game_Theory | 371 | 100.00 |
1562 | Find Latest Group of Size M | Medium | Array, Binary_Search, Simulation, Binary_Search_II_Day_19 | 534 | 100.00 |
1561 | Maximum Number of Coins You Can Get | Medium | Array, Math, Sorting, Greedy, Game_Theory | 515 | 50.00 |
1560 | Most Visited Sector in a Circular Track | Easy | Array, Simulation | 230 | 100.00 |
1559 | Detect Cycles in 2D Grid | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 871 | 33.33 |
1558 | Minimum Numbers of Function Calls to Make Target Array | Medium | Array, Greedy | 347 | 50.00 |
1557 | Minimum Number of Vertices to Reach All Nodes | Medium | Graph, Data_Structure_II_Day_19_Graph, Graph_Theory_I_Day_13_Graph_Theory | 792 | 99.29 |
1556 | Thousand Separator | Easy | String | 131 | 100.00 |
1553 | Minimum Number of Days to Eat N Oranges | Hard | Dynamic_Programming, Memoization | 153 | 100.00 |
1552 | Magnetic Force Between Two Balls | Medium | Array, Sorting, Binary_Search, Binary_Search_II_Day_4 | 636 | 100.00 |
1551 | Minimum Operations to Make Array Equal | Medium | Math | 119 | 100.00 |
1550 | Three Consecutive Odds | Easy | Array | 154 | 90.00 |
1547 | Minimum Cost to Cut a Stick | Hard | Array, Dynamic_Programming | 187 | 92.00 |
1546 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | Medium | Array, Hash_Table, Greedy, Prefix_Sum | 560 | 100.00 |
1545 | Find Kth Bit in Nth Binary String | Medium | String, Recursion | 141 | 100.00 |
1544 | Make The String Great | Easy | String, Stack | 164 | 92.16 |
1542 | Find Longest Awesome Substring | Hard | String, Hash_Table, Bit_Manipulation | 239 | 100.00 |
1541 | Minimum Insertions to Balance a Parentheses String | Medium | String, Greedy, Stack | 240 | 80.00 |
1540 | Can Convert String in K Moves | Medium | String, Hash_Table | 272 | 75.00 |
1539 | Kth Missing Positive Number | Easy | Array, Binary_Search, Binary_Search_I_Day_6 | 153 | 100.00 |
1537 | Get the Maximum Score | Hard | Array, Dynamic_Programming, Greedy, Two_Pointers | 453 | 100.00 |
1536 | Minimum Swaps to Arrange a Binary Grid | Medium | Array, Greedy, Matrix | 336 | 100.00 |
1535 | Find the Winner of an Array Game | Medium | Array, Simulation | 460 | 100.00 |
1534 | Count Good Triplets | Easy | Array, Enumeration | 175 | 66.67 |
1531 | String Compression II | Hard | String, Dynamic_Programming | 207 | 100.00 |
1530 | Number of Good Leaf Nodes Pairs | Medium | Depth_First_Search, Tree, Binary_Tree | 242 | 100.00 |
1529 | Minimum Suffix Flips | Medium | String, Greedy | 200 | 100.00 |
1528 | Shuffle String | Easy | Array, String | 180 | 89.23 |
1527 | Patients With a Condition | Easy | Database, SQL_I_Day_3_String_Processing_Functions | 708 | 48.23 |
1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard | Array, Dynamic_Programming, Greedy, Stack, Monotonic_Stack | 466 | 100.00 |
1525 | Number of Good Ways to Split a String | Medium | String, Dynamic_Programming, Bit_Manipulation | 238 | 100.00 |
1524 | Number of Sub-arrays With Odd Sum | Medium | Array, Dynamic_Programming, Math, Prefix_Sum | 584 | 100.00 |
1523 | Count Odd Numbers in an Interval Range | Easy | Math, Programming_Skills_I_Day_1_Basic_Data_Type | 114 | 97.22 |
1521 | Find a Value of a Mysterious Function Closest to Target | Hard | Array, Binary_Search, Bit_Manipulation, Segment_Tree | 446 | 100.00 |
1520 | Maximum Number of Non-Overlapping Substrings | Hard | String, Greedy | 333 | 100.00 |
1519 | Number of Nodes in the Sub-Tree With the Same Label | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Counting | 1130 | 87.50 |
1518 | Water Bottles | Easy | Math, Simulation | 116 | 100.00 |
1517 | Find Users With Valid E-Mails | Easy | Database | 1278 | 77.30 |
1515 | Best Position for a Service Centre | Hard | Math, Geometry, Randomized | 183 | 100.00 |
1514 | Path with Maximum Probability | Medium | Heap_Priority_Queue, Graph, Shortest_Path | 681 | 100.00 |
1513 | Number of Substrings With Only 1s | Medium | String, Math | 171 | 100.00 |
1512 | Number of Good Pairs | Easy | Array, Hash_Table, Math, Counting | 138 | 70.65 |
1510 | Stone Game IV | Hard | Dynamic_Programming, Math, Game_Theory | 137 | 100.00 |
1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | Medium | Array, Sorting, Greedy | 415 | 100.00 |
1508 | Range Sum of Sorted Subarray Sums | Medium | Array, Sorting, Binary_Search, Two_Pointers, Binary_Search_II_Day_14 | 378 | 66.67 |
1507 | Reformat Date | Easy | String | 147 | 100.00 |
1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Hard | String, Greedy, Segment_Tree, Binary_Indexed_Tree | 226 | 100.00 |
1504 | Count Submatrices With All Ones | Medium | Array, Dynamic_Programming, Matrix, Stack, Monotonic_Stack | 265 | 80.00 |
1503 | Last Moment Before All Ants Fall Out of a Plank | Medium | Array, Simulation, Brainteaser | 253 | 100.00 |
1502 | Can Make Arithmetic Progression From Sequence | Easy | Array, Sorting, Programming_Skills_I_Day_4_Loop | 156 | 94.82 |
1499 | Max Value of Equation | Hard | Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue | 708 | 100.00 |
1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | Array, Sorting, Binary_Search, Two_Pointers, Binary_Search_II_Day_15 | 487 | 97.89 |
1497 | Check If Array Pairs Are Divisible by k | Medium | Array, Hash_Table, Counting | 575 | 83.33 |
1496 | Path Crossing | Easy | String, Hash_Table | 120 | 100.00 |
1494 | Parallel Courses II | Hard | Dynamic_Programming, Bit_Manipulation, Graph, Bitmask | 381 | 100.00 |
1493 | Longest Subarray of 1’s After Deleting One Element | Medium | Dynamic_Programming, Math, Sliding_Window, LeetCode_75_Sliding_Window | 288 | 73.85 |
1492 | The kth Factor of n | Medium | Math | 133 | 65.12 |
1491 | Average Salary Excluding the Minimum and Maximum Salary | Easy | Array, Sorting, Programming_Skills_I_Day_1_Basic_Data_Type | 137 | 91.67 |
1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | Sorting, Graph, Union_Find, Minimum_Spanning_Tree, Strongly_Connected_Component | 342 | 100.00 |
1488 | Avoid Flood in The City | Medium | Array, Hash_Table, Greedy, Binary_Search, Heap_Priority_Queue, Binary_Search_II_Day_18 | 823 | 66.67 |
1487 | Making File Names Unique | Medium | Array, String, Hash_Table | 553 | 50.00 |
1486 | XOR Operation in an Array | Easy | Math, Bit_Manipulation | 123 | 81.25 |
1484 | Group Sold Products By The Date | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_3_String_Processing_Functions | 899 | 40.76 |
1483 | Kth Ancestor of a Tree Node | Hard | Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Tree, Binary_Search, Design | 956 | 100.00 |
1482 | Minimum Number of Days to Make m Bouquets | Medium | Array, Binary_Search, Binary_Search_II_Day_7 | 538 | 50.00 |
1481 | Least Number of Unique Integers after K Removals | Medium | Array, Hash_Table, Sorting, Greedy, Counting | 564 | 76.19 |
1480 | Running Sum of 1d Array | Easy | Array, Prefix_Sum, Level_1_Day_1_Prefix_Sum | 161 | 84.80 |
1478 | Allocate Mailboxes | Hard | Array, Dynamic_Programming, Math, Sorting | 226 | 100.00 |
1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | Medium | Array, Hash_Table, Dynamic_Programming, Binary_Search, Sliding_Window | 746 | 100.00 |
1476 | Subrectangle Queries | Medium | Array, Matrix, Design | 332 | 81.82 |
1475 | Final Prices With a Special Discount in a Shop | Easy | Array, Stack, Monotonic_Stack | 182 | 94.12 |
1473 | Paint House III | Hard | Array, Dynamic_Programming | 235 | 100.00 |
1472 | Design Browser History | Medium | Array, Stack, Design, Linked_List, Data_Stream, Doubly_Linked_List | 576 | 42.42 |
1471 | The k Strongest Values in an Array | Medium | Array, Sorting, Two_Pointers | 780 | 100.00 |
1470 | Shuffle the Array | Easy | Array | 220 | 41.96 |
1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | Hard | Dynamic_Programming, Math, Backtracking, Combinatorics, Probability_and_Statistics | 150 | 100.00 |
1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS, Graph_Theory_I_Day_10_Standard_Traversal | 718 | 100.00 |
1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | Array, Sorting, Greedy | 418 | 50.00 |
1464 | Maximum Product of Two Elements in an Array | Easy | Array, Sorting, Heap_Priority_Queue | 190 | 64.71 |
1463 | Cherry Pickup II | Hard | Array, Dynamic_Programming, Matrix | 198 | 100.00 |
1462 | Course Schedule IV | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 512 | 100.00 |
1461 | Check If a String Contains All Binary Codes of Size K | Medium | String, Hash_Table, Bit_Manipulation, Hash_Function, Rolling_Hash | 482 | 100.00 |
1460 | Make Two Arrays Equal by Reversing Sub-arrays | Easy | Array, Hash_Table, Sorting | 231 | 66.67 |
1458 | Max Dot Product of Two Subsequences | Hard | Array, Dynamic_Programming | 215 | 100.00 |
1457 | Pseudo-Palindromic Paths in a Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Bit_Manipulation | 583 | 50.00 |
1456 | Maximum Number of Vowels in a Substring of Given Length | Medium | String, Sliding_Window, LeetCode_75_Sliding_Window | 215 | 97.25 |
1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | Easy | String, String_Matching | 155 | 42.86 |
1453 | Maximum Number of Darts Inside of a Circular Dartboard | Hard | Array, Math, Geometry | 211 | 100.00 |
1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | Medium | Array, String, Hash_Table | 600 | 100.00 |
1451 | Rearrange Words in a Sentence | Medium | String, Sorting | 263 | 100.00 |
1450 | Number of Students Doing Homework at a Given Time | Easy | Array | 144 | 88.89 |
1449 | Form Largest Integer With Digits That Add up to Target | Hard | Array, Dynamic_Programming | 201 | 100.00 |
1448 | Count Good Nodes in Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS | 384 | 68.52 |
1447 | Simplified Fractions | Medium | String, Math, Number_Theory | 338 | 100.00 |
1446 | Consecutive Characters | Easy | String | 141 | 100.00 |
1444 | Number of Ways of Cutting a Pizza | Hard | Array, Dynamic_Programming, Matrix, Memoization | 175 | 75.00 |
1443 | Minimum Time to Collect All Apples in a Tree | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree | 793 | 85.71 |
1442 | Count Triplets That Can Form Two Arrays of Equal XOR | Medium | Array, Hash_Table, Math, Bit_Manipulation, Prefix_Sum | 145 | 100.00 |
1441 | Build an Array With Stack Operations | Medium | Array, Stack, Simulation | 160 | 100.00 |
1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | Array, Binary_Search, Matrix, Heap_Priority_Queue | 225 | 100.00 |
1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | Array, Heap_Priority_Queue, Sliding_Window, Ordered_Set, Queue, Monotonic_Queue | 479 | 75.00 |
1437 | Check If All 1’s Are at Least Length K Places Away | Easy | Array | 345 | 66.67 |
1436 | Destination City | Easy | String, Hash_Table | 174 | 77.78 |
1434 | Number of Ways to Wear Different Hats to Each Other | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 206 | 100.00 |
1433 | Check If a String Can Break Another String | Medium | String, Sorting, Greedy | 221 | 100.00 |
1432 | Max Difference You Can Get From Changing an Integer | Medium | Math, Greedy | 147 | 100.00 |
1431 | Kids With the Greatest Number of Candies | Easy | Array, LeetCode_75_Array/String | 152 | 99.61 |
1425 | Constrained Subsequence Sum | Hard | Array, Dynamic_Programming, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue | 649 | 33.33 |
1424 | Diagonal Traverse II | Medium | Array, Sorting, Heap_Priority_Queue | 706 | 100.00 |
1423 | Maximum Points You Can Obtain from Cards | Medium | Array, Prefix_Sum, Sliding_Window | 349 | 78.57 |
1422 | Maximum Score After Splitting a String | Easy | String | 145 | 100.00 |
1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | Hard | Dynamic_Programming | 153 | 100.00 |
1419 | Minimum Number of Frogs Croaking | Medium | String, Counting | 210 | 90.91 |
1418 | Display Table of Food Orders in a Restaurant | Medium | Array, String, Hash_Table, Sorting, Ordered_Set | 710 | 100.00 |
1417 | Reformat The String | Easy | String | 174 | 100.00 |
1416 | Restore The Array | Hard | String, Dynamic_Programming | 279 | 51.85 |
1415 | The k-th Lexicographical String of All Happy Strings of Length n | Medium | String, Backtracking | 160 | 100.00 |
1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | Medium | Greedy | 165 | 100.00 |
1413 | Minimum Value to Get Positive Step by Step Sum | Easy | Array, Prefix_Sum | 127 | 97.22 |
1411 | Number of Ways to Paint N × 3 Grid | Hard | Dynamic_Programming | 201 | 100.00 |
1410 | HTML Entity Parser | Medium | String, Hash_Table | 334 | 100.00 |
1409 | Queries on a Permutation With Key | Medium | Array, Simulation, Binary_Indexed_Tree | 209 | 100.00 |
1408 | String Matching in an Array | Easy | String, String_Matching | 194 | 77.78 |
1407 | Top Travellers | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_9_Control_of_Flow | 1394 | 98.43 |
1406 | Stone Game III | Hard | Array, Dynamic_Programming, Math, Game_Theory | 699 | 90.70 |
1405 | Longest Happy String | Medium | String, Greedy, Heap_Priority_Queue | 119 | 100.00 |
1404 | Number of Steps to Reduce a Number in Binary Representation to One | Medium | String, Bit_Manipulation | 144 | 100.00 |
1403 | Minimum Subsequence in Non-Increasing Order | Easy | Array, Sorting, Greedy | 190 | 100.00 |
1402 | Reducing Dishes | Hard | Array, Dynamic_Programming, Sorting, Greedy | 151 | 100.00 |
1401 | Circle and Rectangle Overlapping | Medium | Math, Geometry | 116 | 100.00 |
1400 | Construct K Palindrome Strings | Medium | String, Hash_Table, Greedy, Counting | 204 | 90.00 |
1399 | Count Largest Group | Easy | Hash_Table, Math | 136 | 100.00 |
1397 | Find All Good Strings | Hard | String, Dynamic_Programming, String_Matching | 273 | 100.00 |
1396 | Design Underground System | Medium | String, Hash_Table, Design | 703 | 99.29 |
1395 | Count Number of Teams | Medium | Array, Dynamic_Programming, Binary_Indexed_Tree | 192 | 100.00 |
1394 | Find Lucky Integer in an Array | Easy | Array, Hash_Table, Counting | 161 | 100.00 |
1393 | Capital Gain/Loss | Medium | LeetCode_Curated_SQL_70, Database, SQL_I_Day_9_Control_of_Flow | 990 | 47.36 |
1392 | Longest Happy Prefix | Hard | String, Hash_Function, String_Matching, Rolling_Hash | 7 | 100.00 |
1391 | Check if There is a Valid Path in a Grid | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 636 | 100.00 |
1390 | Four Divisors | Medium | Array, Math | 255 | 100.00 |
1389 | Create Target Array in the Given Order | Easy | Array, Simulation | 155 | 91.67 |
1388 | Pizza With 3n Slices | Hard | Array, Dynamic_Programming, Greedy, Heap_Priority_Queue | 170 | 100.00 |
1387 | Sort Integers by The Power Value | Medium | Dynamic_Programming, Sorting, Memoization | 370 | 100.00 |
1386 | Cinema Seat Allocation | Medium | Array, Hash_Table, Greedy, Bit_Manipulation | 397 | 100.00 |
1385 | Find the Distance Value Between Two Arrays | Easy | Array, Sorting, Binary_Search, Two_Pointers, Binary_Search_I_Day_3 | 190 | 84.62 |
1383 | Maximum Performance of a Team | Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 427 | 100.00 |
1382 | Balance a Binary Search Tree | Medium | Depth_First_Search, Greedy, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 369 | 85.71 |
1381 | Design a Stack With Increment Operation | Medium | Array, Stack, Design | 267 | 100.00 |
1380 | Lucky Numbers in a Matrix | Easy | Array, Matrix | 223 | 89.29 |
1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 100.00 |
1378 | Replace Employee ID With The Unique Identifier | Easy | Database | 2452 | 54.86 |
1377 | Frog Position After T Seconds | Hard | Depth_First_Search, Breadth_First_Search, Tree, Graph | 221 | 100.00 |
1376 | Time Needed to Inform All Employees | Medium | Depth_First_Search, Breadth_First_Search, Tree, Programming_Skills_II_Day_11, Graph_Theory_I_Day_9_Standard_Traversal | 915 | 37.62 |
1375 | Number of Times Binary String Is Prefix-Aligned | Medium | Array | 327 | 100.00 |
1374 | Generate a String With Characters That Have Odd Counts | Easy | String | 130 | 100.00 |
1373 | Maximum Sum BST in Binary Tree | Hard | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 451 | 100.00 |
1372 | Longest ZigZag Path in a Binary Tree | Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS | 381 | 66.11 |
1371 | Find the Longest Substring Containing Vowels in Even Counts | Medium | String, Hash_Table, Bit_Manipulation, Prefix_Sum | 317 | 100.00 |
1370 | Increasing Decreasing String | Easy | String, Hash_Table, Counting | 189 | 33.33 |
1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue, Graph, Shortest_Path | 220 | 100.00 |
1367 | Linked List in Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Programming_Skills_II_Day_4 | 237 | 92.86 |
1366 | Rank Teams by Votes | Medium | Array, String, Hash_Table, Sorting, Counting | 179 | 100.00 |
1365 | How Many Numbers Are Smaller Than the Current Number | Easy | Array, Hash_Table, Sorting, Counting | 193 | 93.33 |
1363 | Largest Multiple of Three | Hard | Array, Dynamic_Programming, Greedy | 267 | 100.00 |
1362 | Closest Divisors | Medium | Math | 167 | 100.00 |
1361 | Validate Binary Tree Nodes | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Graph, Union_Find | 316 | 83.33 |
1360 | Number of Days Between Two Dates | Easy | String, Math | 166 | 100.00 |
1359 | Count All Valid Pickup and Delivery Options | Hard | Dynamic_Programming, Math, Combinatorics | 121 | 100.00 |
1358 | Number of Substrings Containing All Three Characters | Medium | String, Hash_Table, Sliding_Window | 196 | 100.00 |
1357 | Apply Discount Every n Orders | Medium | Array, Hash_Table, Design | 967 | 100.00 |
1356 | Sort Integers by The Number of 1 Bits | Easy | Array, Sorting, Bit_Manipulation, Counting, Programming_Skills_I_Day_11_Containers_and_Libraries | 236 | 92.31 |
1354 | Construct Target Array With Multiple Sums | Hard | Array, Heap_Priority_Queue | 289 | 100.00 |
1353 | Maximum Number of Events That Can Be Attended | Medium | Array, Greedy, Heap_Priority_Queue | 728 | 100.00 |
1352 | Product of the Last K Numbers | Medium | Array, Math, Design, Queue, Data_Stream | 563 | 100.00 |
1351 | Count Negative Numbers in a Sorted Matrix | Easy | Array, Binary_Search, Matrix, Binary_Search_I_Day_8 | 206 | 71.43 |
1349 | Maximum Students Taking Exam | Hard | Array, Dynamic_Programming, Matrix, Bit_Manipulation, Bitmask | 173 | 100.00 |
1348 | Tweet Counts Per Frequency | Medium | Hash_Table, Sorting, Binary_Search, Design, Ordered_Set | 701 | 100.00 |
1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium | String, Hash_Table, Counting | 250 | 67.35 |
1346 | Check If N and Its Double Exist | Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Binary_Search_I_Day_9 | 175 | 70.83 |
1345 | Jump Game IV | Hard | Array, Hash_Table, Breadth_First_Search | 599 | 100.00 |
1344 | Angle Between Hands of a Clock | Medium | Math | 118 | 83.33 |
1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | Array, Sliding_Window | 394 | 84.62 |
1342 | Number of Steps to Reduce a Number to Zero | Easy | Math, Bit_Manipulation | 124 | 83.18 |
1341 | Movie Rating | Medium | Database | 2843 | 48.31 |
1340 | Jump Game V | Hard | Array, Dynamic_Programming, Sorting | 208 | 100.00 |
1339 | Maximum Product of Splitted Binary Tree | Medium | Depth_First_Search, Tree, Binary_Tree | 384 | 100.00 |
1338 | Reduce Array Size to The Half | Medium | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue | 579 | 71.43 |
1337 | The K Weakest Rows in a Matrix | Easy | Array, Sorting, Binary_Search, Matrix, Heap_Priority_Queue, Binary_Search_I_Day_9 | 216 | 77.59 |
1335 | Minimum Difficulty of a Job Schedule | Hard | Array, Dynamic_Programming | 154 | 100.00 |
1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | Dynamic_Programming, Graph, Shortest_Path | 223 | 88.89 |
1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | Medium | Array, Sorting | 326 | 100.00 |
1332 | Remove Palindromic Subsequences | Easy | String, Two_Pointers | 122 | 83.33 |
1331 | Rank Transform of an Array | Easy | Array, Hash_Table, Sorting | 553 | 100.00 |
1330 | Reverse Subarray To Maximize Array Value | Hard | Array, Math, Greedy | 347 | 100.00 |
1329 | Sort the Matrix Diagonally | Medium | Array, Sorting, Matrix | 243 | 100.00 |
1328 | Break a Palindrome | Medium | String, Greedy | 137 | 81.82 |
1327 | List the Products Ordered in a Period | Easy | Database | 1324 | 61.30 |
1326 | Minimum Number of Taps to Open to Water a Garden | Hard | Array, Dynamic_Programming, Greedy | 189 | 100.00 |
1325 | Delete Leaves With a Given Value | Medium | Depth_First_Search, Tree, Binary_Tree | 185 | 100.00 |
1324 | Print Words Vertically | Medium | Array, String, Simulation | 149 | 66.67 |
1323 | Maximum 69 Number | Easy | Math, Greedy | 118 | 90.00 |
1321 | Restaurant Growth | Medium | Database | 630 | 83.05 |
1320 | Minimum Distance to Type a Word Using Two Fingers | Hard | String, Dynamic_Programming | 181 | 100.00 |
1319 | Number of Operations to Make Network Connected | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Graph_Theory_I_Day_8_Standard_Traversal | 379 | 83.33 |
1318 | Minimum Flips to Make a OR b Equal to c | Medium | Bit_Manipulation, LeetCode_75_Bit_Manipulation | 123 | 88.89 |
1317 | Convert Integer to the Sum of Two No-Zero Integers | Easy | Math | 146 | 100.00 |
1316 | Distinct Echo Substrings | Hard | String, Dynamic_Programming, Sliding_Window, Trie, Hash_Function, Rolling_Hash | 371 | 100.00 |
1315 | Sum of Nodes with Even-Valued Grandparent | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 257 | 82.35 |
1314 | Matrix Block Sum | Medium | Array, Matrix, Prefix_Sum, Dynamic_Programming_I_Day_14 | 235 | 100.00 |
1313 | Decompress Run-Length Encoded List | Easy | Array | 196 | 100.00 |
1312 | Minimum Insertion Steps to Make a String Palindrome | Hard | String, Dynamic_Programming | 186 | 67.70 |
1311 | Get Watched Videos by Your Friends | Medium | Array, Hash_Table, Sorting, Breadth_First_Search | 372 | 100.00 |
1310 | XOR Queries of a Subarray | Medium | Array, Bit_Manipulation, Prefix_Sum | 382 | 100.00 |
1309 | Decrypt String from Alphabet to Integer Mapping | Easy | String, Programming_Skills_I_Day_9_String | 0 | 100.00 |
1307 | Verbal Arithmetic Puzzle | Hard | Array, String, Math, Backtracking | 164 | 100.00 |
1306 | Jump Game III | Medium | Array, Depth_First_Search, Breadth_First_Search, Graph_Theory_I_Day_11_Breadth_First_Search, Udemy_Arrays | 291 | 100.00 |
1305 | All Elements in Two Binary Search Trees | Medium | Sorting, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 531 | 100.00 |
1304 | Find N Unique Integers Sum up to Zero | Easy | Array, Math | 142 | 100.00 |
1302 | Deepest Leaves Sum | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 325 | 67.39 |
1301 | Number of Paths with Max Score | Hard | Array, Dynamic_Programming, Matrix | 178 | 100.00 |
1300 | Sum of Mutated Array Closest to Target | Medium | Array, Sorting, Binary_Search, Binary_Search_II_Day_16 | 217 | 100.00 |
1299 | Replace Elements with Greatest Element on Right Side | Easy | Array | 514 | 79.69 |
1298 | Maximum Candies You Can Get from Boxes | Hard | Array, Breadth_First_Search | 442 | 80.00 |
1297 | Maximum Number of Occurrences of a Substring | Medium | String, Hash_Table, Sliding_Window | 253 | 75.00 |
1296 | Divide Array in Sets of K Consecutive Numbers | Medium | Array, Hash_Table, Sorting, Greedy | 488 | 100.00 |
1295 | Find Numbers with Even Number of Digits | Easy | Array | 189 | 35.85 |
1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | Array, Breadth_First_Search, Matrix | 189 | 100.00 |
1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | Array, Binary_Search, Matrix, Prefix_Sum, Binary_Search_II_Day_15 | 376 | 100.00 |
1291 | Sequential Digits | Medium | Enumeration, Udemy_Arrays | 114 | 100.00 |
1290 | Convert Binary Number in a Linked List to Integer | Easy | Math, Linked_List, Programming_Skills_I_Day_10_Linked_List_and_Tree | 138 | 65.79 |
1289 | Minimum Falling Path Sum II | Hard | Array, Dynamic_Programming, Matrix | 234 | 100.00 |
1288 | Remove Covered Intervals | Medium | Array, Sorting | 184 | 100.00 |
1287 | Element Appearing More Than 25% In Sorted Array | Easy | Array | 199 | 100.00 |
1286 | Iterator for Combination | Medium | String, Design, Backtracking, Iterator | 236 | 100.00 |
1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Hard | Array, Breadth_First_Search, Matrix, Bit_Manipulation | 131 | 100.00 |
1283 | Find the Smallest Divisor Given a Threshold | Medium | Array, Binary_Search, Binary_Search_II_Day_5 | 255 | 100.00 |
1282 | Group the People Given the Group Size They Belong To | Medium | Array, Hash_Table | 267 | 100.00 |
1281 | Subtract the Product and Sum of Digits of an Integer | Easy | Math, Programming_Skills_I_Day_2_Operator | 128 | 61.82 |
1280 | Students and Examinations | Easy | Database | 1552 | 85.96 |
1278 | Palindrome Partitioning III | Hard | String, Dynamic_Programming | 137 | 100.00 |
1277 | Count Square Submatrices with All Ones | Medium | Array, Dynamic_Programming, Matrix | 381 | 75.00 |
1276 | Number of Burgers with No Waste of Ingredients | Medium | Math | 190 | 50.00 |
1275 | Find Winner on a Tic Tac Toe Game | Easy | Array, Hash_Table, Matrix, Simulation | 125 | 87.50 |
1269 | Number of Ways to Stay in the Same Place After Some Steps | Hard | Dynamic_Programming | 159 | 50.00 |
1268 | Search Suggestions System | Medium | Array, String, LeetCode_75_Trie | 331 | 100.00 |
1267 | Count Servers that Communicate | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Counting, Union_Find | 295 | 100.00 |
1266 | Minimum Time Visiting All Points | Easy | Array, Math, Geometry | 152 | 100.00 |
1263 | Minimum Moves to Move a Box to Their Target Location | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue | 183 | 100.00 |
1262 | Greatest Sum Divisible by Three | Medium | Array, Dynamic_Programming, Greedy | 263 | 100.00 |
1261 | Find Elements in a Contaminated Binary Tree | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 287 | 100.00 |
1260 | Shift 2D Grid | Easy | Array, Matrix, Simulation | 302 | 100.00 |
1255 | Maximum Score Words Formed by Letters | Hard | Array, String, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 131 | 100.00 |
1254 | Number of Closed Islands | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Graph_Theory_I_Day_2_Matrix_Related_Problems | 177 | 89.47 |
1253 | Reconstruct a 2-Row Binary Matrix | Medium | Array, Greedy, Matrix | 496 | 75.00 |
1252 | Cells with Odd Values in a Matrix | Easy | Array, Math, Simulation | 134 | 100.00 |
1251 | Average Selling Price | Easy | Database | 1371 | 76.11 |
1250 | Check If It Is a Good Array | Hard | Array, Math, Number_Theory | 334 | 100.00 |
1249 | Minimum Remove to Make Valid Parentheses | Medium | String, Stack, Data_Structure_II_Day_14_Stack_Queue | 218 | 100.00 |
1248 | Count Number of Nice Subarrays | Medium | Array, Hash_Table, Math, Sliding_Window | 431 | 93.33 |
1247 | Minimum Swaps to Make Strings Equal | Medium | String, Math, Greedy | 134 | 66.67 |
1240 | Tiling a Rectangle with the Fewest Squares | Hard | Dynamic_Programming, Backtracking | 134 | 75.00 |
1239 | Maximum Length of a Concatenated String with Unique Characters | Medium | Array, String, Bit_Manipulation, Backtracking | 166 | 50.00 |
1238 | Circular Permutation in Binary Representation | Medium | Math, Bit_Manipulation, Backtracking | 296 | 100.00 |
1237 | Find Positive Integer Solution for a Given Equation | Medium | Math, Binary_Search, Two_Pointers, Interactive | 176 | 36.36 |
1235 | Maximum Profit in Job Scheduling | Hard | Array, Dynamic_Programming, Sorting, Binary_Search | 370 | 100.00 |
1234 | Replace the Substring for Balanced String | Medium | String, Sliding_Window | 182 | 100.00 |
1233 | Remove Sub-Folders from the Filesystem | Medium | Array, String, Trie | 459 | 40.00 |
1232 | Check If It Is a Straight Line | Easy | Array, Math, Geometry, Programming_Skills_I_Day_5_Function | 152 | 95.38 |
1227 | Airplane Seat Assignment Probability | Medium | Dynamic_Programming, Math, Brainteaser, Probability_and_Statistics | 135 | 100.00 |
1226 | The Dining Philosophers | Medium | Concurrency | 12 | 95.88 |
1224 | Maximum Equal Frequency | Hard | Array, Hash_Table | 330 | 100.00 |
1223 | Dice Roll Simulation | Hard | Array, Dynamic_Programming | 146 | 100.00 |
1222 | Queens That Can Attack the King | Medium | Array, Matrix, Simulation | 189 | 50.00 |
1221 | Split a String in Balanced Strings | Easy | String, Greedy, Counting | 131 | 67.65 |
1220 | Count Vowels Permutation | Hard | Dynamic_Programming | 129 | 100.00 |
1219 | Path with Maximum Gold | Medium | Array, Matrix, Backtracking | 238 | 100.00 |
1218 | Longest Arithmetic Subsequence of Given Difference | Medium | Array, Hash_Table, Dynamic_Programming | 420 | 100.00 |
1217 | Minimum Cost to Move Chips to The Same Position | Easy | Array, Math, Greedy | 119 | 100.00 |
1211 | Queries Quality and Percentage | Easy | Database | 1176 | 80.10 |
1210 | Minimum Moves to Reach Target with Rotations | Hard | Array, Breadth_First_Search, Matrix | 230 | 100.00 |
1209 | Remove All Adjacent Duplicates in String II | Medium | String, Stack | 223 | 100.00 |
1208 | Get Equal Substrings Within Budget | Medium | String, Binary_Search, Prefix_Sum, Sliding_Window | 163 | 100.00 |
1207 | Unique Number of Occurrences | Easy | Array, Hash_Table, LeetCode_75_Hash_Map/Set | 151 | 83.00 |
1206 | Design Skiplist | Hard | Design, Linked_List | 306 | 100.00 |
1204 | Last Person to Fit in the Bus | Medium | Database | 1476 | 82.95 |
1203 | Sort Items by Groups Respecting Dependencies | Hard | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 503 | 100.00 |
1202 | Smallest String With Swaps | Medium | String, Hash_Table, Depth_First_Search, Breadth_First_Search, Union_Find | 562 | 100.00 |
1201 | Ugly Number III | Medium | Math, Binary_Search, Number_Theory, Binary_Search_II_Day_20 | 136 | 100.00 |
1200 | Minimum Absolute Difference | Easy | Array, Sorting | 507 | 75.00 |
1195 | Fizz Buzz Multithreaded | Medium | Concurrency | 6 | 87.26 |
1193 | Monthly Transactions I | Medium | Database | 891 | 92.73 |
1192 | Critical Connections in a Network | Hard | Depth_First_Search, Graph, Biconnected_Component | 1696 | 60.00 |
1191 | K-Concatenation Maximum Sum | Medium | Array, Dynamic_Programming | 389 | 100.00 |
1190 | Reverse Substrings Between Each Pair of Parentheses | Medium | String, Stack | 153 | 42.86 |
1189 | Maximum Number of Balloons | Easy | String, Hash_Table, Counting | 136 | 98.31 |
1187 | Make Array Strictly Increasing | Hard | Array, Dynamic_Programming, Binary_Search | 308 | 100.00 |
1186 | Maximum Subarray Sum with One Deletion | Medium | Array, Dynamic_Programming | 304 | 50.00 |
1185 | Day of the Week | Easy | Math | 127 | 50.00 |
1184 | Distance Between Bus Stops | Easy | Array | 164 | 57.14 |
1179 | Reformat Department Table | Easy | Database | 815 | 90.95 |
1178 | Number of Valid Words for Each Puzzle | Hard | Array, String, Hash_Table, Bit_Manipulation, Trie | 675 | 100.00 |
1177 | Can Make Palindrome from Substring | Medium | String, Hash_Table, Bit_Manipulation, Prefix_Sum | 937 | 100.00 |
1175 | Prime Arrangements | Easy | Math | 129 | 50.00 |
1174 | Immediate Food Delivery II | Medium | Database | 981 | 97.51 |
1172 | Dinner Plate Stacks | Hard | Hash_Table, Stack, Design, Heap_Priority_Queue | 1160 | 50.00 |
1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium | Hash_Table, Linked_List | 194 | 50.00 |
1170 | Compare Strings by Frequency of the Smallest Character | Medium | Array, String, Hash_Table, Sorting, Binary_Search | 221 | 50.00 |
1169 | Invalid Transactions | Medium | Array, String, Hash_Table, Sorting | 362 | 57.14 |
1164 | Product Price at a Given Date | Medium | Database | 774 | 91.86 |
1163 | Last Substring in Lexicographical Order | Hard | String, Two_Pointers | 254 | 100.00 |
1162 | As Far from Land as Possible | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix, Graph_Theory_I_Day_4_Matrix_Related_Problems | 362 | 81.25 |
1161 | Maximum Level Sum of a Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 445 | 87.50 |
1160 | Find Words That Can Be Formed by Characters | Easy | Array, String, Hash_Table | 288 | 72.22 |
1158 | Market Analysis I | Medium | Database, SQL_I_Day_9_Control_of_Flow | 2470 | 44.76 |
1157 | Online Majority Element In Subarray | Hard | Array, Binary_Search, Design, Segment_Tree, Binary_Indexed_Tree | 953 | 100.00 |
1156 | Swap For Longest Repeated Character Substring | Medium | String, Sliding_Window | 198 | 100.00 |
1155 | Number of Dice Rolls With Target Sum | Medium | Dynamic_Programming | 158 | 80.95 |
1154 | Day of the Year | Easy | String, Math | 317 | 70.00 |
1148 | Article Views I | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_5_Union | 806 | 54.41 |
1147 | Longest Chunked Palindrome Decomposition | Hard | String, Dynamic_Programming, Greedy, Two_Pointers, Hash_Function, Rolling_Hash | 148 | 50.00 |
1146 | Snapshot Array | Medium | Array, Hash_Table, Binary_Search, Design, Binary_Search_II_Day_18 | 1064 | 57.14 |
1145 | Binary Tree Coloring Game | Medium | Depth_First_Search, Tree, Binary_Tree | 181 | 100.00 |
1144 | Decrease Elements To Make Array Zigzag | Medium | Array, Greedy | 144 | 100.00 |
1143 | Longest Common Subsequence | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n*m)_Space_O(n*m) | 307 | 38.36 |
1141 | User Activity for the Past 30 Days I | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_7_Function | 790 | 87.11 |
1140 | Stone Game II | Medium | Array, Dynamic_Programming, Math, Game_Theory | 166 | 93.27 |
1139 | Largest 1-Bordered Square | Medium | Array, Dynamic_Programming, Matrix | 224 | 100.00 |
1138 | Alphabet Board Path | Medium | String, Hash_Table | 138 | 100.00 |
1137 | N-th Tribonacci Number | Easy | Dynamic_Programming, Math, Memoization, LeetCode_75_DP/1D, Dynamic_Programming_I_Day_1 | 122 | 69.35 |
1131 | Maximum of Absolute Value Expression | Medium | Array, Math | 333 | 100.00 |
1130 | Minimum Cost Tree From Leaf Values | Medium | Dynamic_Programming, Greedy, Stack, Monotonic_Stack | 145 | 66.67 |
1129 | Shortest Path with Alternating Colors | Medium | Breadth_First_Search, Graph, Graph_Theory_I_Day_10_Standard_Traversal | 208 | 80.00 |
1128 | Number of Equivalent Domino Pairs | Easy | Array, Hash_Table, Counting | 289 | 80.00 |
1125 | Smallest Sufficient Team | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 181 | 100.00 |
1124 | Longest Well-Performing Interval | Medium | Array, Hash_Table, Stack, Prefix_Sum, Monotonic_Stack | 313 | 100.00 |
1123 | Lowest Common Ancestor of Deepest Leaves | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 221 | 66.67 |
1122 | Relative Sort Array | Easy | Array, Hash_Table, Sorting, Counting_Sort | 183 | 90.00 |
1117 | Building H2O | Medium | Concurrency | 20 | 45.16 |
1116 | Print Zero Even Odd | Medium | Concurrency | 7 | 39.21 |
1115 | Print FooBar Alternately | Medium | Concurrency | 23 | 71.25 |
1114 | Print in Order | Easy | Concurrency | 13 | 30.13 |
1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | Medium | String, Stack | 207 | 33.33 |
1110 | Delete Nodes And Return Forest | Medium | Depth_First_Search, Tree, Binary_Tree | 223 | 100.00 |
1109 | Corporate Flight Bookings | Medium | Array, Prefix_Sum | 719 | 100.00 |
1108 | Defanging an IP Address | Easy | String | 159 | 62.10 |
1106 | Parsing A Boolean Expression | Hard | String, Stack, Recursion | 205 | 100.00 |
1105 | Filling Bookcase Shelves | Medium | Array, Dynamic_Programming | 175 | 33.33 |
1104 | Path In Zigzag Labelled Binary Tree | Medium | Math, Tree, Binary_Tree | 136 | 100.00 |
1103 | Distribute Candies to People | Easy | Math, Simulation | 129 | 100.00 |
1096 | Brace Expansion II | Hard | String, Breadth_First_Search, Stack, Backtracking | 205 | 100.00 |
1095 | Find in Mountain Array | Hard | Array, Binary_Search, Interactive | 173 | 100.00 |
1094 | Car Pooling | Medium | Array, Sorting, Heap_Priority_Queue, Simulation, Prefix_Sum | 172 | 81.82 |
1093 | Statistics from a Large Sample | Medium | Math, Two_Pointers, Probability_and_Statistics | 191 | 100.00 |
1092 | Shortest Common Supersequence | Hard | String, Dynamic_Programming | 174 | 100.00 |
1091 | Shortest Path in Binary Matrix | Medium | Array, Breadth_First_Search, Matrix, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_5_Matrix_Related_Problems | 305 | 98.28 |
1090 | Largest Values From Labels | Medium | Array, Hash_Table, Sorting, Greedy, Counting | 281 | 100.00 |
1089 | Duplicate Zeros | Easy | Array, Two_Pointers | 185 | 93.60 |
1084 | Sales Analysis III | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_10_Where | 1881 | 79.36 |
1081 | Smallest Subsequence of Distinct Characters | Medium | String, Greedy, Stack, Monotonic_Stack | 146 | 100.00 |
1080 | Insufficient Nodes in Root to Leaf Paths | Medium | Depth_First_Search, Tree, Binary_Tree | 271 | 100.00 |
1079 | Letter Tile Possibilities | Medium | String, Backtracking | 144 | 100.00 |
1078 | Occurrences After Bigram | Easy | String | 151 | 88.24 |
1075 | Project Employees I | Easy | Database | 1268 | 94.71 |
1074 | Number of Submatrices That Sum to Target | Hard | Array, Hash_Table, Matrix, Prefix_Sum | 770 | 100.00 |
1073 | Adding Two Negabinary Numbers | Medium | Array, Math | 187 | 100.00 |
1072 | Flip Columns For Maximum Number of Equal Rows | Medium | Array, Hash_Table, Matrix | 536 | 100.00 |
1071 | Greatest Common Divisor of Strings | Easy | String, Math, LeetCode_75_Array/String | 150 | 80.68 |
1070 | Product Sales Analysis III | Medium | Database | 1561 | 95.47 |
1068 | Product Sales Analysis I | Easy | Database | 1897 | 79.88 |
1061 | Lexicographically Smallest Equivalent String | Medium | String, Union_Find | 166 | 100.00 |
1054 | Distant Barcodes | Medium | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Counting | 622 | 75.00 |
1053 | Previous Permutation With One Swap | Medium | Array, Greedy | 288 | 100.00 |
1052 | Grumpy Bookstore Owner | Medium | Array, Sliding_Window | 268 | 80.00 |
1051 | Height Checker | Easy | Array, Sorting, Counting_Sort | 140 | 94.37 |
1050 | Actors and Directors Who Cooperated At Least Three Times | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_10_Where | 629 | 81.02 |
1049 | Last Stone Weight II | Medium | Array, Dynamic_Programming | 150 | 100.00 |
1048 | Longest String Chain | Medium | Array, String, Hash_Table, Dynamic_Programming, Two_Pointers | 273 | 75.00 |
1047 | Remove All Adjacent Duplicates In String | Easy | String, Stack | 228 | 94.52 |
1046 | Last Stone Weight | Easy | Array, Heap_Priority_Queue, Level_1_Day_15_Heap | 123 | 100.00 |
1045 | Customers Who Bought All Products | Medium | Database | 881 | 90.47 |
1044 | Longest Duplicate Substring | Hard | String, Binary_Search, Sliding_Window, Hash_Function, Rolling_Hash, Suffix_Array | 592 | 100.00 |
1043 | Partition Array for Maximum Sum | Medium | Array, Dynamic_Programming | 194 | 71.43 |
1042 | Flower Planting With No Adjacent | Medium | Depth_First_Search, Breadth_First_Search, Graph | 396 | 85.71 |
1041 | Robot Bounded In Circle | Medium | String, Math, Simulation | 121 | 100.00 |
1040 | Moving Stones Until Consecutive II | Medium | Array, Math, Sorting, Two_Pointers | 287 | 50.00 |
1039 | Minimum Score Triangulation of Polygon | Medium | Array, Dynamic_Programming | 147 | 100.00 |
1038 | Binary Search Tree to Greater Sum Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 123 | 91.67 |
1037 | Valid Boomerang | Easy | Array, Math, Geometry | 126 | 100.00 |
1036 | Escape a Large Maze | Hard | Array, Hash_Table, Depth_First_Search, Breadth_First_Search | 387 | 100.00 |
1035 | Uncrossed Lines | Medium | Array, Dynamic_Programming | 162 | 93.33 |
1034 | Coloring A Border | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 332 | 100.00 |
1033 | Moving Stones Until Consecutive | Medium | Math, Brainteaser | 139 | 100.00 |
1032 | Stream of Characters | Hard | Array, String, Design, Trie, Data_Stream | 733 | 100.00 |
1031 | Maximum Sum of Two Non-Overlapping Subarrays | Medium | Array, Dynamic_Programming, Sliding_Window | 172 | 100.00 |
1030 | Matrix Cells in Distance Order | Easy | Array, Math, Sorting, Matrix, Geometry | 426 | 100.00 |
1029 | Two City Scheduling | Medium | Array, Sorting, Greedy | 148 | 100.00 |
1028 | Recover a Tree From Preorder Traversal | Hard | String, Depth_First_Search, Tree, Binary_Tree | 246 | 100.00 |
1027 | Longest Arithmetic Subsequence | Medium | Array, Hash_Table, Dynamic_Programming, Binary_Search | 330 | 100.00 |
1026 | Maximum Difference Between Node and Ancestor | Medium | Depth_First_Search, Tree, Binary_Tree | 155 | 77.78 |
1025 | Divisor Game | Easy | Dynamic_Programming, Math, Game_Theory, Brainteaser | 114 | 93.33 |
1024 | Video Stitching | Medium | Array, Dynamic_Programming, Greedy | 141 | 100.00 |
1023 | Camelcase Matching | Medium | String, Two_Pointers, Trie, String_Matching | 149 | 60.00 |
1022 | Sum of Root To Leaf Binary Numbers | Easy | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
1021 | Remove Outermost Parentheses | Easy | String, Stack | 156 | 60.00 |
1020 | Number of Enclaves | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Graph_Theory_I_Day_3_Matrix_Related_Problems | 283 | 90.70 |
1019 | Next Greater Node In Linked List | Medium | Array, Stack, Linked_List, Monotonic_Stack | 472 | 75.00 |
1018 | Binary Prefix Divisible By 5 | Easy | Array | 297 | 100.00 |
1017 | Convert to Base -2 | Medium | Math | 138 | 100.00 |
1016 | Binary String With Substrings Representing 1 To N | Medium | String | 134 | 75.00 |
1015 | Smallest Integer Divisible by K | Medium | Hash_Table, Math | 123 | 100.00 |
1014 | Best Sightseeing Pair | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_7 | 336 | 66.67 |
1013 | Partition Array Into Three Parts With Equal Sum | Easy | Array, Greedy | 328 | 100.00 |
1012 | Numbers With Repeated Digits | Hard | Dynamic_Programming, Math | 123 | 100.00 |
1011 | Capacity To Ship Packages Within D Days | Medium | Array, Binary_Search | 325 | 66.67 |
1010 | Pairs of Songs With Total Durations Divisible by 60 | Medium | Array, Hash_Table, Counting | 287 | 77.78 |
1009 | Complement of Base 10 Integer | Easy | Bit_Manipulation, Udemy_Bit_Manipulation | 126 | 72.73 |
1008 | Construct Binary Search Tree from Preorder Traversal | Medium | Array, Tree, Binary_Tree, Stack, Monotonic_Stack, Binary_Search_Tree, Udemy_Tree_Stack_Queue | 145 | 100.00 |
1007 | Minimum Domino Rotations For Equal Row | Medium | Array, Greedy, Udemy_Arrays | 421 | 50.00 |
1006 | Clumsy Factorial | Medium | Math, Stack, Simulation | 127 | 100.00 |
1005 | Maximize Sum Of Array After K Negations | Easy | Array, Sorting, Greedy | 167 | 100.00 |
1004 | Max Consecutive Ones III | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window, LeetCode_75_Sliding_Window | 318 | 30.95 |
1003 | Check If Word Is Valid After Substitutions | Medium | String, Stack | 216 | 100.00 |
1002 | Find Common Characters | Easy | Array, String, Hash_Table | 181 | 100.00 |
1001 | Grid Illumination | Hard | Array, Hash_Table | 801 | 100.00 |
1000 | Minimum Cost to Merge Stones | Hard | Array, Dynamic_Programming | 152 | 75.00 |
0999 | Available Captures for Rook | Easy | Array, Matrix, Simulation | 0 | 100.00 |
0998 | Maximum Binary Tree II | Medium | Tree, Binary_Tree | 157 | 100.00 |
0997 | Find the Town Judge | Easy | Array, Hash_Table, Graph, Data_Structure_II_Day_19_Graph, Graph_Theory_I_Day_13_Graph_Theory | 475 | 58.62 |
0996 | Number of Squareful Arrays | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Backtracking, Bitmask | 139 | 100.00 |
0995 | Minimum Number of K Consecutive Bit Flips | Hard | Array, Bit_Manipulation, Prefix_Sum, Sliding_Window | 480 | 100.00 |
0994 | Rotting Oranges | Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS, Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search, Level_2_Day_10_Graph/BFS/DFS | 164 | 82.95 |
0993 | Cousins in Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 152 | 71.43 |
0992 | Subarrays with K Different Integers | Hard | Array, Hash_Table, Counting, Sliding_Window | 341 | 87.50 |
0991 | Broken Calculator | Medium | Math, Greedy | 127 | 100.00 |
0990 | Satisfiability of Equality Equations | Medium | Array, String, Graph, Union_Find | 163 | 100.00 |
0989 | Add to Array-Form of Integer | Easy | Array, Math, Programming_Skills_II_Day_5 | 350 | 70.00 |
0988 | Smallest String Starting From Leaf | Medium | String, Depth_First_Search, Tree, Binary_Tree | 180 | 100.00 |
0987 | Vertical Order Traversal of a Binary Tree | Hard | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 189 | 66.67 |
0986 | Interval List Intersections | Medium | Array, Two_Pointers, Algorithm_II_Day_4_Two_Pointers | 318 | 60.98 |
0985 | Sum of Even Numbers After Queries | Medium | Array, Simulation | 497 | 71.43 |
0984 | String Without AAA or BBB | Medium | String, Greedy | 132 | 66.67 |
0983 | Minimum Cost For Tickets | Medium | Array, Dynamic_Programming | 147 | 92.80 |
0982 | Triples with Bitwise AND Equal To Zero | Hard | Array, Hash_Table, Bit_Manipulation | 227 | 100.00 |
0981 | Time Based Key-Value Store | Medium | String, Hash_Table, Binary_Search, Design, Binary_Search_II_Day_16 | 1011 | 65.56 |
0980 | Unique Paths III | Hard | Array, Matrix, Bit_Manipulation, Backtracking | 134 | 100.00 |
0979 | Distribute Coins in Binary Tree | Medium | Depth_First_Search, Tree, Binary_Tree | 165 | 80.00 |
0978 | Longest Turbulent Subarray | Medium | Array, Dynamic_Programming, Sliding_Window | 395 | 40.00 |
0977 | Squares of a Sorted Array | Easy | Array, Sorting, Two_Pointers, Algorithm_I_Day_2_Two_Pointers, Udemy_Two_Pointers | 271 | 77.17 |
0976 | Largest Perimeter Triangle | Easy | Array, Math, Sorting, Greedy, Programming_Skills_I_Day_3_Conditional_Statements | 304 | 33.33 |
0975 | Odd Even Jump | Hard | Array, Dynamic_Programming, Stack, Ordered_Set, Monotonic_Stack | 326 | 100.00 |
0974 | Subarray Sums Divisible by K | Medium | Array, Hash_Table, Prefix_Sum | 334 | 66.67 |
0973 | K Closest Points to Origin | Medium | Array, Math, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Geometry, Quickselect, Data_Structure_II_Day_21_Heap_Priority_Queue, Programming_Skills_II_Day_8 | 800 | 37.89 |
0972 | Equal Rational Numbers | Hard | String, Math | 130 | 100.00 |
0971 | Flip Binary Tree To Match Preorder Traversal | Medium | Depth_First_Search, Tree, Binary_Tree | 173 | 66.67 |
0970 | Powerful Integers | Medium | Hash_Table, Math | 136 | 100.00 |
0969 | Pancake Sorting | Medium | Array, Sorting, Greedy, Two_Pointers | 169 | 100.00 |
0968 | Binary Tree Cameras | Hard | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue | 176 | 100.00 |
0967 | Numbers With Same Consecutive Differences | Medium | Breadth_First_Search, Backtracking | 144 | 100.00 |
0966 | Vowel Spellchecker | Medium | Array, String, Hash_Table | 371 | 100.00 |
0965 | Univalued Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 138 | 90.91 |
0964 | Least Operators to Express Number | Hard | Dynamic_Programming, Math | 160 | 100.00 |
0963 | Minimum Area Rectangle II | Medium | Array, Math, Geometry | 183 | 100.00 |
0962 | Maximum Width Ramp | Medium | Array, Stack, Monotonic_Stack | 324 | 100.00 |
0961 | N-Repeated Element in Size 2N Array | Easy | Array, Hash_Table | 264 | 75.00 |
0960 | Delete Columns to Make Sorted III | Hard | Array, String, Dynamic_Programming | 200 | 100.00 |
0959 | Regions Cut By Slashes | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 180 | 100.00 |
0958 | Check Completeness of a Binary Tree | Medium | Breadth_First_Search, Tree, Binary_Tree | 142 | 96.04 |
0957 | Prison Cells After N Days | Medium | Array, Hash_Table, Math, Bit_Manipulation | 172 | 100.00 |
0956 | Tallest Billboard | Hard | Array, Dynamic_Programming | 182 | 100.00 |
0955 | Delete Columns to Make Sorted II | Medium | Array, String, Greedy | 190 | 100.00 |
0954 | Array of Doubled Pairs | Medium | Array, Hash_Table, Sorting, Greedy | 462 | 100.00 |
0953 | Verifying an Alien Dictionary | Easy | Array, String, Hash_Table, Programming_Skills_I_Day_9_String | 137 | 100.00 |
0952 | Largest Component Size by Common Factor | Hard | Array, Math, Union_Find | 538 | 100.00 |
0951 | Flip Equivalent Binary Trees | Medium | Depth_First_Search, Tree, Binary_Tree | 150 | 100.00 |
0950 | Reveal Cards In Increasing Order | Medium | Array, Sorting, Simulation, Queue | 176 | 100.00 |
0949 | Largest Time for Given Digits | Medium | String, Enumeration | 171 | 100.00 |
0948 | Bag of Tokens | Medium | Array, Sorting, Greedy, Two_Pointers | 161 | 100.00 |
0947 | Most Stones Removed with Same Row or Column | Medium | Depth_First_Search, Graph, Union_Find, Level_2_Day_19_Union_Find | 200 | 100.00 |
0946 | Validate Stack Sequences | Medium | Array, Stack, Simulation | 180 | 74.91 |
0945 | Minimum Increment to Make Array Unique | Medium | Array, Sorting, Greedy, Counting | 427 | 100.00 |
0944 | Delete Columns to Make Sorted | Easy | Array, String | 221 | 75.00 |
0943 | Find the Shortest Superstring | Hard | Array, String, Dynamic_Programming, Bit_Manipulation, Bitmask | 1290 | 100.00 |
0942 | DI String Match | Easy | Array, String, Math, Greedy, Two_Pointers | 202 | 80.00 |
0941 | Valid Mountain Array | Easy | Array | 251 | 51.94 |
0940 | Distinct Subsequences II | Hard | String, Dynamic_Programming | 177 | 100.00 |
0939 | Minimum Area Rectangle | Medium | Array, Hash_Table, Math, Sorting, Geometry | 461 | 100.00 |
0938 | Range Sum of BST | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Udemy_Tree_Stack_Queue | 356 | 55.36 |
0937 | Reorder Data in Log Files | Medium | Array, String, Sorting | 205 | 81.82 |
0936 | Stamping The Sequence | Hard | String, Greedy, Stack, Queue | 196 | 100.00 |
0935 | Knight Dialer | Medium | Dynamic_Programming | 160 | 100.00 |
0934 | Shortest Bridge | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Graph_Theory_I_Day_6_Matrix_Related_Problems | 301 | 80.95 |
0933 | Number of Recent Calls | Easy | Design, Queue, Data_Stream, LeetCode_75_Queue | 476 | 82.50 |
0932 | Beautiful Array | Medium | Array, Math, Divide_and_Conquer | 145 | 100.00 |
0931 | Minimum Falling Path Sum | Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_13 | 201 | 84.21 |
0930 | Binary Subarrays With Sum | Medium | Array, Hash_Table, Prefix_Sum, Sliding_Window | 250 | 93.75 |
0929 | Unique Email Addresses | Easy | Array, String, Hash_Table | 207 | 89.29 |
0928 | Minimize Malware Spread II | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 716 | 100.00 |
0927 | Three Equal Parts | Hard | Array, Math | 303 | 100.00 |
0926 | Flip String to Monotone Increasing | Medium | String, Dynamic_Programming | 199 | 100.00 |
0925 | Long Pressed Name | Easy | String, Two_Pointers | 126 | 92.31 |
0924 | Minimize Malware Spread | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 791 | 100.00 |
0923 | 3Sum With Multiplicity | Medium | Array, Hash_Table, Sorting, Two_Pointers, Counting | 190 | 100.00 |
0922 | Sort Array By Parity II | Easy | Array, Sorting, Two_Pointers | 257 | 87.50 |
0921 | Minimum Add to Make Parentheses Valid | Medium | String, Greedy, Stack | 131 | 92.59 |
0920 | Number of Music Playlists | Hard | Dynamic_Programming, Math, Combinatorics | 136 | 100.00 |
0919 | Complete Binary Tree Inserter | Medium | Breadth_First_Search, Tree, Binary_Tree, Design | 225 | 100.00 |
0918 | Maximum Sum Circular Subarray | Medium | Array, Dynamic_Programming, Divide_and_Conquer, Queue, Monotonic_Queue, Dynamic_Programming_I_Day_5, Top_Interview_150_Kadane’s_Algorithm | 339 | 86.96 |
0917 | Reverse Only Letters | Easy | String, Two_Pointers | 126 | 100.00 |
0916 | Word Subsets | Medium | Array, String, Hash_Table | 397 | 88.89 |
0915 | Partition Array into Disjoint Intervals | Medium | Array | 510 | 76.92 |
0914 | X of a Kind in a Deck of Cards | Easy | Array, Hash_Table, Math, Counting, Number_Theory | 238 | 70.00 |
0913 | Cat and Mouse | Hard | Dynamic_Programming, Math, Graph, Memoization, Topological_Sort, Game_Theory | 211 | 100.00 |
0912 | Sort an Array | Medium | Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Merge_Sort, Bucket_Sort, Counting_Sort, Radix_Sort, Udemy_Sorting_Algorithms | 606 | 98.48 |
0911 | Online Election | Medium | Array, Hash_Table, Binary_Search, Design, Binary_Search_II_Day_20 | 766 | 83.33 |
0910 | Smallest Range II | Medium | Array, Math, Sorting, Greedy, Programming_Skills_II_Day_13 | 234 | 100.00 |
0909 | Snakes and Ladders | Medium | Array, Breadth_First_Search, Matrix, Top_Interview_150_Graph_BFS | 203 | 100.00 |
0908 | Smallest Range I | Easy | Array, Math | 202 | 87.50 |
0907 | Sum of Subarray Minimums | Medium | Array, Dynamic_Programming, Stack, Monotonic_Stack | 341 | 100.00 |
0906 | Super Palindromes | Hard | Math, Enumeration | 153 | 100.00 |
0905 | Sort Array By Parity | Easy | Array, Sorting, Two_Pointers | 219 | 75.00 |
0904 | Fruit Into Baskets | Medium | Array, Hash_Table, Sliding_Window | 371 | 100.00 |
0903 | Valid Permutations for DI Sequence | Hard | Dynamic_Programming | 140 | 100.00 |
0902 | Numbers At Most N Given Digit Set | Hard | Array, Dynamic_Programming, Math, Binary_Search | 138 | 100.00 |
0901 | Online Stock Span | Medium | Stack, Design, Monotonic_Stack, Data_Stream, LeetCode_75_Monotonic_Stack | 641 | 75.00 |
0900 | RLE Iterator | Medium | Array, Design, Counting, Iterator | 175 | 83.33 |
0899 | Orderly Queue | Hard | String, Math, Sorting | 148 | 100.00 |
0898 | Bitwise ORs of Subarrays | Medium | Array, Dynamic_Programming, Bit_Manipulation | 812 | 100.00 |
0897 | Increasing Order Search Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Binary_Search_Tree | 128 | 85.71 |
0896 | Monotonic Array | Easy | Array, Programming_Skills_II_Day_1 | 576 | 90.91 |
0895 | Maximum Frequency Stack | Hard | Hash_Table, Stack, Design, Ordered_Set | 617 | 100.00 |
0894 | All Possible Full Binary Trees | Medium | Dynamic_Programming, Tree, Binary_Tree, Recursion, Memoization | 257 | 100.00 |
0893 | Groups of Special-Equivalent Strings | Medium | Array, String, Hash_Table | 141 | 100.00 |
0892 | Surface Area of 3D Shapes | Easy | Array, Math, Matrix, Geometry | 180 | 100.00 |
0891 | Sum of Subsequence Widths | Hard | Array, Math, Sorting | 481 | 100.00 |
0890 | Find and Replace Pattern | Medium | Array, String, Hash_Table | 150 | 100.00 |
0889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer | 168 | 100.00 |
0888 | Fair Candy Swap | Easy | Array, Hash_Table, Sorting, Binary_Search | 318 | 100.00 |
0887 | Super Egg Drop | Hard | Dynamic_Programming, Math, Binary_Search | 119 | 100.00 |
0886 | Possible Bipartition | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Graph_Theory_I_Day_14_Graph_Theory | 397 | 100.00 |
0885 | Spiral Matrix III | Medium | Array, Matrix, Simulation | 265 | 100.00 |
0884 | Uncommon Words from Two Sentences | Easy | String, Hash_Table | 171 | 100.00 |
0883 | Projection Area of 3D Shapes | Easy | Array, Math, Matrix, Geometry | 173 | 100.00 |
0882 | Reachable Nodes In Subdivided Graph | Hard | Heap_Priority_Queue, Graph, Shortest_Path | 434 | 100.00 |
0881 | Boats to Save People | Medium | Array, Sorting, Greedy, Two_Pointers | 370 | 96.07 |
0880 | Decoded String at Index | Medium | String, Stack | 134 | 100.00 |
0879 | Profitable Schemes | Hard | Array, Dynamic_Programming | 198 | 75.00 |
0878 | Nth Magical Number | Hard | Math, Binary_Search | 124 | 100.00 |
0877 | Stone Game | Medium | Array, Dynamic_Programming, Math, Game_Theory | 136 | 88.24 |
0876 | Middle of the Linked List | Easy | Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Programming_Skills_I_Day_10_Linked_List_and_Tree, Level_1_Day_4_Linked_List, Udemy_Linked_List | 136 | 76.52 |
0875 | Koko Eating Bananas | Medium | Array, Binary_Search, LeetCode_75_Binary_Search, Binary_Search_II_Day_4 | 267 | 93.85 |
0874 | Walking Robot Simulation | Medium | Array, Simulation | 274 | 100.00 |
0873 | Length of Longest Fibonacci Subsequence | Medium | Array, Hash_Table, Dynamic_Programming | 341 | 90.00 |
0872 | Leaf-Similar Trees | Easy | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS | 140 | 100.00 |
0871 | Minimum Number of Refueling Stops | Hard | Array, Dynamic_Programming, Greedy, Heap_Priority_Queue | 203 | 92.86 |
0870 | Advantage Shuffle | Medium | Array, Sorting, Greedy | 698 | 100.00 |
0869 | Reordered Power of 2 | Medium | Math, Sorting, Counting, Enumeration | 145 | 87.50 |
0868 | Binary Gap | Easy | Bit_Manipulation | 142 | 100.00 |
0867 | Transpose Matrix | Easy | Array, Matrix, Simulation | 201 | 100.00 |
0866 | Prime Palindrome | Medium | Math | 143 | 100.00 |
0865 | Smallest Subtree with all the Deepest Nodes | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 147 | 100.00 |
0864 | Shortest Path to Get All Keys | Hard | Breadth_First_Search, Bit_Manipulation | 176 | 100.00 |
0863 | All Nodes Distance K in Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 147 | 95.83 |
0862 | Shortest Subarray with Sum at Least K | Hard | Array, Binary_Search, Heap_Priority_Queue, Prefix_Sum, Sliding_Window, Queue, Monotonic_Queue | 563 | 84.62 |
0861 | Score After Flipping Matrix | Medium | Array, Greedy, Matrix, Bit_Manipulation | 135 | 71.43 |
0860 | Lemonade Change | Easy | Array, Greedy, Programming_Skills_II_Day_17 | 413 | 86.96 |
0859 | Buddy Strings | Easy | String, Hash_Table | 149 | 91.01 |
0858 | Mirror Reflection | Medium | Math, Geometry | 120 | 100.00 |
0857 | Minimum Cost to Hire K Workers | Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 302 | 100.00 |
0856 | Score of Parentheses | Medium | String, Stack | 129 | 84.62 |
0855 | Exam Room | Medium | Design, Ordered_Set | 644 | 83.33 |
0854 | K-Similar Strings | Hard | String, Breadth_First_Search | 136 | 100.00 |
0853 | Car Fleet | Medium | Array, Sorting, Stack, Monotonic_Stack | 757 | 85.29 |
0852 | Peak Index in a Mountain Array | Medium | Array, Binary_Search, Binary_Search_I_Day_2 | 433 | 94.29 |
0851 | Loud and Rich | Medium | Array, Depth_First_Search, Graph, Topological_Sort | 347 | 100.00 |
0850 | Rectangle Area II | Hard | Array, Ordered_Set, Segment_Tree, Line_Sweep | 171 | 100.00 |
0849 | Maximize Distance to Closest Person | Medium | Array | 196 | 88.46 |
0848 | Shifting Letters | Medium | Array, String | 537 | 93.75 |
0847 | Shortest Path Visiting All Nodes | Hard | Dynamic_Programming, Breadth_First_Search, Bit_Manipulation, Graph, Bitmask, Graph_Theory_I_Day_10_Standard_Traversal | 164 | 100.00 |
0846 | Hand of Straights | Medium | Array, Hash_Table, Sorting, Greedy | 306 | 96.15 |
0845 | Longest Mountain in Array | Medium | Array, Dynamic_Programming, Two_Pointers, Enumeration | 222 | 100.00 |
0844 | Backspace String Compare | Easy | String, Two_Pointers, Stack, Simulation, Algorithm_II_Day_4_Two_Pointers, Level_1_Day_14_Stack | 126 | 98.31 |
0843 | Guess the Word | Hard | Array, String, Math, Game_Theory, Interactive | 75 | 100.00 |
0842 | Split Array into Fibonacci Sequence | Medium | String, Backtracking | 142 | 100.00 |
0841 | Keys and Rooms | Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS, Data_Structure_II_Day_19_Graph, Graph_Theory_I_Day_7_Standard_Traversal | 189 | 69.23 |
0840 | Magic Squares In Grid | Medium | Array, Math, Matrix | 149 | 100.00 |
0839 | Similar String Groups | Hard | Array, String, Depth_First_Search, Breadth_First_Search, Union_Find | 205 | 100.00 |
0838 | Push Dominoes | Medium | String, Dynamic_Programming, Two_Pointers | 270 | 100.00 |
0837 | New 21 Game | Medium | Dynamic_Programming, Math, Sliding_Window, Probability_and_Statistics | 144 | 75.00 |
0836 | Rectangle Overlap | Easy | Math, Geometry | 121 | 100.00 |
0835 | Image Overlap | Medium | Array, Matrix | 163 | 100.00 |
0834 | Sum of Distances in Tree | Hard | Dynamic_Programming, Depth_First_Search, Tree, Graph | 746 | 100.00 |
0833 | Find And Replace in String | Medium | Array, String, Sorting | 158 | 100.00 |
0832 | Flipping an Image | Easy | Array, Matrix, Two_Pointers, Simulation | 190 | 94.44 |
0831 | Masking Personal Information | Medium | String | 149 | 100.00 |
0830 | Positions of Large Groups | Easy | String | 221 | 100.00 |
0829 | Consecutive Numbers Sum | Hard | Math, Enumeration | 151 | 100.00 |
0828 | Count Unique Characters of All Substrings of a Given String | Hard | String, Hash_Table, Dynamic_Programming | 216 | 100.00 |
0827 | Making A Large Island | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 985 | 100.00 |
0826 | Most Profit Assigning Work | Medium | Array, Sorting, Greedy, Binary_Search, Two_Pointers, Binary_Search_II_Day_11 | 366 | 100.00 |
0825 | Friends Of Appropriate Ages | Medium | Array, Sorting, Binary_Search, Two_Pointers | 278 | 100.00 |
0824 | Goat Latin | Easy | String | 146 | 100.00 |
0823 | Binary Trees With Factors | Medium | Array, Hash_Table, Dynamic_Programming | 298 | 100.00 |
0822 | Card Flipping Game | Medium | Array, Hash_Table | 186 | 100.00 |
0821 | Shortest Distance to a Character | Easy | Array, String, Two_Pointers | 168 | 88.00 |
0820 | Short Encoding of Words | Medium | Array, String, Hash_Table, Trie | 231 | 100.00 |
0819 | Most Common Word | Easy | String, Hash_Table, Counting | 211 | 83.33 |
0818 | Race Car | Hard | Dynamic_Programming | 123 | 100.00 |
0817 | Linked List Components | Medium | Hash_Table, Linked_List | 239 | 100.00 |
0816 | Ambiguous Coordinates | Medium | String, Backtracking | 231 | 100.00 |
0815 | Bus Routes | Hard | Array, Hash_Table, Breadth_First_Search, Level_2_Day_11_Graph/BFS/DFS | 429 | 100.00 |
0814 | Binary Tree Pruning | Medium | Depth_First_Search, Tree, Binary_Tree | 127 | 100.00 |
0813 | Largest Sum of Averages | Medium | Array, Dynamic_Programming | 160 | 100.00 |
0812 | Largest Triangle Area | Easy | Array, Math, Geometry | 156 | 71.43 |
0811 | Subdomain Visit Count | Medium | Array, String, Hash_Table, Counting | 220 | 100.00 |
0810 | Chalkboard XOR Game | Hard | Array, Math, Bit_Manipulation, Game_Theory, Brainteaser | 172 | 100.00 |
0809 | Expressive Words | Medium | Array, String, Two_Pointers | 158 | 100.00 |
0808 | Soup Servings | Medium | Dynamic_Programming, Math, Probability_and_Statistics | 112 | 100.00 |
0807 | Max Increase to Keep City Skyline | Medium | Array, Greedy, Matrix | 158 | 100.00 |
0806 | Number of Lines To Write String | Easy | Array, String | 134 | 100.00 |
0805 | Split Array With Same Average | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Bitmask | 142 | 100.00 |
0804 | Unique Morse Code Words | Easy | Array, String, Hash_Table | 158 | 80.00 |
0803 | Bricks Falling When Hit | Hard | Array, Matrix, Union_Find | 742 | 100.00 |
0802 | Find Eventual Safe States | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Graph_Theory_I_Day_9_Standard_Traversal | 511 | 100.00 |
0801 | Minimum Swaps To Make Sequences Increasing | Hard | Array, Dynamic_Programming | 617 | 83.33 |
0799 | Champagne Tower | Medium | Dynamic_Programming | 153 | 100.00 |
0798 | Smallest Rotation with Highest Score | Hard | Array, Prefix_Sum | 470 | 100.00 |
0797 | All Paths From Source to Target | Medium | Depth_First_Search, Breadth_First_Search, Graph, Backtracking, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_7_Standard_Traversal | 232 | 100.00 |
0796 | Rotate String | Easy | String, String_Matching | 134 | 100.00 |
0795 | Number of Subarrays with Bounded Maximum | Medium | Array, Two_Pointers | 361 | 66.67 |
0794 | Valid Tic-Tac-Toe State | Medium | Array, String | 138 | 100.00 |
0793 | Preimage Size of Factorial Zeroes Function | Hard | Math, Binary_Search | 114 | 100.00 |
0792 | Number of Matching Subsequences | Medium | String, Hash_Table, Sorting, Trie | 346 | 100.00 |
0791 | Custom Sort String | Medium | String, Hash_Table, Sorting | 133 | 90.00 |
0790 | Domino and Tromino Tiling | Medium | Dynamic_Programming, LeetCode_75_DP/1D | 116 | 100.00 |
0789 | Escape The Ghosts | Medium | Array, Math | 187 | 100.00 |
0788 | Rotated Digits | Medium | Dynamic_Programming, Math | 137 | 80.00 |
0787 | Cheapest Flights Within K Stops | Medium | Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Heap_Priority_Queue, Graph, Shortest_Path | 185 | 99.20 |
0786 | K-th Smallest Prime Fraction | Medium | Array, Binary_Search, Heap_Priority_Queue | 165 | 100.00 |
0785 | Is Graph Bipartite? | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Graph_Theory_I_Day_14_Graph_Theory | 215 | 82.35 |
0784 | Letter Case Permutation | Medium | String, Bit_Manipulation, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking | 219 | 84.62 |
0783 | Minimum Distance Between BST Nodes | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 144 | 96.35 |
0782 | Transform to Chessboard | Hard | Array, Math, Matrix, Bit_Manipulation | 188 | 100.00 |
0781 | Rabbits in Forest | Medium | Array, Hash_Table, Math, Greedy | 132 | 100.00 |
0780 | Reaching Points | Hard | Math | 139 | 100.00 |
0779 | K-th Symbol in Grammar | Medium | Math, Bit_Manipulation, Recursion | 114 | 100.00 |
0778 | Swim in Rising Water | Hard | Array, Depth_First_Search, Breadth_First_Search, Binary_Search, Matrix, Heap_Priority_Queue, Union_Find | 190 | 100.00 |
0777 | Swap Adjacent in LR String | Medium | String, Two_Pointers | 188 | 100.00 |
0775 | Global and Local Inversions | Medium | Array, Math | 495 | 100.00 |
0773 | Sliding Puzzle | Hard | Array, Breadth_First_Search, Matrix | 166 | 100.00 |
0771 | Jewels and Stones | Easy | String, Hash_Table | 143 | 99.08 |
0770 | Basic Calculator IV | Hard | String, Hash_Table, Math, Stack, Recursion | 222 | 100.00 |
0769 | Max Chunks To Make Sorted | Medium | Array, Sorting, Greedy, Stack, Monotonic_Stack | 136 | 90.00 |
0768 | Max Chunks To Make Sorted II | Hard | Array, Sorting, Greedy, Stack, Monotonic_Stack | 202 | 100.00 |
0767 | Reorganize String | Medium | String, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Counting | 148 | 100.00 |
0766 | Toeplitz Matrix | Easy | Array, Matrix | 174 | 100.00 |
0765 | Couples Holding Hands | Hard | Depth_First_Search, Greedy, Breadth_First_Search, Graph, Union_Find | 131 | 100.00 |
0764 | Largest Plus Sign | Medium | Array, Dynamic_Programming | 415 | 100.00 |
0763 | Partition Labels | Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String, Big_O_Time_O(n)_Space_O(1) | 235 | 84.75 |
0762 | Prime Number of Set Bits in Binary Representation | Easy | Math, Bit_Manipulation | 147 | 100.00 |
0761 | Special Binary String | Hard | String, Recursion | 128 | 100.00 |
0757 | Set Intersection Size At Least Two | Hard | Array, Sorting, Greedy | 298 | 100.00 |
0756 | Pyramid Transition Matrix | Medium | Depth_First_Search, Breadth_First_Search, Bit_Manipulation | 268 | 100.00 |
0754 | Reach a Number | Medium | Math, Binary_Search | 134 | 100.00 |
0753 | Cracking the Safe | Hard | Depth_First_Search, Graph, Eulerian_Circuit | 147 | 100.00 |
0752 | Open the Lock | Medium | Array, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search | 310 | 100.00 |
0749 | Contain Virus | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Simulation | 201 | 100.00 |
0748 | Shortest Completing Word | Easy | Array, String, Hash_Table | 172 | 100.00 |
0747 | Largest Number At Least Twice of Others | Easy | Array, Sorting | 147 | 98.21 |
0746 | Min Cost Climbing Stairs | Easy | Array, Dynamic_Programming, LeetCode_75_DP/1D, Dynamic_Programming_I_Day_2, Level_1_Day_11_Dynamic_Programming | 171 | 96.76 |
0745 | Prefix and Suffix Search | Hard | String, Design, Trie, Udemy_Trie_and_Heap | 1638 | 100.00 |
0744 | Find Smallest Letter Greater Than Target | Easy | Array, Binary_Search, Binary_Search_I_Day_4 | 162 | 100.00 |
0743 | Network Delay Time | Medium | Depth_First_Search, Breadth_First_Search, Heap_Priority_Queue, Graph, Shortest_Path | 321 | 98.55 |
0741 | Cherry Pickup | Hard | Array, Dynamic_Programming, Matrix | 196 | 100.00 |
0740 | Delete and Earn | Medium | Array, Hash_Table, Dynamic_Programming, Dynamic_Programming_I_Day_3 | 192 | 100.00 |
0739 | Daily Temperatures | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n) | 936 | 80.54 |
0738 | Monotone Increasing Digits | Medium | Math, Greedy | 127 | 100.00 |
0736 | Parse Lisp Expression | Hard | String, Hash_Table, Stack, Recursion | 172 | 100.00 |
0735 | Asteroid Collision | Medium | Array, Stack, LeetCode_75_Stack, Level_2_Day_18_Stack | 243 | 100.00 |
0733 | Flood Fill | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix, Algorithm_I_Day_7_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS | 230 | 97.76 |
0732 | My Calendar III | Hard | Binary_Search, Design, Ordered_Set, Segment_Tree | 294 | 100.00 |
0731 | My Calendar II | Medium | Binary_Search, Design, Ordered_Set, Segment_Tree | 371 | 100.00 |
0730 | Count Different Palindromic Subsequences | Hard | String, Dynamic_Programming | 233 | 100.00 |
0729 | My Calendar I | Medium | Binary_Search, Design, Ordered_Set, Segment_Tree, Programming_Skills_II_Day_20 | 378 | 69.70 |
0728 | Self Dividing Numbers | Easy | Math | 142 | 100.00 |
0726 | Number of Atoms | Hard | String, Hash_Table, Sorting, Stack | 149 | 100.00 |
0725 | Split Linked List in Parts | Medium | Linked_List | 162 | 95.00 |
0724 | Find Pivot Index | Easy | Array, Prefix_Sum, LeetCode_75_Prefix_Sum, Level_1_Day_1_Prefix_Sum | 255 | 88.92 |
0722 | Remove Comments | Medium | Array, String | 164 | 100.00 |
0721 | Accounts Merge | Medium | Array, String, Depth_First_Search, Breadth_First_Search, Union_Find | 364 | 100.00 |
0720 | Longest Word in Dictionary | Medium | Array, String, Hash_Table, Sorting, Trie | 209 | 100.00 |
0719 | Find K-th Smallest Pair Distance | Hard | Array, Sorting, Binary_Search, Two_Pointers | 172 | 100.00 |
0718 | Maximum Length of Repeated Subarray | Medium | Array, Dynamic_Programming, Binary_Search, Sliding_Window, Hash_Function, Rolling_Hash | 270 | 91.43 |
0717 | 1-bit and 2-bit Characters | Easy | Array | 165 | 100.00 |
0715 | Range Module | Hard | Design, Ordered_Set, Segment_Tree | 638 | 58.33 |
0714 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | Array, Dynamic_Programming, Greedy, LeetCode_75_DP/Multidimensional, Dynamic_Programming_I_Day_8 | 417 | 90.91 |
0713 | Subarray Product Less Than K | Medium | Array, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Udemy_Arrays | 336 | 92.11 |
0712 | Minimum ASCII Delete Sum for Two Strings | Medium | String, Dynamic_Programming | 176 | 100.00 |
0710 | Random Pick with Blacklist | Hard | Hash_Table, Math, Sorting, Binary_Search, Randomized | 632 | 100.00 |
0709 | To Lower Case | Easy | String, Programming_Skills_I_Day_9_String | 142 | 98.68 |
0707 | Design Linked List | Medium | Design, Linked_List, Data_Structure_II_Day_12_Linked_List, Programming_Skills_II_Day_19, Udemy_Linked_List | 243 | 100.00 |
0706 | Design HashMap | Easy | Array, Hash_Table, Design, Linked_List, Hash_Function, Data_Structure_II_Day_2_Array | 405 | 92.11 |
0705 | Design HashSet | Easy | Array, Hash_Table, Design, Linked_List, Hash_Function | 385 | 75.61 |
0704 | Binary Search | Easy | Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_1, Level_1_Day_7_Binary_Search, Udemy_Binary_Search | 261 | 77.91 |
0703 | Kth Largest Element in a Stream | Easy | Tree, Binary_Tree, Design, Heap_Priority_Queue, Binary_Search_Tree, Data_Stream | 286 | 95.45 |
0701 | Insert into a Binary Search Tree | Medium | Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_13_Tree, Udemy_Tree_Stack_Queue | 311 | 79.03 |
0700 | Search in a Binary Search Tree | Easy | Tree, Binary_Tree, Binary_Search_Tree, LeetCode_75_Binary_Search_Tree, Data_Structure_I_Day_13_Tree | 251 | 88.31 |
0699 | Falling Squares | Hard | Array, Ordered_Set, Segment_Tree | 293 | 100.00 |
0698 | Partition to K Equal Sum Subsets | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask, Memoization | 191 | 100.00 |
0697 | Degree of an Array | Easy | Array, Hash_Table, Udemy_Arrays | 289 | 84.62 |
0696 | Count Binary Substrings | Easy | String, Two_Pointers | 222 | 100.00 |
0695 | Max Area of Island | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_I_Day_7_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_2_Matrix_Related_Problems | 181 | 93.83 |
0693 | Binary Number with Alternating Bits | Easy | Bit_Manipulation | 129 | 100.00 |
0692 | Top K Frequent Words | Medium | String, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Trie, Bucket_Sort, Level_1_Day_15_Heap | 239 | 81.10 |
0691 | Stickers to Spell Word | Hard | Array, String, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 249 | 100.00 |
0690 | Employee Importance | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search | 255 | 100.00 |
0689 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | Array, Dynamic_Programming | 248 | 100.00 |
0688 | Knight Probability in Chessboard | Medium | Dynamic_Programming | 144 | 100.00 |
0687 | Longest Univalue Path | Medium | Depth_First_Search, Tree, Binary_Tree | 303 | 100.00 |
0686 | Repeated String Match | Medium | String, String_Matching | 164 | 100.00 |
0685 | Redundant Connection II | Hard | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 176 | 100.00 |
0684 | Redundant Connection | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 181 | 88.24 |
0682 | Baseball Game | Easy | Array, Stack, Simulation | 159 | 100.00 |
0680 | Valid Palindrome II | Easy | String, Greedy, Two_Pointers | 296 | 79.17 |
0679 | 24 Game | Hard | Array, Math, Backtracking | 175 | 100.00 |
0678 | Valid Parenthesis String | Medium | String, Dynamic_Programming, Greedy, Stack | 133 | 100.00 |
0677 | Map Sum Pairs | Medium | String, Hash_Table, Design, Trie | 197 | 80.00 |
0676 | Implement Magic Dictionary | Medium | String, Hash_Table, Design, Trie | 256 | 100.00 |
0675 | Cut Off Trees for Golf Event | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue | 777 | 100.00 |
0674 | Longest Continuous Increasing Subsequence | Easy | Array | 201 | 84.21 |
0673 | Number of Longest Increasing Subsequence | Medium | Array, Dynamic_Programming, Segment_Tree, Binary_Indexed_Tree, Algorithm_II_Day_16_Dynamic_Programming | 226 | 91.67 |
0672 | Bulb Switcher II | Medium | Math, Depth_First_Search, Breadth_First_Search, Bit_Manipulation | 131 | 100.00 |
0671 | Second Minimum Node In a Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree | 128 | 100.00 |
0670 | Maximum Swap | Medium | Math, Greedy | 143 | 100.00 |
0669 | Trim a Binary Search Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 195 | 100.00 |
0668 | Kth Smallest Number in Multiplication Table | Hard | Math, Binary_Search | 151 | 100.00 |
0667 | Beautiful Arrangement II | Medium | Array, Math | 175 | 100.00 |
0665 | Non-decreasing Array | Medium | Array | 256 | 85.71 |
0664 | Strange Printer | Hard | String, Dynamic_Programming | 196 | 100.00 |
0662 | Maximum Width of Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 189 | 75.00 |
0661 | Image Smoother | Easy | Array, Matrix | 352 | 100.00 |
0659 | Split Array into Consecutive Subsequences | Medium | Array, Hash_Table, Greedy, Heap_Priority_Queue | 352 | 100.00 |
0658 | Find K Closest Elements | Medium | Array, Sorting, Binary_Search, Two_Pointers, Heap_Priority_Queue, Binary_Search_II_Day_2 | 375 | 95.16 |
0657 | Robot Return to Origin | Easy | String, Simulation | 186 | 100.00 |
0655 | Print Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 176 | 100.00 |
0654 | Maximum Binary Tree | Medium | Array, Tree, Binary_Tree, Stack, Monotonic_Stack, Divide_and_Conquer | 271 | 90.00 |
0653 | Two Sum IV - Input is a BST | Easy | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Two_Pointers, Binary_Search_Tree, Data_Structure_I_Day_14_Tree | 231 | 96.08 |
0652 | Find Duplicate Subtrees | Medium | Hash_Table, Depth_First_Search, Tree, Binary_Tree | 266 | 76.00 |
0650 | 2 Keys Keyboard | Medium | Dynamic_Programming, Math | 115 | 100.00 |
0649 | Dota2 Senate | Medium | String, Greedy, Queue, LeetCode_75_Queue | 217 | 100.00 |
0648 | Replace Words | Medium | Array, String, Hash_Table, Trie | 392 | 100.00 |
0647 | Palindromic Substrings | Medium | String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n) | 266 | 67.83 |
0646 | Maximum Length of Pair Chain | Medium | Array, Dynamic_Programming, Sorting, Greedy | 249 | 100.00 |
0645 | Set Mismatch | Easy | Array, Hash_Table, Sorting, Bit_Manipulation | 246 | 88.46 |
0643 | Maximum Average Subarray I | Easy | Array, Sliding_Window, LeetCode_75_Sliding_Window | 494 | 98.65 |
0641 | Design Circular Deque | Medium | Array, Design, Linked_List, Queue | 232 | 100.00 |
0640 | Solve the Equation | Medium | String, Math, Simulation | 170 | 66.67 |
0639 | Decode Ways II | Hard | String, Dynamic_Programming | 259 | 100.00 |
0638 | Shopping Offers | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask, Memoization | 195 | 100.00 |
0637 | Average of Levels in Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Top_Interview_150_Binary_Tree_BFS | 249 | 100.00 |
0636 | Exclusive Time of Functions | Medium | Array, Stack | 270 | 80.00 |
0633 | Sum of Square Numbers | Medium | Math, Binary_Search, Two_Pointers, Binary_Search_I_Day_10 | 126 | 100.00 |
0632 | Smallest Range Covering Elements from K Lists | Hard | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Sliding_Window | 399 | 83.33 |
0630 | Course Schedule III | Hard | Array, Greedy, Heap_Priority_Queue | 536 | 100.00 |
0629 | K Inverse Pairs Array | Hard | Dynamic_Programming | 155 | 100.00 |
0628 | Maximum Product of Three Numbers | Easy | Array, Math, Sorting | 276 | 97.30 |
0627 | Swap Salary | Easy | Database, SQL_I_Day_2_Select_and_Order | 400 | 51.04 |
0626 | Exchange Seats | Medium | Database | 502 | 50.56 |
0623 | Add One Row to Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 202 | 100.00 |
0622 | Design Circular Queue | Medium | Array, Design, Linked_List, Queue, Programming_Skills_II_Day_20 | 234 | 92.68 |
0621 | Task Scheduler | Medium | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Counting, Level_2_Day_5_Greedy | 266 | 98.36 |
0620 | Not Boring Movies | Easy | Database | 259 | 64.69 |
0619 | Biggest Single Number | Easy | Database | 656 | 90.69 |
0617 | Merge Two Binary Trees | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Algorithm_I_Day_8_Breadth_First_Search_Depth_First_Search | 243 | 72.83 |
0611 | Valid Triangle Number | Medium | Array, Sorting, Greedy, Binary_Search, Two_Pointers, Binary_Search_II_Day_1 | 203 | 100.00 |
0610 | Triangle Judgement | Easy | Database | 464 | 72.35 |
0609 | Find Duplicate File in System | Medium | Array, String, Hash_Table | 426 | 100.00 |
0608 | Tree Node | Medium | LeetCode_Curated_SQL_70, Database, SQL_I_Day_4_Union_and_Select | 794 | 48.38 |
0607 | Sales Person | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_6_Union | 2142 | 44.56 |
0606 | Construct String from Binary Tree | Medium | String, Depth_First_Search, Tree, Binary_Tree | 187 | 100.00 |
0605 | Can Place Flowers | Easy | Array, Greedy, LeetCode_75_Array/String, Udemy_Arrays | 209 | 85.71 |
0602 | Friend Requests II: Who Has the Most Friends | Medium | Database | 398 | 97.39 |
0601 | Human Traffic of Stadium | Hard | Database | 529 | 51.80 |
0600 | Non-negative Integers without Consecutive Ones | Hard | Dynamic_Programming | 142 | 100.00 |
0599 | Minimum Index Sum of Two Lists | Easy | Array, String, Hash_Table | 293 | 100.00 |
0598 | Range Addition II | Easy | Array, Math | 176 | 66.67 |
0596 | Classes More Than 5 Students | Easy | Database | 484 | 50.92 |
0595 | Big Countries | Easy | Database, SQL_I_Day_1_Select | 417 | 56.09 |
0594 | Longest Harmonious Subsequence | Easy | Array, Hash_Table, Sorting | 331 | 100.00 |
0593 | Valid Square | Medium | Math, Geometry | 161 | 83.33 |
0592 | Fraction Addition and Subtraction | Medium | String, Math, Simulation | 164 | 100.00 |
0591 | Tag Validator | Hard | String, Stack | 177 | 100.00 |
0590 | N-ary Tree Postorder Traversal | Easy | Depth_First_Search, Tree, Stack | 237 | 88.10 |
0589 | N-ary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Stack, Programming_Skills_I_Day_5_Function, Level_1_Day_6_Tree | 233 | 84.02 |
0587 | Erect the Fence | Hard | Array, Math, Geometry | 470 | 100.00 |
0586 | Customer Placing the Largest Number of Orders | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_8_Function | 768 | 44.85 |
0585 | Investments in 2016 | Medium | Database | 729 | 99.22 |
0584 | Find Customer Referee | Easy | Database, SQL_I_Day_1_Select | 779 | 43.48 |
0583 | Delete Operation for Two Strings | Medium | String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming | 197 | 100.00 |
0581 | Shortest Unsorted Continuous Subarray | Medium | Array, Sorting, Greedy, Two_Pointers, Stack, Monotonic_Stack | 246 | 100.00 |
0577 | Employee Bonus | Easy | Database | 1473 | 95.83 |
0576 | Out of Boundary Paths | Medium | Dynamic_Programming | 153 | 100.00 |
0575 | Distribute Candies | Easy | Array, Hash_Table | 538 | 76.92 |
0572 | Subtree of Another Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Hash_Function, String_Matching, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search | 214 | 92.39 |
0570 | Managers with at Least 5 Direct Reports | Medium | Database | 454 | 90.82 |
0567 | Permutation in String | Medium | String, Hash_Table, Two_Pointers, Sliding_Window, Algorithm_I_Day_6_Sliding_Window | 169 | 100.00 |
0566 | Reshape the Matrix | Easy | Array, Matrix, Simulation, Data_Structure_I_Day_4_Array, Programming_Skills_I_Day_7_Array | 239 | 99.05 |
0565 | Array Nesting | Medium | Array, Depth_First_Search | 553 | 100.00 |
0564 | Find the Closest Palindrome | Hard | String, Math | 179 | 100.00 |
0563 | Binary Tree Tilt | Easy | Depth_First_Search, Tree, Binary_Tree | 197 | 100.00 |
0561 | Array Partition | Easy | Array, Sorting, Greedy, Counting_Sort | 337 | 90.48 |
0560 | Subarray Sum Equals K | Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array, Big_O_Time_O(n)_Space_O(n) | 692 | 53.27 |
0559 | Maximum Depth of N-ary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree | 196 | 100.00 |
0558 | Logical OR of Two Binary Grids Represented as Quad-Trees | Medium | Tree, Divide_and_Conquer | 268 | 100.00 |
0557 | Reverse Words in a String III | Easy | String, Two_Pointers, Algorithm_I_Day_4_Two_Pointers | 215 | 98.10 |
0556 | Next Greater Element III | Medium | String, Math, Two_Pointers, Programming_Skills_II_Day_10 | 137 | 80.00 |
0554 | Brick Wall | Medium | Array, Hash_Table | 307 | 100.00 |
0553 | Optimal Division | Medium | Array, Dynamic_Programming, Math | 154 | 100.00 |
0552 | Student Attendance Record II | Hard | Dynamic_Programming | 151 | 100.00 |
0551 | Student Attendance Record I | Easy | String | 151 | 95.00 |
0550 | Game Play Analysis IV | Medium | Database | 762 | 97.74 |
0547 | Number of Provinces | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_8_Standard_Traversal, Level_2_Day_19_Union_Find | 229 | 79.73 |
0546 | Remove Boxes | Hard | Array, Dynamic_Programming, Memoization | 283 | 100.00 |
0543 | Diameter of Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 307 | 43.93 |
0542 | 01 Matrix | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix, Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_5_Matrix_Related_Problems | 441 | 94.06 |
0541 | Reverse String II | Easy | String, Two_Pointers | 200 | 83.33 |
0540 | Single Element in a Sorted Array | Medium | Array, Binary_Search, Binary_Search_II_Day_9 | 274 | 86.67 |
0539 | Minimum Time Difference | Medium | Array, String, Math, Sorting | 183 | 100.00 |
0538 | Convert BST to Greater Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 252 | 77.78 |
0537 | Complex Number Multiplication | Medium | String, Math, Simulation | 171 | 75.00 |
0535 | Encode and Decode TinyURL | Medium | String, Hash_Table, Design, Hash_Function | 183 | 81.25 |
0532 | K-diff Pairs in an Array | Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Udemy_Arrays | 230 | 84.62 |
0530 | Minimum Absolute Difference in BST | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Top_Interview_150_Binary_Search_Tree | 209 | 86.96 |
0529 | Minesweeper | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 243 | 87.50 |
0528 | Random Pick with Weight | Medium | Math, Binary_Search, Prefix_Sum, Randomized, Binary_Search_II_Day_13 | 393 | 91.38 |
0526 | Beautiful Arrangement | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 107 | 100.00 |
0525 | Contiguous Array | Medium | Array, Hash_Table, Prefix_Sum | 471 | 100.00 |
0524 | Longest Word in Dictionary through Deleting | Medium | Array, String, Sorting, Two_Pointers | 307 | 100.00 |
0523 | Continuous Subarray Sum | Medium | Array, Hash_Table, Math, Prefix_Sum | 682 | 95.45 |
0522 | Longest Uncommon Subsequence II | Medium | Array, String, Hash_Table, Sorting, Two_Pointers | 163 | 100.00 |
0521 | Longest Uncommon Subsequence I | Easy | String | 146 | 88.89 |
0520 | Detect Capital | Easy | String | 161 | 84.54 |
0519 | Random Flip Matrix | Medium | Hash_Table, Math, Randomized, Reservoir_Sampling | 270 | 100.00 |
0518 | Coin Change II | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_20 | 139 | 100.00 |
0517 | Super Washing Machines | Hard | Array, Greedy | 210 | 100.00 |
0516 | Longest Palindromic Subsequence | Medium | String, Dynamic_Programming, Dynamic_Programming_I_Day_17 | 243 | 87.50 |
0515 | Find Largest Value in Each Tree Row | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 238 | 73.33 |
0514 | Freedom Trail | Hard | String, Dynamic_Programming, Depth_First_Search, Breadth_First_Search | 182 | 100.00 |
0513 | Find Bottom Left Tree Value | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 190 | 88.24 |
0511 | Game Play Analysis I | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_8_Function | 790 | 45.04 |
0509 | Fibonacci Number | Easy | Dynamic_Programming, Math, Recursion, Memoization, Dynamic_Programming_I_Day_1, Level_1_Day_10_Dynamic_Programming, Udemy_Dynamic_Programming | 139 | 82.72 |
0508 | Most Frequent Subtree Sum | Medium | Hash_Table, Depth_First_Search, Tree, Binary_Tree | 246 | 80.00 |
0507 | Perfect Number | Easy | Math | 172 | 81.82 |
0506 | Relative Ranks | Easy | Array, Sorting, Heap_Priority_Queue | 244 | 94.23 |
0504 | Base 7 | Easy | Math | 136 | 100.00 |
0503 | Next Greater Element II | Medium | Array, Stack, Monotonic_Stack, Programming_Skills_II_Day_10 | 331 | 92.68 |
0502 | IPO | Hard | Array, Sorting, Greedy, Heap_Priority_Queue, Top_Interview_150_Heap | 799 | 54.55 |
0501 | Find Mode in Binary Search Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 235 | 86.67 |
0500 | Keyboard Row | Easy | Array, String, Hash_Table | 170 | 85.19 |
0498 | Diagonal Traverse | Medium | Array, Matrix, Simulation | 430 | 61.54 |
0497 | Random Point in Non-overlapping Rectangles | Medium | Math, Binary_Search, Prefix_Sum, Ordered_Set, Randomized, Reservoir_Sampling | 759 | 100.00 |
0496 | Next Greater Element I | Easy | Array, Hash_Table, Stack, Monotonic_Stack, Programming_Skills_I_Day_5_Function | 171 | 100.00 |
0495 | Teemo Attacking | Easy | Array, Simulation | 283 | 100.00 |
0494 | Target Sum | Medium | Array, Dynamic_Programming, Backtracking, Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) | 308 | 89.61 |
0493 | Reverse Pairs | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 887 | 66.67 |
0492 | Construct the Rectangle | Easy | Math | 202 | 88.89 |
0491 | Non-decreasing Subsequences | Medium | Array, Hash_Table, Bit_Manipulation, Backtracking | 499 | 100.00 |
0488 | Zuma Game | Hard | String, Dynamic_Programming, Breadth_First_Search, Memoization | 1727 | 100.00 |
0486 | Predict the Winner | Medium | Array, Dynamic_Programming, Math, Recursion, Game_Theory | 158 | 84.62 |
0485 | Max Consecutive Ones | Easy | Array | 272 | 88.46 |
0483 | Smallest Good Base | Hard | Math, Binary_Search | 164 | 100.00 |
0482 | License Key Formatting | Easy | String | 234 | 87.18 |
0481 | Magical String | Medium | String, Two_Pointers | 124 | 100.00 |
0480 | Sliding Window Median | Hard | Array, Hash_Table, Heap_Priority_Queue, Sliding_Window | 409 | 100.00 |
0479 | Largest Palindrome Product | Hard | Math | 147 | 100.00 |
0478 | Generate Random Point in a Circle | Medium | Math, Geometry, Randomized, Rejection_Sampling | 862 | 100.00 |
0477 | Total Hamming Distance | Medium | Array, Math, Bit_Manipulation | 298 | 100.00 |
0476 | Number Complement | Easy | Bit_Manipulation | 133 | 100.00 |
0475 | Heaters | Medium | Array, Sorting, Binary_Search, Two_Pointers | 356 | 87.50 |
0474 | Ones and Zeroes | Medium | Array, String, Dynamic_Programming | 204 | 100.00 |
0473 | Matchsticks to Square | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 255 | 100.00 |
0472 | Concatenated Words | Hard | Array, String, Dynamic_Programming, Depth_First_Search, Trie | 484 | 100.00 |
0470 | Implement Rand10() Using Rand7() | Medium | Math, Randomized, Probability_and_Statistics, Rejection_Sampling | 220 | 100.00 |
0468 | Validate IP Address | Medium | String | 192 | 62.50 |
0467 | Unique Substrings in Wraparound String | Medium | String, Dynamic_Programming | 197 | 100.00 |
0466 | Count The Repetitions | Hard | String, Dynamic_Programming | 147 | 100.00 |
0464 | Can I Win | Medium | Dynamic_Programming, Math, Bit_Manipulation, Bitmask, Memoization, Game_Theory | 213 | 100.00 |
0463 | Island Perimeter | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 381 | 98.04 |
0462 | Minimum Moves to Equal Array Elements II | Medium | Array, Math, Sorting | 210 | 100.00 |
0461 | Hamming Distance | Easy | Bit_Manipulation, Udemy_Bit_Manipulation | 150 | 96.15 |
0460 | LFU Cache | Hard | Hash_Table, Design, Linked_List, Doubly_Linked_List | 1143 | 100.00 |
0459 | Repeated Substring Pattern | Easy | String, String_Matching, Programming_Skills_II_Day_2 | 201 | 100.00 |
0458 | Poor Pigs | Hard | Dynamic_Programming, Math, Combinatorics | 133 | 80.00 |
0457 | Circular Array Loop | Medium | Array, Hash_Table, Two_Pointers | 143 | 100.00 |
0456 | 132 Pattern | Medium | Array, Binary_Search, Stack, Ordered_Set, Monotonic_Stack, Udemy_Arrays | 434 | 100.00 |
0455 | Assign Cookies | Easy | Array, Sorting, Greedy | 260 | 96.67 |
0454 | 4Sum II | Medium | Array, Hash_Table | 660 | 85.71 |
0453 | Minimum Moves to Equal Array Elements | Medium | Array, Math | 282 | 100.00 |
0452 | Minimum Number of Arrows to Burst Balloons | Medium | Array, Sorting, Greedy, LeetCode_75_Intervals, Top_Interview_150_Intervals | 934 | 100.00 |
0451 | Sort Characters By Frequency | Medium | String, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Bucket_Sort, Data_Structure_II_Day_21_Heap_Priority_Queue | 288 | 81.72 |
0450 | Delete Node in a BST | Medium | Tree, Binary_Tree, Binary_Search_Tree, LeetCode_75_Binary_Search_Tree, Data_Structure_II_Day_16_Tree | 257 | 84.62 |
0449 | Serialize and Deserialize BST | Medium | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design, Binary_Search_Tree | 233 | 100.00 |
0448 | Find All Numbers Disappeared in an Array | Easy | Array, Hash_Table, Udemy_Arrays | 394 | 100.00 |
0447 | Number of Boomerangs | Medium | Array, Hash_Table, Math | 308 | 100.00 |
0446 | Arithmetic Slices II - Subsequence | Hard | Array, Dynamic_Programming | 312 | 100.00 |
0445 | Add Two Numbers II | Medium | Math, Stack, Linked_List, Programming_Skills_II_Day_15, Udemy_Linked_List | 240 | 82.61 |
0443 | String Compression | Medium | String, Two_Pointers, LeetCode_75_Array/String | 198 | 92.68 |
0442 | Find All Duplicates in an Array | Medium | Array, Hash_Table, Udemy_Arrays | 480 | 73.81 |
0441 | Arranging Coins | Easy | Math, Binary_Search, Binary_Search_I_Day_6 | 150 | 84.21 |
0440 | K-th Smallest in Lexicographical Order | Hard | Trie | 149 | 100.00 |
0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer, Big_O_Time_O(n+m)_Space_O(1) | 561 | 54.68 |
0437 | Path Sum III | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n) | 403 | 54.12 |
0436 | Find Right Interval | Medium | Array, Sorting, Binary_Search, Binary_Search_II_Day_11 | 333 | 100.00 |
0435 | Non-overlapping Intervals | Medium | Array, Dynamic_Programming, Sorting, Greedy, LeetCode_75_Intervals, Data_Structure_II_Day_4_Array | 1040 | 85.07 |
0434 | Number of Segments in a String | Easy | String | 167 | 80.00 |
0433 | Minimum Genetic Mutation | Medium | String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search, Top_Interview_150_Graph_BFS | 204 | 82.08 |
0432 | All O`one Data Structure | Hard | Hash_Table, Design, Linked_List, Doubly_Linked_List | 1200 | 100.00 |
0430 | Flatten a Multilevel Doubly Linked List | Medium | Depth_First_Search, Linked_List, Doubly_Linked_List | 194 | 97.44 |
0429 | N-ary Tree Level Order Traversal | Medium | Breadth_First_Search, Tree, Programming_Skills_II_Day_9 | 248 | 75.86 |
0427 | Construct Quad Tree | Medium | Array, Tree, Matrix, Divide_and_Conquer, Top_Interview_150_Divide_and_Conquer | 221 | 94.74 |
0424 | Longest Repeating Character Replacement | Medium | String, Hash_Table, Sliding_Window, Level_1_Day_12_Sliding_Window/Two_Pointer | 288 | 84.38 |
0423 | Reconstruct Original Digits from English | Medium | String, Hash_Table, Math | 349 | 100.00 |
0421 | Maximum XOR of Two Numbers in an Array | Medium | Array, Hash_Table, Bit_Manipulation, Trie | 710 | 100.00 |
0420 | Strong Password Checker | Hard | String, Greedy, Heap_Priority_Queue | 157 | 80.00 |
0419 | Battleships in a Board | Medium | Array, Depth_First_Search, Matrix | 273 | 76.92 |
0417 | Pacific Atlantic Water Flow | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Graph_Theory_I_Day_4_Matrix_Related_Problems, Level_2_Day_10_Graph/BFS/DFS, Udemy_Graph | 319 | 100.00 |
0416 | Partition Equal Subset Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming, Big_O_Time_O(n*sums)_Space_O(n*sums) | 204 | 98.82 |
0415 | Add Strings | Easy | String, Math, Simulation, Data_Structure_II_Day_6_String | 296 | 76.00 |
0414 | Third Maximum Number | Easy | Array, Sorting | 317 | 73.00 |
0413 | Arithmetic Slices | Medium | Array, Dynamic_Programming, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_10 | 156 | 100.00 |
0412 | Fizz Buzz | Easy | String, Math, Simulation, Udemy_Integers | 307 | 71.81 |
0410 | Split Array Largest Sum | Hard | Array, Dynamic_Programming, Greedy, Binary_Search | 165 | 100.00 |
0409 | Longest Palindrome | Easy | String, Hash_Table, Greedy, Data_Structure_II_Day_6_String, Level_1_Day_5_Greedy | 259 | 60.71 |
0407 | Trapping Rain Water II | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue | 500 | 100.00 |
0406 | Queue Reconstruction by Height | Medium | Array, Sorting, Greedy, Segment_Tree, Binary_Indexed_Tree | 306 | 100.00 |
0405 | Convert a Number to Hexadecimal | Easy | Math, Bit_Manipulation | 132 | 100.00 |
0404 | Sum of Left Leaves | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree | 173 | 86.05 |
0403 | Frog Jump | Hard | Array, Dynamic_Programming | 240 | 100.00 |
0402 | Remove K Digits | Medium | String, Greedy, Stack, Monotonic_Stack | 375 | 75.00 |
0401 | Binary Watch | Easy | Bit_Manipulation, Backtracking | 266 | 71.43 |
0400 | Nth Digit | Medium | Math, Binary_Search | 271 | 50.00 |
0399 | Evaluate Division | Medium | Array, Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Shortest_Path, LeetCode_75_Graphs/DFS, Top_Interview_150_Graph_General | 183 | 91.49 |
0398 | Random Pick Index | Medium | Hash_Table, Math, Randomized, Reservoir_Sampling | 1091 | 75.00 |
0397 | Integer Replacement | Medium | Dynamic_Programming, Greedy, Bit_Manipulation, Memoization | 145 | 87.50 |
0396 | Rotate Function | Medium | Array, Dynamic_Programming, Math | 571 | 87.50 |
0395 | Longest Substring with At Least K Repeating Characters | Medium | String, Hash_Table, Sliding_Window, Divide_and_Conquer | 274 | 66.67 |
0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 224 | 64.86 |
0393 | UTF-8 Validation | Medium | Array, Bit_Manipulation | 219 | 100.00 |
0392 | Is Subsequence | Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers, Dynamic_Programming_I_Day_19, Level_1_Day_2_String, Udemy_Two_Pointers, Top_Interview_150_Two_Pointers | 156 | 87.74 |
0391 | Perfect Rectangle | Hard | Array, Line_Sweep | 897 | 100.00 |
0390 | Elimination Game | Medium | Math, Recursion | 319 | 55.56 |
0389 | Find the Difference | Easy | String, Hash_Table, Sorting, Bit_Manipulation, Programming_Skills_I_Day_8_String, Udemy_Bit_Manipulation | 256 | 64.81 |
0388 | Longest Absolute File Path | Medium | String, Depth_First_Search, Stack | 150 | 100.00 |
0387 | First Unique Character in a String | Easy | String, Hash_Table, Counting, Queue, Data_Structure_I_Day_6_String | 369 | 82.68 |
0386 | Lexicographical Numbers | Medium | Depth_First_Search, Trie | 463 | 83.33 |
0385 | Mini Parser | Medium | String, Depth_First_Search, Stack | 210 | 100.00 |
0384 | Shuffle an Array | Medium | Array, Math, Randomized, Algorithm_II_Day_20_Others | 940 | 72.09 |
0383 | Ransom Note | Easy | String, Hash_Table, Counting, Data_Structure_I_Day_6_String, Top_Interview_150_Hashmap | 333 | 79.58 |
0382 | Linked List Random Node | Medium | Math, Linked_List, Randomized, Reservoir_Sampling | 283 | 100.00 |
0381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | Array, Hash_Table, Math, Design, Randomized | 1313 | 50.00 |
0380 | Insert Delete GetRandom O(1) | Medium | Array, Hash_Table, Math, Design, Randomized, Programming_Skills_II_Day_20, Top_Interview_150_Array/String | 1326 | 68.23 |
0378 | Kth Smallest Element in a Sorted Matrix | Medium | Array, Sorting, Binary_Search, Matrix, Heap_Priority_Queue | 522 | 59.78 |
0377 | Combination Sum IV | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_21 | 217 | 72.41 |
0376 | Wiggle Subsequence | Medium | Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_18 | 162 | 88.89 |
0375 | Guess Number Higher or Lower II | Medium | Dynamic_Programming, Math, Game_Theory | 235 | 75.00 |
0374 | Guess Number Higher or Lower | Easy | Binary_Search, Interactive, LeetCode_75_Binary_Search, Binary_Search_I_Day_1 | 134 | 94.19 |
0373 | Find K Pairs with Smallest Sums | Medium | Array, Heap_Priority_Queue, Top_Interview_150_Heap | 1809 | 80.95 |
0372 | Super Pow | Medium | Math, Divide_and_Conquer | 196 | 100.00 |
0371 | Sum of Two Integers | Medium | Math, Bit_Manipulation, Udemy_Bit_Manipulation | 129 | 95.45 |
0368 | Largest Divisible Subset | Medium | Array, Dynamic_Programming, Math, Sorting | 412 | 73.33 |
0367 | Valid Perfect Square | Easy | Math, Binary_Search, Binary_Search_I_Day_3 | 137 | 94.55 |
0365 | Water and Jug Problem | Medium | Math, Depth_First_Search, Breadth_First_Search, Graph_Theory_I_Day_11_Breadth_First_Search | 130 | 100.00 |
0363 | Max Sum of Rectangle No Larger Than K | Hard | Array, Dynamic_Programming, Binary_Search, Matrix, Ordered_Set | 243 | 100.00 |
0357 | Count Numbers with Unique Digits | Medium | Dynamic_Programming, Math, Backtracking | 104 | 100.00 |
0355 | Design Twitter | Medium | Hash_Table, Design, Heap_Priority_Queue, Linked_List | 288 | 68.75 |
0354 | Russian Doll Envelopes | Hard | Array, Dynamic_Programming, Sorting, Binary_Search | 788 | 100.00 |
0352 | Data Stream as Disjoint Intervals | Hard | Binary_Search, Design, Ordered_Set | 905 | 75.00 |
0350 | Intersection of Two Arrays II | Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Data_Structure_I_Day_3_Array, Binary_Search_I_Day_10 | 321 | 73.37 |
0349 | Intersection of Two Arrays | Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 346 | 66.99 |
0347 | Top K Frequent Elements | Medium | Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Data_Structure_II_Day_20_Heap_Priority_Queue, Big_O_Time_O(n*log(n))_Space_O(k) | 268 | 99.74 |
0345 | Reverse Vowels of a String | Easy | String, Two_Pointers, LeetCode_75_Array/String | 349 | 80.63 |
0344 | Reverse String | Easy | String, Two_Pointers, Recursion, Algorithm_I_Day_4_Two_Pointers, Udemy_Strings | 445 | 69.75 |
0343 | Integer Break | Medium | Dynamic_Programming, Math, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_21 | 218 | 63.89 |
0342 | Power of Four | Easy | Math, Bit_Manipulation, Recursion | 150 | 92.11 |
0341 | Flatten Nested List Iterator | Medium | Depth_First_Search, Tree, Stack, Design, Queue, Iterator, Programming_Skills_II_Day_18 | 210 | 100.00 |
0338 | Counting Bits | Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Udemy_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 186 | 99.26 |
0337 | House Robber III | Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue | 282 | 84.62 |
0336 | Palindrome Pairs | Hard | Array, String, Hash_Table, Trie | 2451 | 67.33 |
0335 | Self Crossing | Hard | Array, Math, Geometry | 477 | 100.00 |
0334 | Increasing Triplet Subsequence | Medium | Array, Greedy, LeetCode_75_Array/String, Data_Structure_II_Day_5_Array | 672 | 60.61 |
0332 | Reconstruct Itinerary | Hard | Depth_First_Search, Graph, Eulerian_Circuit | 240 | 93.88 |
0331 | Verify Preorder Serialization of a Binary Tree | Medium | String, Tree, Binary_Tree, Stack | 335 | 70.00 |
0330 | Patching Array | Hard | Array, Greedy | 201 | 100.00 |
0329 | Longest Increasing Path in a Matrix | Hard | Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Graph, Memoization, Topological_Sort | 322 | 92.65 |
0328 | Odd Even Linked List | Medium | Linked_List, LeetCode_75_LinkedList, Level_2_Day_4_Linked_List, Udemy_Linked_List | 216 | 86.96 |
0327 | Count of Range Sum | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 638 | 100.00 |
0326 | Power of Three | Easy | Math, Recursion | 413 | 76.12 |
0324 | Wiggle Sort II | Medium | Array, Sorting, Divide_and_Conquer, Quickselect | 545 | 57.14 |
0322 | Coin Change | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_20, Level_2_Day_12_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(m*n)_Space_O(amount) | 332 | 50.68 |
0321 | Create Maximum Number | Hard | Greedy, Stack, Monotonic_Stack | 209 | 100.00 |
0319 | Bulb Switcher | Medium | Math, Brainteaser | 214 | 77.78 |
0318 | Maximum Product of Word Lengths | Medium | Array, String, Bit_Manipulation | 477 | 100.00 |
0316 | Remove Duplicate Letters | Medium | String, Greedy, Stack, Monotonic_Stack | 291 | 81.82 |
0315 | Count of Smaller Numbers After Self | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 1282 | 88.46 |
0313 | Super Ugly Number | Medium | Array, Dynamic_Programming, Math | 330 | 100.00 |
0312 | Burst Balloons | Hard | Array, Dynamic_Programming | 210 | 100.00 |
0310 | Minimum Height Trees | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 521 | 97.56 |
0309 | Best Time to Buy and Sell Stock with Cooldown | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_8 | 272 | 73.33 |
0307 | Range Sum Query - Mutable | Medium | Array, Design, Segment_Tree, Binary_Indexed_Tree | 1729 | 78.79 |
0306 | Additive Number | Medium | String, Backtracking | 261 | 63.16 |
0304 | Range Sum Query 2D - Immutable | Medium | Array, Matrix, Design, Prefix_Sum, Dynamic_Programming_I_Day_14, Programming_Skills_II_Day_13, Udemy_2D_Arrays/Matrix | 1373 | 85.71 |
0303 | Range Sum Query - Immutable | Easy | Array, Design, Prefix_Sum, Programming_Skills_I_Day_12_Class_and_Object | 472 | 63.64 |
0301 | Remove Invalid Parentheses | Hard | String, Breadth_First_Search, Backtracking | 312 | 100.00 |
0300 | Longest Increasing Subsequence | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Algorithm_II_Day_16_Dynamic_Programming, Binary_Search_II_Day_3, Dynamic_Programming_I_Day_18, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n*log_n)_Space_O(n) | 318 | 82.28 |
0299 | Bulls and Cows | Medium | String, Hash_Table, Counting, Level_1_Day_13_Hashmap | 254 | 84.82 |
0297 | Serialize and Deserialize Binary Tree | Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue | 475 | 78.85 |
0295 | Find Median from Data Stream | Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Top_Interview_150_Heap, Big_O_Time_O(n*log_n)_Space_O(n) | 2289 | 33.60 |
0292 | Nim Game | Easy | Math, Game_Theory, Brainteaser | 129 | 94.29 |
0290 | Word Pattern | Easy | String, Hash_Table, Data_Structure_II_Day_7_String, Top_Interview_150_Hashmap | 177 | 89.55 |
0289 | Game of Life | Medium | Array, Matrix, Simulation, Top_Interview_150_Matrix | 174 | 96.97 |
0287 | Find the Duplicate Number | Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Binary_Search_II_Day_5, Big_O_Time_O(n)_Space_O(n) | 656 | 66.21 |
0284 | Peeking Iterator | Medium | Array, Design, Iterator | 286 | 62.50 |
0283 | Move Zeroes | Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07 |
0282 | Expression Add Operators | Hard | String, Math, Backtracking | 367 | 85.71 |
0279 | Perfect Squares | Medium | Top_100_Liked_Questions, Dynamic_Programming, Math, Breadth_First_Search, Dynamic_Programming_I_Day_21 | 176 | 98.80 |
0278 | First Bad Version | Easy | Binary_Search, Interactive, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_5, Level_1_Day_7_Binary_Search | 349 | 76.86 |
0275 | H-Index II | Medium | Array, Binary_Search, Binary_Search_II_Day_8 | 398 | 81.82 |
0274 | H-Index | Medium | Array, Sorting, Counting_Sort, Top_Interview_150_Array/String | 291 | 45.45 |
0273 | Integer to English Words | Hard | String, Math, Recursion, Udemy_Strings | 273 | 82.93 |
0268 | Missing Number | Easy | Array, Hash_Table, Math, Sorting, Binary_Search, Bit_Manipulation | 380 | 83.49 |
0264 | Ugly Number II | Medium | Hash_Table, Dynamic_Programming, Math, Heap_Priority_Queue, Dynamic_Programming_I_Day_11 | 182 | 95.45 |
0263 | Ugly Number | Easy | Math | 243 | 64.10 |
0262 | Trips and Users | Hard | Database | 577 | 63.97 |
0260 | Single Number III | Medium | Array, Bit_Manipulation | 222 | 100.00 |
0258 | Add Digits | Easy | Math, Simulation, Number_Theory | 234 | 71.64 |
0257 | Binary Tree Paths | Easy | String, Depth_First_Search, Tree, Binary_Tree, Backtracking | 320 | 72.84 |
0242 | Valid Anagram | Easy | String, Hash_Table, Sorting, Data_Structure_I_Day_6_String, Programming_Skills_I_Day_11_Containers_and_Libraries, Udemy_Strings, Top_Interview_150_Hashmap | 251 | 87.65 |
0241 | Different Ways to Add Parentheses | Medium | String, Dynamic_Programming, Math, Recursion, Memoization | 294 | 73.47 |
0240 | Search a 2D Matrix II | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Data_Structure_II_Day_4_Array, Binary_Search_II_Day_8, Big_O_Time_O(n+m)_Space_O(1) | 460 | 66.08 |
0239 | Sliding Window Maximum | Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Udemy_Arrays, Big_O_Time_O(n*k)_Space_O(n+k) | 1059 | 86.14 |
0238 | Product of Array Except Self | Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Data_Structure_II_Day_5_Array, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 |
0237 | Delete Node in a Linked List | Medium | Linked_List | 183 | 93.00 |
0236 | Lowest Common Ancestor of a Binary Tree | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 |
0235 | Lowest Common Ancestor of a Binary Search Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree | 404 | 75.59 |
0234 | Palindrome Linked List | Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Level_2_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1) | 641 | 79.53 |
0233 | Number of Digit One | Hard | Dynamic_Programming, Math, Recursion | 129 | 100.00 |
0232 | Implement Queue using Stacks | Easy | Stack, Design, Queue, Data_Structure_I_Day_9_Stack_Queue, Programming_Skills_I_Day_11_Containers_and_Libraries, Level_2_Day_16_Design | 258 | 70.86 |
0231 | Power of Two | Easy | Math, Bit_Manipulation, Recursion, Algorithm_I_Day_13_Bit_Manipulation | 161 | 86.81 |
0230 | Kth Smallest Element in a BST | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree, Level_2_Day_9_Binary_Search_Tree, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 393 | 33.33 |
0229 | Majority Element II | Medium | Array, Hash_Table, Sorting, Counting | 408 | 71.21 |
0228 | Summary Ranges | Easy | Array, Top_Interview_150_Intervals | 169 | 91.89 |
0227 | Basic Calculator II | Medium | String, Math, Stack, Level_2_Day_18_Stack | 383 | 62.50 |
0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 233 | 54.90 |
0225 | Implement Stack using Queues | Easy | Stack, Design, Queue | 147 | 88.57 |
0224 | Basic Calculator | Hard | String, Math, Stack, Recursion, Top_Interview_150_Stack | 294 | 93.33 |
0223 | Rectangle Area | Medium | Math, Geometry | 291 | 66.67 |
0222 | Count Complete Tree Nodes | Easy | Depth_First_Search, Tree, Binary_Search, Binary_Tree, Binary_Search_II_Day_10, Top_Interview_150_Binary_Tree_General | 0 | 100.00 |
0221 | Maximal Square | Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m*n)_Space_O(m*n) | 614 | 44.00 |
0220 | Contains Duplicate III | Hard | Array, Sorting, Sliding_Window, Ordered_Set, Bucket_Sort | 921 | 72.22 |
0219 | Contains Duplicate II | Easy | Array, Hash_Table, Sliding_Window, Top_Interview_150_Hashmap | 813 | 80.46 |
0218 | The Skyline Problem | Hard | Array, Heap_Priority_Queue, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Line_Sweep | 50 | 100.00 |
0217 | Contains Duplicate | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Data_Structure_I_Day_1_Array, Programming_Skills_I_Day_11_Containers_and_Libraries, Udemy_Arrays | 719 | 73.49 |
0216 | Combination Sum III | Medium | Array, Backtracking, LeetCode_75_Backtracking, Udemy_Backtracking/Recursion | 175 | 90.91 |
0215 | Kth Largest Element in an Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Data_Structure_II_Day_20_Heap_Priority_Queue, Top_Interview_150_Heap, Big_O_Time_O(n*log(n))_Space_O(log(n)) | 839 | 34.43 |
0214 | Shortest Palindrome | Hard | String, Hash_Function, String_Matching, Rolling_Hash | 278 | 100.00 |
0213 | House Robber II | Medium | Array, Dynamic_Programming, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Udemy_Dynamic_Programming | 257 | 59.62 |
0212 | Word Search II | Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie, Top_Interview_150_Trie | 268 | 100.00 |
0211 | Design Add and Search Words Data Structure | Medium | String, Depth_First_Search, Design, Trie, Top_Interview_150_Trie | 2256 | 87.04 |
0210 | Course Schedule II | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Level_2_Day_11_Graph/BFS/DFS, Top_Interview_150_Graph_General | 266 | 96.32 |
0209 | Minimum Size Subarray Sum | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Binary_Search_II_Day_1, Top_Interview_150_Sliding_Window | 315 | 96.73 |
0208 | Implement Trie (Prefix Tree) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Top_Interview_150_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00 |
0207 | Course Schedule | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Top_Interview_150_Graph_General, Big_O_Time_O(N)_Space_O(N) | 183 | 92.07 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 |
0205 | Isomorphic Strings | Easy | String, Hash_Table, Level_1_Day_2_String, Top_Interview_150_Hashmap | 278 | 79.96 |
0204 | Count Primes | Medium | Top_Interview_Questions, Array, Math, Enumeration, Number_Theory | 360 | 96.61 |
0203 | Remove Linked List Elements | Easy | Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List | 233 | 91.22 |
0202 | Happy Number | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop, Level_2_Day_1_Implementation/Simulation, Top_Interview_150_Hashmap | 261 | 45.08 |
0201 | Bitwise AND of Numbers Range | Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation, Top_Interview_150_Bit_Manipulation | 368 | 80.00 |
0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph, Top_Interview_150_Graph_General, Big_O_Time_O(M*N)_Space_O(M*N) | 252 | 95.41 |
0199 | Binary Tree Right Side View | Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS, Data_Structure_II_Day_16_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_BFS | 194 | 92.89 |
0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 |
0197 | Rising Temperature | Easy | Database, SQL_I_Day_6_Union | 394 | 94.15 |
0196 | Delete Duplicate Emails | Easy | Database, SQL_I_Day_2_Select_and_Order | 593 | 94.17 |
0195 | Tenth Line | Easy | Shell | 36 | 87.50 |
0194 | Transpose File | Medium | Shell | 61 | 88.19 |
0193 | Valid Phone Numbers | Easy | Shell | 98 | 88.64 |
0192 | Word Frequency | Medium | Shell | 96 | 80.40 |
0191 | Number of 1 Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator, Udemy_Bit_Manipulation, Top_Interview_150_Bit_Manipulation | 237 | 68.44 |
0190 | Reverse Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Bit_Manipulation, Top_Interview_150_Bit_Manipulation | 198 | 81.82 |
0189 | Rotate Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 483 | 86.95 |
0188 | Best Time to Buy and Sell Stock IV | Hard | Array, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 293 | 68.31 |
0187 | Repeated DNA Sequences | Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash, Data_Structure_II_Day_9_String, Udemy_Strings | 319 | 79.03 |
0185 | Department Top Three Salaries | Hard | Database | 757 | 87.06 |
0184 | Department Highest Salary | Medium | Database | 637 | 76.01 |
0183 | Customers Who Never Order | Easy | Database, SQL_I_Day_1_Select | 712 | 33.67 |
0182 | Duplicate Emails | Easy | Database, SQL_I_Day_10_Where | 396 | 68.40 |
0181 | Employees Earning More Than Their Managers | Easy | Database | 351 | 94.75 |
0180 | Consecutive Numbers | Medium | Database | 695 | 38.05 |
0179 | Largest Number | Medium | Top_Interview_Questions, String, Sorting, Greedy | 187 | 100.00 |
0178 | Rank Scores | Medium | Database | 292 | 85.14 |
0177 | Nth Highest Salary | Medium | Database | 338 | 86.68 |
0176 | Second Highest Salary | Medium | Database, SQL_I_Day_4_Union_and_Select | 219 | 92.54 |
0175 | Combine Two Tables | Easy | Database, SQL_I_Day_5_Union | 473 | 54.97 |
0174 | Dungeon Game | Hard | Array, Dynamic_Programming, Matrix | 300 | 66.67 |
0173 | Binary Search Tree Iterator | Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator, Data_Structure_II_Day_17_Tree, Programming_Skills_II_Day_16, Level_2_Day_9_Binary_Search_Tree, Top_Interview_150_Binary_Tree_General | 563 | 46.91 |
0172 | Factorial Trailing Zeroes | Medium | Top_Interview_Questions, Math, Udemy_Integers, Top_Interview_150_Math | 220 | 67.65 |
0171 | Excel Sheet Column Number | Easy | Top_Interview_Questions, String, Math | 310 | 30.68 |
0169 | Majority Element | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Data_Structure_II_Day_1_Array, Udemy_Famous_Algorithm, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 460 | 51.25 |
0168 | Excel Sheet Column Title | Easy | String, Math | 208 | 66.07 |
0167 | Two Sum II - Input Array Is Sorted | Medium | Array, Binary_Search, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Binary_Search_I_Day_7, Top_Interview_150_Two_Pointers | 403 | 68.74 |
0166 | Fraction to Recurring Decimal | Medium | Top_Interview_Questions, String, Hash_Table, Math | 147 | 90.91 |
0165 | Compare Version Numbers | Medium | String, Two_Pointers | 144 | 100.00 |
0164 | Maximum Gap | Medium | Array, Sorting, Bucket_Sort, Radix_Sort | 991 | 68.00 |
0162 | Find Peak Element | Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_II_Day_12, Top_Interview_150_Binary_Search | 297 | 53.85 |
0160 | Intersection of Two Linked Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Udemy_Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 262 | 83.50 |
0155 | Min Stack | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18, Level_2_Day_16_Design, Udemy_Design, Top_Interview_150_Stack, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88 |
0154 | Find Minimum in Rotated Sorted Array II | Hard | Array, Binary_Search, Binary_Search_II_Day_13 | 275 | 84.00 |
0153 | Find Minimum in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search, Top_Interview_150_Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 262 | 60.96 |
0152 | Maximum Product Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Dynamic_Programming_I_Day_6, Level_2_Day_13_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 253 | 88.42 |
0151 | Reverse Words in a String | Medium | String, Two_Pointers, LeetCode_75_Array/String, Udemy_Strings, Top_Interview_150_Array/String | 206 | 98.90 |
0150 | Evaluate Reverse Polish Notation | Medium | Top_Interview_Questions, Array, Math, Stack, Programming_Skills_II_Day_3, Top_Interview_150_Stack | 233 | 88.82 |
0149 | Max Points on a Line | Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry, Algorithm_II_Day_21_Others, Top_Interview_150_Math | 307 | 83.33 |
0148 | Sort List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Level_2_Day_4_Linked_List, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(log(N))_Space_O(log(N)) | 820 | 61.70 |
0147 | Insertion Sort List | Medium | Sorting, Linked_List | 385 | 52.00 |
0146 | LRU Cache | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 1116 | 97.93 |
0145 | Binary Tree Postorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue | 211 | 80.00 |
0144 | Binary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue | 277 | 37.90 |
0143 | Reorder List | Medium | Two_Pointers, Stack, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Programming_Skills_II_Day_14 | 395 | 82.26 |
0142 | Linked List Cycle II | Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 192 | 63.39 |
0141 | Linked List Cycle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(1) | 223 | 91.85 |
0140 | Word Break II | Hard | Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Backtracking, Trie, Memoization | 287 | 44.19 |
0139 | Word Break | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(M+max*N)_Space_O(M+N+max) | 197 | 87.17 |
0138 | Copy List with Random Pointer | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Programming_Skills_II_Day_14, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(N) | 123 | 90.70 |
0137 | Single Number II | Medium | Array, Bit_Manipulation, Top_Interview_150_Bit_Manipulation | 344 | 64.29 |
0136 | Single Number | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Top_Interview_150_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 |
0135 | Candy | Hard | Array, Greedy, Top_Interview_150_Array/String | 466 | 58.33 |
0134 | Gas Station | Medium | Top_Interview_Questions, Array, Greedy, Top_Interview_150_Array/String | 545 | 70.18 |
0133 | Clone Graph | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph, Udemy_Graph, Top_Interview_150_Graph_General | 351 | 60.91 |
0132 | Palindrome Partitioning II | Hard | String, Dynamic_Programming | 290 | 100.00 |
0131 | Palindrome Partitioning | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(N*2^N)_Space_O(2^N*N) | 820 | 87.27 |
0130 | Surrounded Regions | Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search, Top_Interview_150_Graph_General | 355 | 84.42 |
0129 | Sum Root to Leaf Numbers | Medium | Depth_First_Search, Tree, Binary_Tree, Top_Interview_150_Binary_Tree_General | 237 | 52.50 |
0128 | Longest Consecutive Sequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Top_Interview_150_Hashmap, Big_O_Time_O(N_log_N)_Space_O(1) | 460 | 97.77 |
0127 | Word Ladder | Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search, Top_Interview_150_Graph_BFS | 396 | 98.68 |
0126 | Word Ladder II | Hard | String, Hash_Table, Breadth_First_Search, Backtracking | 418 | 51.45 |
0125 | Valid Palindrome | Easy | Top_Interview_Questions, String, Two_Pointers, Udemy_Two_Pointers, Top_Interview_150_Two_Pointers | 353 | 52.06 |
0124 | Binary Tree Maximum Path Sum | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 331 | 74.42 |
0123 | Best Time to Buy and Sell Stock III | Hard | Array, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 585 | 95.24 |
0122 | Best Time to Buy and Sell Stock II | Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7, Udemy_Arrays, Top_Interview_150_Array/String | 197 | 95.10 |
0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(N)_Space_O(1) | 609 | 94.06 |
0120 | Triangle | Medium | Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 194 | 97.87 |
0119 | Pascal’s Triangle II | Easy | Array, Dynamic_Programming, Data_Structure_II_Day_3_Array, Dynamic_Programming_I_Day_12, Udemy_Dynamic_Programming | 157 | 97.27 |
0118 | Pascal’s Triangle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_4_Array, Dynamic_Programming_I_Day_12, Udemy_Dynamic_Programming | 277 | 33.22 |
0117 | Populating Next Right Pointers in Each Node II | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search, Top_Interview_150_Binary_Tree_General | 199 | 94.67 |
0116 | Populating Next Right Pointers in Each Node | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_I_Day_8_Breadth_First_Search_Depth_First_Search | 355 | 69.02 |
0115 | Distinct Subsequences | Hard | String, Dynamic_Programming | 285 | 88.89 |
0114 | Flatten Binary Tree to Linked List | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 191 | 93.10 |
0113 | Path Sum II | Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking, Data_Structure_II_Day_16_Tree | 364 | 78.67 |
0112 | Path Sum | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Top_Interview_150_Binary_Tree_General | 322 | 36.41 |
0111 | Minimum Depth of Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue | 525 | 90.51 |
0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Programming_Skills_II_Day_2, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue | 182 | 71.30 |
0109 | Convert Sorted List to Binary Search Tree | Medium | Tree, Binary_Tree, Linked_List, Binary_Search_Tree, Divide_and_Conquer | 191 | 100.00 |
0108 | Convert Sorted Array to Binary Search Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Level_2_Day_9_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Divide_and_Conquer | 167 | 80.29 |
0107 | Binary Tree Level Order Traversal II | Medium | Breadth_First_Search, Tree, Binary_Tree | 187 | 87.50 |
0106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Top_Interview_150_Binary_Tree_General | 167 | 100.00 |
0105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 183 | 95.45 |
0104 | Maximum Depth of Binary Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 |
0103 | Binary Tree Zigzag Level Order Traversal | Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_15_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS | 176 | 71.62 |
0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS, Big_O_Time_O(N)_Space_O(N) | 198 | 95.14 |
0101 | Symmetric Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(log(N)) | 153 | 82.35 |
0100 | Same Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Level_2_Day_15_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General | 134 | 86.63 |
0099 | Recover Binary Search Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 221 | 90.00 |
0098 | Validate Binary Search Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 190 | 61.62 |
0097 | Interleaving String | Medium | String, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 149 | 81.58 |
0096 | Unique Binary Search Trees | Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11, Big_O_Time_O(n)_Space_O(1) | 116 | 92.31 |
0095 | Unique Binary Search Trees II | Medium | Dynamic_Programming, Tree, Binary_Tree, Backtracking, Binary_Search_Tree | 167 | 100.00 |
0094 | Binary Tree Inorder Traversal | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 152 | 66.67 |
0093 | Restore IP Addresses | Medium | String, Backtracking | 152 | 100.00 |
0092 | Reverse Linked List II | Medium | Linked_List, Top_Interview_150_Linked_List | 144 | 75.00 |
0091 | Decode Ways | Medium | Top_Interview_Questions, String, Dynamic_Programming, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_10 | 148 | 79.07 |
0090 | Subsets II | Medium | Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking | 200 | 88.33 |
0089 | Gray Code | Medium | Math, Bit_Manipulation, Backtracking | 271 | 69.23 |
0088 | Merge Sorted Array | Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_I_Day_2_Array, Top_Interview_150_Array/String | 170 | 69.74 |
0087 | Scramble String | Hard | String, Dynamic_Programming | 174 | 87.50 |
0086 | Partition List | Medium | Two_Pointers, Linked_List, Top_Interview_150_Linked_List | 160 | 70.73 |
0085 | Maximal Rectangle | Hard | Array, Dynamic_Programming, Matrix, Stack, Monotonic_Stack | 209 | 100.00 |
0084 | Largest Rectangle in Histogram | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n_log_n)_Space_O(log_n) | 476 | 90.79 |
0083 | Remove Duplicates from Sorted List | Easy | Linked_List, Data_Structure_I_Day_8_Linked_List | 173 | 82.42 |
0082 | Remove Duplicates from Sorted List II | Medium | Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Algorithm_II_Day_3_Two_Pointers, Top_Interview_150_Linked_List | 166 | 89.47 |
0081 | Search in Rotated Sorted Array II | Medium | Array, Binary_Search, Binary_Search_II_Day_12 | 170 | 96.30 |
0080 | Remove Duplicates from Sorted Array II | Medium | Array, Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String | 192 | 80.67 |
0079 | Word Search | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Top_Interview_150_Backtracking, Big_O_Time_O(4^(m*n))_Space_O(m*n) | 392 | 72.92 |
0078 | Subsets | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n*2^n) | 171 | 94.92 |
0077 | Combinations | Medium | Backtracking, Algorithm_I_Day_11_Recursion_Backtracking, Top_Interview_150_Backtracking | 232 | 100.00 |
0076 | Minimum Window Substring | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Top_Interview_150_Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 191 | 96.38 |
0075 | Sort Colors | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_2_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 164 | 64.43 |
0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Data_Structure_I_Day_5_Array, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_8, Level_2_Day_8_Binary_Search, Udemy_2D_Arrays/Matrix, Top_Interview_150_Binary_Search, Big_O_Time_O(endRow+endCol)_Space_O(1) | 159 | 74.46 |
0073 | Set Matrix Zeroes | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix, Big_O_Time_O(m*n)_Space_O(1) | 248 | 97.33 |
0072 | Edit Distance | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 |
0071 | Simplify Path | Medium | String, Stack, Top_Interview_150_Stack | 185 | 92.86 |
0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_10_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 124 | 71.98 |
0069 | Sqrt(x) | Easy | Top_Interview_Questions, Math, Binary_Search, Binary_Search_I_Day_4, Top_Interview_150_Math | 140 | 94.72 |
0068 | Text Justification | Hard | Array, String, Simulation, Top_Interview_150_Array/String | 153 | 92.96 |
0067 | Add Binary | Easy | String, Math, Bit_Manipulation, Simulation, Programming_Skills_II_Day_5, Top_Interview_150_Bit_Manipulation | 164 | 90.60 |
0066 | Plus One | Easy | Top_Interview_Questions, Array, Math, Programming_Skills_II_Day_3, Udemy_Arrays, Top_Interview_150_Math | 148 | 98.75 |
0065 | Valid Number | Hard | String | 151 | 100.00 |
0064 | Minimum Path Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m*n)_Space_O(m*n) | 164 | 100.00 |
0063 | Unique Paths II | Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_15, Top_Interview_150_Multidimensional_DP | 151 | 81.94 |
0062 | Unique Paths | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_15, Level_1_Day_11_Dynamic_Programming, Big_O_Time_O(m*n)_Space_O(m*n) | 118 | 94.65 |
0061 | Rotate List | Medium | Two_Pointers, Linked_List, Programming_Skills_II_Day_16, Udemy_Linked_List, Top_Interview_150_Linked_List | 160 | 92.22 |
0060 | Permutation Sequence | Hard | Math, Recursion | 132 | 100.00 |
0059 | Spiral Matrix II | Medium | Array, Matrix, Simulation, Data_Structure_II_Day_3_Array | 153 | 41.70 |
0058 | Length of Last Word | Easy | String, Programming_Skills_II_Day_6, Udemy_Arrays, Top_Interview_150_Array/String | 135 | 93.67 |
0057 | Insert Interval | Medium | Array, Level_2_Day_17_Interval, Top_Interview_150_Intervals | 249 | 75.63 |
0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Data_Structure_II_Day_2_Array, Level_2_Day_17_Interval, Udemy_2D_Arrays/Matrix, Top_Interview_150_Intervals, Big_O_Time_O(n_log_n)_Space_O(n) | 334 | 80.67 |
0055 | Jump Game | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_4, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 332 | 89.35 |
0054 | Spiral Matrix | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation, Programming_Skills_II_Day_8, Level_2_Day_1_Implementation/Simulation, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix | 132 | 95.12 |
0053 | Maximum Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Data_Structure_I_Day_1_Array, Dynamic_Programming_I_Day_5, Udemy_Famous_Algorithm, Top_Interview_150_Kadane’s_Algorithm, Big_O_Time_O(n)_Space_O(1) | 510 | 78.81 |
0052 | N-Queens II | Hard | Backtracking, Top_Interview_150_Backtracking | 128 | 97.56 |
0051 | N-Queens | Hard | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(N!)_Space_O(N) | 192 | 90.74 |
0050 | Pow(x, n) | Medium | Top_Interview_Questions, Math, Recursion, Udemy_Integers, Top_Interview_150_Math | 172 | 38.68 |
0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11, Udemy_Strings, Top_Interview_150_Hashmap, Big_O_Time_O(n*k_log_k)_Space_O(n) | 308 | 96.34 |
0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Data_Structure_II_Day_3_Array, Programming_Skills_II_Day_7, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix, Big_O_Time_O(n^2)_Space_O(1) | 160 | 90.11 |
0047 | Permutations II | Medium | Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking | 199 | 100.00 |
0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!) | 188 | 99.00 |
0045 | Jump Game II | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 208 | 93.37 |
0044 | Wildcard Matching | Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion, Udemy_Dynamic_Programming | 220 | 84.85 |
0043 | Multiply Strings | Medium | String, Math, Simulation, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_4, Level_2_Day_2_String | 165 | 96.72 |
0042 | Trapping Rain Water | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Dynamic_Programming_I_Day_9, Udemy_Two_Pointers, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 189 | 99.37 |
0041 | First Missing Positive | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Udemy_Arrays, Big_O_Time_O(n)_Space_O(n) | 357 | 97.17 |
0040 | Combination Sum II | Medium | Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking | 217 | 93.75 |
0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 226 | 88.89 |
0038 | Count and Say | Medium | Top_Interview_Questions, String | 135 | 100.00 |
0037 | Sudoku Solver | Hard | Array, Matrix, Backtracking | 148 | 100.00 |
0036 | Valid Sudoku | Medium | Top_Interview_Questions, Array, Hash_Table, Matrix, Data_Structure_I_Day_5_Array, Top_Interview_150_Matrix | 181 | 95.15 |
0035 | Search Insert Position | Easy | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_2, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 159 | 93.03 |
0034 | Find First and Last Position of Element in Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_5, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 174 | 100.00 |
0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_11, Level_2_Day_8_Binary_Search, Udemy_Binary_Search, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 151 | 93.77 |
0032 | Longest Valid Parentheses | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Stack, Big_O_Time_O(n)_Space_O(1) | 161 | 82.14 |
0031 | Next Permutation | Medium | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 205 | 48.21 |
0030 | Substring with Concatenation of All Words | Hard | String, Hash_Table, Sliding_Window, Top_Interview_150_Sliding_Window | 14 | 98.62 |
0029 | Divide Two Integers | Medium | Top_Interview_Questions, Math, Bit_Manipulation, Udemy_Bit_Manipulation | 144 | 82.50 |
0028 | Find the Index of the First Occurrence in a String | Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching, Programming_Skills_II_Day_1, Top_Interview_150_Array/String | 126 | 97.58 |
0027 | Remove Element | Easy | Array, Two_Pointers, Top_Interview_150_Array/String | 162 | 76.44 |
0026 | Remove Duplicates from Sorted Array | Easy | Top_Interview_Questions, Array, Two_Pointers, Udemy_Two_Pointers, Top_Interview_150_Array/String | 249 | 67.38 |
0025 | Reverse Nodes in k-Group | Hard | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(n)_Space_O(k) | 189 | 67.03 |
0024 | Swap Nodes in Pairs | Medium | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_12_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1) | 149 | 44.20 |
0023 | Merge k Sorted Lists | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(k*n*log(k))_Space_O(log(k)) | 198 | 93.77 |
0022 | Generate Parentheses | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 161 | 85.45 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(m+n)_Space_O(m+n) | 157 | 92.24 |
0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Top_Interview_150_Stack, Big_O_Time_O(n)_Space_O(n) | 137 | 88.76 |
0019 | Remove Nth Node From End of List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(L)_Space_O(L) | 144 | 96.28 |
0018 | 4Sum | Medium | Array, Sorting, Two_Pointers | 229 | 98.59 |
0017 | Letter Combinations of a Phone Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 155 | 95.24 |
0016 | 3Sum Closest | Medium | Array, Sorting, Two_Pointers, Level_2_Day_14_Sliding_Window/Two_Pointer | 163 | 100.00 |
0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers, Top_Interview_150_Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2) | 493 | 93.45 |
0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String, Level_2_Day_2_String, Udemy_Strings, Top_Interview_150_Array/String, Big_O_Time_O(n*m)_Space_O(m) | 154 | 89.70 |
0013 | Roman to Integer | Easy | Top_Interview_Questions, String, Hash_Table, Math, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 211 | 83.47 |
0012 | Integer to Roman | Medium | String, Hash_Table, Math, Top_Interview_150_Array/String, Big_O_Time_O(1)_Space_O(1) | 180 | 98.25 |
0011 | Container With Most Water | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Top_Interview_150_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 402 | 78.57 |
0010 | Regular Expression Matching | Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming, Big_O_Time_O(m*n)_Space_O(m*n) | 171 | 85.26 |
0009 | Palindrome Number | Easy | Math, Udemy_Integers, Top_Interview_150_Math, Big_O_Time_O(log10(x))_Space_O(1) | 217 | 95.34 |
0008 | String to Integer (atoi) | Medium | Top_Interview_Questions, String, Big_O_Time_O(n)_Space_O(n) | 172 | 82.90 |
0007 | Reverse Integer | Medium | Top_Interview_Questions, Math, Udemy_Integers, Big_O_Time_O(log10(x))_Space_O(1) | 149 | 77.89 |
0006 | Zigzag Conversion | Medium | String, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(n) | 200 | 97.79 |
0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n)_Space_O(n) | 162 | 99.00 |
0004 | Median of Two Sorted Arrays | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Top_Interview_150_Binary_Search, Big_O_Time_O(log(min(N,M)))_Space_O(1), AI_can_be_used_to_solve_the_task | 293 | 75.96 |
0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Top_Interview_150_Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 201 | 87.28 |
0002 | Add Two Numbers | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Data_Structure_II_Day_10_Linked_List, Programming_Skills_II_Day_15, Top_Interview_150_Linked_List, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 203 | 96.13 |
0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Data_Structure_I_Day_2_Array, Level_1_Day_13_Hashmap, Udemy_Arrays, Top_Interview_150_Hashmap, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 202 | 91.18 |