Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

Visa Interview (On campus internship)

  • Difficulty Level : Medium
  • Last Updated : 06 Sep, 2019

Round 1: Online Coding Round

90 min coding round, 4 questions (basic, easy, easy, medium). The test was conducted on hackerank and partial marking was there. Questions :-

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

1. We have to find the index of maximum element in an array after certain number of rotations.



2. The question reduced to minimum coin exchange problem.
3. Given an array of strings of sequence of moves and we have to return yes or no corresponding to whether the robot return to initial position.
https://www.geeksforgeeks.org/check-if-a-given-sequence-of-moves-for-a-robot-is-circular-or-not

4. Given a sorted array. Find all the pairs whose product is less than or equal to a given value in O(n).

 

The students who did atleast 3 questions were selected.

Round 2: Technical + HR Interview

For the interns there was only one round. It was mainly focused on algos. Questions:-

1. Given an integer. Change the 0 in the number to 5 without using extra space.

2. The question was completely based on topological sort.

3. Given an array, move zeros to the right without changing the sequence.

Then he asked me questions on java which was mainly focused on garbage collector.

Then he asked a probability question. Given an equilateral triangle with three person standing on three corners and can move in any direction with equal velocities. Find the probability that no two persons will ever meet. (ans- 1/4 because of 8 combination only 2 cases possible – all move in clockwise or anticlockwise direction).

Last question was why visa.

My Personal Notes arrow_drop_up
Recommended Articles
Page :