Round 1: coding question
We have an array filled with integers. now we need to start from a index and move in any of left, right, up or down if the difference between the v alues is 1, for each move we need to give a point to the index we started. now we need to return the index will have maximum number of moves which is possible starting at a index.we can keep moving from an index to next only if difference between the values of them is 1.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.