← All problemsSign in

3468. Find the Number of Copy Arrays

LeetCodeArrayMathOpen on judge ↗

You are given an array original of length n and a 2D array bounds of length n x 2, where bounds[i] = [ui, vi]. You need to find the number of possible arrays copy of length n such that: - (copy[i] - copy[i - 1]) == (original[i] - original[i - 1]) for 1 <= i <= n - 1. - ui <= copy[i] <= vi for 0 <= i <= n - 1. Return the number of such arrays. Example 1: Input: original = [1,2,3,4], bounds

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start