Question Link : https://leetcode.com/problems/minimize-rounding-error-to-meet-target/

Difficulty: Medium

Premium: True

Question

Given an array of prices [p1,p2...,pn] and a target, round each price pi to Roundi(pi) so that the rounded array [Round1(p1),Round2(p2)...,Roundn(pn)] sums to the given target. Each operation Roundi(pi …

Continue reading

Question Link : https://leetcode.com/problems/maximum-product-subarray/

Difficulty: Medium

Premium: False

Question

Given an integer array nums, find a subarray that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer.   Example 1:

Input: nums = [2,3 …

Continue reading

Question Link : https://leetcode.com/problems/jump-game/

Difficulty: Medium

Premium: False

Question

You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last …

Continue reading

Question Link : https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

Difficulty: Medium

Premium: False

Question

You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock. You can only hold …

Continue reading

Question Link : https://leetcode.com/problems/task-scheduler/

Difficulty: Medium

Premium: False

Question

You are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of one task. Tasks can be completed …

Continue reading

Question Link : https://leetcode.com/problems/find-the-celebrity/

Difficulty: Medium

Premium: True

Question

Suppose you are at a party with n people labeled from 0 to n - 1 and among them, there may exist one celebrity. The definition of a celebrity is that all the other n - 1 people know the …

Continue reading

Question Link : https://leetcode.com/problems/optimal-partition-of-string/

Difficulty: Medium

Premium: False

Question

Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single substring more than once. Return the minimum number of …

Continue reading

Question Link : https://leetcode.com/problems/boats-to-save-people/

Difficulty: Medium

Premium: False

Question

You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of limit. Each boat carries at most two …

Continue reading

Question Link : https://leetcode.com/problems/non-overlapping-intervals/

Difficulty: Medium

Question

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.   Example 1:

Input: intervals = [[1,2],[2,3],[3,4],[1 …

Continue reading

Question Link : https://leetcode.com/problems/teemo-attacking/

Difficulty: Easy

Question

Our hero Teemo is attacking an enemy Ashe with poison attacks! When Teemo attacks Ashe, Ashe gets poisoned for a exactly duration seconds. More formally, an attack at second t will mean Ashe is poisoned during the inclusive time interval …

Continue reading