You have a secret array. You also have two integers upperbound and lowerbound. Now you need to return how many arrays exist within the upperbound and lowerbound that analogy to your secret array.
Two arrays are analogy if their difference between consecutive numbers are the same.
For example, array [1, 0, 3, 0] and array [2, 1, 4, 1] are analogy. Because the difference are the same [-1, 3, -3].
Arr = [1, 0, 3, 0], upperbound = 4, lowerbound = 0
Arr = [1, 1, 3, 2], upperbound = 5, lowerbound = 1
[2, 2, 4, 3], [3, 3, 5, 4]
Get one-to-one training from Google Facebook engineers
Learn from Facebook and Google senior engineers interviewed 100+ candidates.
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Customized Private Class
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.