Hi everyone ,

I attended the first round of Amazon interview for SDE 1 and asked the below questions .

You are initially positioned at the first index of the array arr.
In one step you can jump from index i to index i + 1, i - 1 or j where arr[i] == arr[j].
Return the minimum number of steps required to reach the last index of the array.

1, 2, 3, 4, 5, 2, 7 -> 3

You have to build a wall of dimension 3 * N for your house only with the help of stones of dimension 1 * 3.
Find the number of ways in which the wall can be constructed.

Able to solve the first question after spending soo much time and after taking the hints from the recruiter .

There was not time for 2nd question to solve . Since I spend most of my time on 1st question .