Given an array of integers
Continue reading “[Leetcode problems]1477. Find Two Non-overlapping Sub-arrays Each With Target Sum”
arr and an integer
You have to find two non-overlapping sub-arrays of
arr each with sum equal
target. There can be multiple answers so you have to find an answer where the sum of the lengths of the two sub-arrays is minimum.
Return the minimum sum of the lengths of the two required sub-arrays, or return -1 if you cannot find such two sub-arrays.
Input: arr = [3,2,2,4,3], target = 3 Output: 2 Explanation: Only two sub-arrays have sum = 3 ( and ). The sum of their lengths is 2.
Input: arr = [7,3,4,7], target = 7 Output: 2 Explanation: Although we have three non-overlapping sub-arrays of sum = 7 (, [3,4] and ), but we will choose the first and third sub-arrays as the sum of their lengths is 2.
Given the array
Continue reading “[Leetcode problems]1475. Final Prices With a Special Discount in a Shop”
prices[i] is the price of the
ith item in a shop. There is a special discount for items in the shop, if you buy the
ith item, then you will receive a discount equivalent to
j is the minimum index such that
j > i and
prices[j] <= prices[i], otherwise, you will not receive any discount at all.
Return an array where the
ith element is the final price you will pay for the
ith item of the shop considering the special discount.
Input: prices = [8,4,6,2,3] Output: [4,2,4,2,3]
Input: prices = [1,2,3,4,5] Output: [1,2,3,4,5]