875. Koko Eating Bananas - LeetCode Can you solve this real interview question? Koko Eating Bananas - Koko loves to eat bananas There are n piles of bananas, the ith pile has piles[i] bananas The guards have gone and will come back in h hours Koko can decide her bananas-per-hour eating speed of k Each hour, she chooses some pile of bananas and eats k bananas from that pile If the pile has less than k bananas, she eats all
Non-overlapping Intervals - LeetCode Can you solve this real interview question? Non-overlapping Intervals - Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping Note that intervals which only touch at a point are non-overlapping For example, [1, 2] and [2, 3] are non-overlapping Example 1: Input
Minimum Limit of Balls in a Bag - LeetCode Can you solve this real interview question? Minimum Limit of Balls in a Bag - You are given an integer array nums where the ith bag contains nums[i] balls You are also given an integer maxOperations You can perform the following operation at most maxOperations times: * Take any bag of balls and divide it into two new bags with a positive number of balls * For example, a bag of 5 balls can
977. Squares of a Sorted Array - LeetCode Can you solve this real interview question? Squares of a Sorted Array - Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order Example 1: Input: nums = [-4,-1,0,3,10] Output: [0,1,9,16,100] Explanation: After squaring, the array becomes [16,1,0,9,100] After sorting, it becomes [0,1,9,16,100] Example 2: Input
Capacity To Ship Packages Within D Days - LeetCode Can you solve this real interview question? Capacity To Ship Packages Within D Days - A conveyor belt has packages that must be shipped from one port to another within days days The ith package on the conveyor belt has a weight of weights[i] Each day, we load the ship with packages on the conveyor belt (in the order given by weights) We may not load more weight than the maximum weight
Reshape Data: Melt - LeetCode 2 The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions 3 If you'd like to share your solution for feedback and ideas, please head to the solutions tab and post it there
Find Minimum in Rotated Sorted Array - LeetCode Can you solve this real interview question? Find Minimum in Rotated Sorted Array - Suppose an array of length n sorted in ascending order is rotated between 1 and n times For example, the array nums = [0,1,2,4,5,6,7] might become: * [4,5,6,7,0,1,2] if it was rotated 4 times * [0,1,2,4,5,6,7] if it was rotated 7 times Notice that rotating an array [a[0], a[1], a[2], , a[n-1]] 1 time
Array - LeetCode Level up your coding skills and quickly land a job This is the best place to expand your knowledge and get prepared for your next interview
カレンダー