Array Sorting Greedy Intermediate Implement the maximumUnitsTruck method that returns the maximum units that can be loaded onto the truck. Solved
Array Sorting Greedy Intermediate Implement the reconstructQueueCount method that returns the number of people after reconstructing the queue. Solved
Array Sorting Greedy Intermediate Implement the partitionLabelsNumber method that returns how many partitions can be made so each character appears in one part. Solved
Array Sorting Greedy Learner Implement the assignCookiesMaximumChildren method that returns the maximum number of children that can receive a suitable cookie. Solved
Array Sorting Greedy Intermediate Implement the minimumArrowsBalloons method that returns the minimum arrows needed to burst all balloons. Solved
Array Sorting Greedy Intermediate Implement the eraseOverlapIntervalsCount method that returns how many intervals must be removed to avoid overlaps. Solved
Array Sorting Greedy Proficient Implement the candyDistributionMinimum method that returns the minimum candies needed while respecting rating rules. Solved
Array Sorting Greedy Intermediate Implement the gasStationCircuitStart method that returns the gas station index from which the full circuit can be completed. Solved
Array Sorting Greedy Intermediate Implement the jumpGameMinimumJumpsGreedy method that returns the minimum number of jumps needed to reach the end. Solved
Array Sorting Greedy Learner Implement the jumpGameReachableGreedy method that checks whether the last index is reachable using greedy logic. Solved
Array Dynamic Programming Greedy Intermediate Implement the maximumProfitMultipleTransactions method that returns the maximum stock profit using multiple valid transactions. Solved
Array Dynamic Programming Greedy Learner Implement the maximumProfitSingleTransaction method that returns the best stock profit using at most one buy and one sell. Solved
Array Dynamic Programming Greedy Learner Implement the canReachLastIndex method that checks whether the last index can be reached from the first index. Solved
Array Greedy Proficient Implement the method minJumpsToEnd that returns the fewest jumps needed to reach the last index. Solved
Array Counting Greedy Intermediate Implement the method majorityElement that returns the value appearing more than half the time. Solved