Do it for FUN | SUMFIのBlog

[LeetCode] Minimum Seconds to Equalize a Circular Array 2023-08-06|PSLeetCode|Problem Solving-Greedy

2808. Minimum Seconds to Equalize a Circular Array

You are given a 0-indexed array nums containing n integers.

At each second, you perform the following operation on the array:

For every index i in the range [0, n - 1], replace nums[i] with either nums[i], nums[(i - 1 + n) % n], or nums[(i + 1) % n].

Note that all the elements get replaced simultaneously.

Return the minimum number of seconds needed to make all elements in the array nums equal.

[LeetCode] Minimum Time to Make Array Sum At Most x 2023-08-06|PSLeetCode|Problem Solving-0/1 Knapsack

2809. Minimum Time to Make Array Sum At Most x

You are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every second, for all indices 0 <= i < nums1.length, value of nums1[i] is incremented by nums2[i]. After this is done, you can do the following operation:

Choose an index 0 <= i < nums1.length and make nums1[i] = 0.

You are also given an integer x.

Return the minimum time in which you can make the sum of all elements of nums1 to be less than or equal to x, or -1 if this is not possible.