2807. Insert Greatest Common Divisors in Linked List
Given the head of a linked list
head, in which each node contains an integer value.Between every pair of adjacent nodes, insert a new node with a value equal to the greatest common divisor of them.
Return the linked list after insertion.
The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.
2808. Minimum Seconds to Equalize a Circular Array
You are given a 0-indexed array
numscontainingnintegers.At each second, you perform the following operation on the array:
- For every index
iin the range[0, n - 1], replacenums[i]with eithernums[i],nums[(i - 1 + n) % n], ornums[(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
numsequal.
2809. Minimum Time to Make Array Sum At Most x
You are given two 0-indexed integer arrays
nums1andnums2of equal length. Every second, for all indices0 <= i < nums1.length, value ofnums1[i]is incremented bynums2[i]. After this is done, you can do the following operation:
- Choose an index
0 <= i < nums1.lengthand makenums1[i] = 0.You are also given an integer
x.Return the minimum time in which you can make the sum of all elements of
nums1to be less than or equal tox, or-1if this is not possible.