Given an array of integersContinue reading “[Leetcode problems]1477. Find Two Non-overlapping Sub-arrays Each With Target Sum”`arr`

and an integer`target`

. You have to findtwo non-overlapping sub-arraysof`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 isminimum. Returnthe minimum sum of the lengthsof the two required sub-arrays, or returnif you cannot find such two sub-arrays.-1Example 1:Input:arr = [3,2,2,4,3], target = 3Output:2Explanation:Only two sub-arrays have sum = 3 ([3] and [3]). The sum of their lengths is 2.Example 2:Input:arr = [7,3,4,7], target = 7Output:2Explanation:Although we have three non-overlapping sub-arrays of sum = 7 ([7], [3,4] and [7]), but we will choose the first and third sub-arrays as the sum of their lengths is 2.

## [Leetcode problems]1475. Final Prices With a Special Discount in a Shop

Given the arrayContinue reading “[Leetcode problems]1475. Final Prices With a Special Discount in a Shop”`prices`

where`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`prices[j]`

where`j`

is theminimumindex such that`j > i`

and`prices[j] <= prices[i]`

, otherwise, you will not receive any discount at all.Return an array where theExamples:`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]