# Status Problem video Level Completes Likes 559 Minimizing Taxis for Maximum Efficiency Hard % 1 555 Move All Zeroes to the End of the Array Beginner % 1 554 Counting bits - Leetcode Beginner % 0 544 Counting the Largest Number Groups by Digit Sum Medium % 2 543 Adding One to a Number Represented by an Array Medium % 1 538 Find The Minimum time difference Medium % 1 537 Departure and Destination Cities in a given itinerary Beginner % 2 536 Efficiently Rank Elements in a Given Array Beginner % 3 535 Find Three Consecutive Odd Numbers in an array Beginner % 2 532 Maximum Depth of Valid Nested Parentheses in an arithmetic expression Medium % 0 529 Duplicate even elements in an array Beginner % 1 528 Minimum Increments to make all array elements unique Medium % 0 526 Maximum Surpasser in the given array Hard % 0 525 Find the number of pairs with odd XOR Beginner % 2 524 Maximum CPU Load Problem in a jobs list Medium % 1 522 Check If Student is eligible for an Attendance Reward Beginner % 0 520 Remove Duplicates in a given Sorted Array Beginner % 0 518 Replace Elements with Greatest Element on Right Beginner % 0 517 Count number of pairs in an array with sum = K Medium % 0 515 Maximum distance from the nearest person Medium % 1 Minimizing Taxis for Maximum Efficiency Move All Zeroes to the End of the Array Counting bits - Leetcode Counting the Largest Number Groups by Digit Sum Adding One to a Number Represented by an Array Find The Minimum time difference Departure and Destination Cities in a given itinerary Efficiently Rank Elements in a Given Array Find Three Consecutive Odd Numbers in an array Maximum Depth of Valid Nested Parentheses in an arithmetic expression Duplicate even elements in an array Minimum Increments to make all array elements unique Maximum Surpasser in the given array Find the number of pairs with odd XOR Maximum CPU Load Problem in a jobs list Check If Student is eligible for an Attendance Reward Remove Duplicates in a given Sorted Array Replace Elements with Greatest Element on Right Count number of pairs in an array with sum = K Maximum distance from the nearest person 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
