Visa interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Visa

1 rounds | 1 Coding problems

Anonymous

Fresher | Dec 2020

Rejected

Interview preparation journey

Preparation

Duration: 6 months

Topics: Data Structures, Dynamic Programming, OOPS, Computer Architecture, Algorithms, Bit Manipulation, Operating System, Computer Networking, Cloud concepts

Tip

Tip 1 : Ability to apply data structures in questions(practice graph and Tree questions)
Tip 2 : Thorough knowledge of the projects done
Tip 3 : Good knowledge about computer science concepts

Application process

Where: Campus

Eligibility: 7 CGPA and above, no dead backlogs

Resume tip

Tip 1 : Mention projects that you have done yourself and are thorough with
Tip 2 : mention soft skills

Interview rounds

Round

Medium

Online Coding Test

Duration60 minutes

Interview date5 Dec 2020

Coding problem1

test timing: 7-8 pm
2 programming questions
webcam proctored

1. Minimum Cost to Reach End

Moderate

25m average time

65% success

0/80

Asked in companies

You are given an array “ARR” of 'N' integers and an integer 'K'. You can move from any index 'i' to index 'j' if j ≤ i + K. The cost of moving from one index 'i' to the other index 'j' is abs(ARR[j] – ARR[i]). Your task is to find the minimum cost to reach the end of the array from the beginning of the array when a maximum jump of 'K' is allowed.

For example:

If the given array is [10, 3, 40, 5, 25] and K is 2 then the minimum cost would be 29. 
Since K = 2, the optimal way to reach the end of the array with minimum cost is to take a jump to 1st index from 0th index with the cost of abs(3 - 10)  i.e 7 and then we take a jump of 2 from 1st index to the 3rd index with the cost of abs(5 - 3). i.e 2. Then we take a jump of 1 from 3rd index to the last index with the cost of abs(25 - 5) .ie 20. 
Therefore the minimum cost to reach the end of the array is (7 + 2 + 20) i.e 29.

Try solving now