826. Most Profit Assigning Work

leetcode-potd

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, and worker[j] is the

330. Patching Array

leetcode-potd

Given a sorted integer array nums and an integer n, add/patch elements to the array such that any number in the range [1, n] inclusive

Scroll to Top