넘치게 채우기

https://leetcode.com/problems/magnetic-force-between-two-balls/description/leetcode - Magnetic Force Between Two Balls문제 유형 : 이진 탐색문제 난이도 : Medium 문제In the universe Earth C-137, Rick discovered a special form of magnetic force between two balls if they are put in his new invented basket. Rick has n empty baskets, the ith basket is at position[i], Morty has m balls and needs to distribute the bal..

https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/description/leetcode - Minimum Number of Days to Make m Bouquets문제 유형 : 이진탐색, 그리디, 슬라이딩 윈도우, 구현문제 난이도 : Medium 문제You are given an integer array bloomDay, an integer m and an integer k.You want to make m bouquets. To make a bouquet, you need to use k adjacent flowers from the garden.The garden consists of n flowers, the ith f..

https://leetcode.com/problems/most-profit-assigning-work/description/leetcode - Most Profit Assigning Work문제 유형 : 정렬, 그리디, 이진탐색문제 난이도 : Medium 문제You have n jobs and m workers. You are given three arrays: difficulty, profit, and worker where:difficulty[i] and profit[i] are the difficulty and the profit of the ith job, andworker[j] is the ability of jth worker (i.e., the jth worker can only comple..

https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/description/leetcode - Special Array With X Elements Greater Than or Equal X문제 유형 : 이진 탐색문제 난이도 : Easy 문제You are given an array nums of non-negative integers. nums is considered special if there exists a number x such that there are exactly x numbers in nums that are greater than or equal to x.Notice that x does ..

https://leetcode.com/problems/maximum-profit-in-job-scheduling/description/ Maximum Profit in Job Scheduling - LeetCode Can you solve this real interview question? Maximum Profit in Job Scheduling - We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the startTime, endTime and profit arrays, leetcode.com leetcode ..

https://leetcode.com/problems/find-in-mountain-array/ Find in Mountain Array - LeetCode Can you solve this real interview question? Find in Mountain Array - (This problem is an interactive problem.) You may recall that an array arr is a mountain array if and only if: * arr.length >= 3 * There exists some i with 0 < i < arr.length - 1 such tha leetcode.com 문제 유형 : 이진 탐색 문제 난이도 : Hard 문제 (This pro..

https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/ LeetCode - The World's Leading Online Programming Learning Platform 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. leetcode.com 문제 유형 : 이진 탐색 문제 난이도 : Medium 문제 Given an array of integers nums sorted in n..

https://leetcode.com/problems/search-in-rotated-sorted-array/description/ Search in Rotated Sorted Array - LeetCode Can you solve this real interview question? Search in Rotated Sorted Array - There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 nums[i+1] || target < nums[i..

https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/description/ Count Negative Numbers in a Sorted Matrix - LeetCode Can you solve this real interview question? Count Negative Numbers in a Sorted Matrix - Given a m x n matrix grid which is sorted in non-increasing order both row-wise and column-wise, return the number of negative numbers in grid. Example 1: Input: gri leetco..