leetcode-potd

41. First Missing Positive

leetcode-potd

Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. You must implement an algorithm that runs in O(n) time and

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