Question Link : https://leetcode.com/problems/product-of-array-except-self/

Difficulty: Medium

Premium: False

Question

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed …

Continue reading

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

Difficulty: Medium

Premium: False

Question

Given an integer array nums, find the subarray with the largest sum, and return its sum.   Example 1:

Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1 …

Continue reading

Question Link : https://leetcode.com/problems/partition-to-k-equal-sum-subsets/

Difficulty: Medium

Premium: False

Question

Given an integer array nums and an integer k, return true if it is possible to divide this array into k non-empty subsets whose sums are all equal.   Example 1:

Input: nums = [4,3,2,3,5,2 …

Continue reading

Question Link : https://leetcode.com/problems/longest-subsequence-with-limited-sum/

Difficulty: Easy

Premium: False

Question

You are given an integer array nums of length n, and an integer array queries of length m. Return an array answer of length m where answer[i] is the maximum size of a subsequence that you can …

Continue reading