Visa Interview Questions, Process, and Tips for Freshers

Round duration - 75 minutes
Round difficulty - Easy

2 coding problems were asked

Candidates who solved both the questions in the first 45 mins get shortlisted. 12 candidates including me got shortlisted.

Q1. Longest Common Subsequence
You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.
A String ‘a’ is a subsequence of a String ‘b...read more
Ans. Recursive Brute Force
The basic idea of this approach is to break the original problem into sub-problems. Let us assume we want to find the length of the longest common subsequence of “STR1” and “STR2” whose length is ‘N’ and ‘M’ respectively. 
 
Now, let us define a recursive function 
 
LCS(Int I, int J, string STR1, string STR2)
Which returns the length of the longest common subsequence of string STR1...read more
Answered Anonymously
Add your answer
Q2. Graph Connectivity Queries.
You have been given a graph consisting of ‘N’ nodes and a threshold value ‘THRESHOLDVALUE’. Two different nodes ‘X’ and ‘Y’ are directly connected to each other if and only if t...read more
Ans. Breadth First Search.
We will iterate over all the possible pairs of nodes and check if they are directly connected. We will build the graph and using a breadth-first search we can find all the connected components. If two nodes in the query are part of the same component insert ‘1’ otherwise ‘0’ in the vector/list ‘ans’.

 
We will apply the algorithm as follows:-
• Declare a list of list/vector ‘adj’ of size ‘n’+1 wher...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round 2 : HR + Technical Round Time -60 Mins
Firstly we greet each other and then we have talked about my projects and stuff. After that, he gave me some technical questions and I have to choose any three of them and write the code for them. I finished with all the three questions in about 15-20 min since i have solved similar questions while practicing.
What are the various formatting tags in HTML?
What is Pattern Matching in SQL?

After solving those questions we have discussed about our city since i and the interviewer both are from the same city, after that we were finished the interview.

After a very stressful night, the Next day results were declared and 7 out of 12 candidates including me got selected for the internship.

Q1. Snake and Ladder
You have been given a Snake and Ladder Board with 'N' rows and 'N' columns with the numbers written from 1 to (N*N) starting from the bottom left of the board, and alternat...read more
Ans. BFS
We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.
1. We will maintain a queue of cellNumber where the front of the queue will always contain a cell which can be reached by minimum dice throw from starting cell (cellNumber = 1).
2. Create a minDiceThrow array of size N*N initialise it with the maximum value (INT_MAX)
3. Start with pushing cellNumber 1 and updating minDiceThrow[1] = 0...read more
Answered Anonymously
Add your answer
Q2. Second Most Repeated Word
You are given an array of strings ‘ARR’. You have to find out the second most repeated word in the array ‘ARR’. It is guaranteed every string occurs a unique number of times in th...read more
Ans. Hashing
Iterate through the array and store the frequency of each string in the array. Find out the maximum frequency word which occurs in the array and print the word which has the maximum frequency but has less frequency than the maximum one.
 
Algorithm:-
 
1. Initialize an empty string named ANS to store the final answer.
2. Initialize a dictionary named FREQ to store the frequency of the words in the array.
3. Iterate t...read more
Answered Anonymously
Add your answer
Q3. N Queens
You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.
A ...read more
Ans. Backtracking
1. Instead of checking all the places on the chessboard, we can use backtracking and place queen row-wise or column-wise.
2. Suppose we place queens row-wise, and we start with the very first row. Place the queen and move to the next row until either there is a solution or there are no viable cells left.
3. As we backtrack, check to place the queen in the different columns of the same row.
4. When we can place a queen at ...read more
Answered Anonymously
Add your answer
Q4. Four Keys Keyboard
Imagine you have a special keyboard with the following four keys:
Key 1: (A): Print one ‘A’ on screen.
Key 2: (Ctrl-A): Select the whole screen.
Key 3: (Ctrl-C): Copy selection to buffe...read more
Ans. Recursion
Approach: We can observe that if  ‘n’ < 7, the output is ‘n’ itself. Otherwise, if ‘n’ is greater than or equal to 7, then the optimal sequence of operations will end with a suffix of one Ctrl-A, one Ctrl-C, followed by one or several Ctrl-V’s.
 
If F(n) given the maximum number of ‘A’s that can be printed by ‘n’ keystrokes and ‘x’ represent the number of Ctrl-V’s at the end, then recurrence relatio...read more
Answered Anonymously
Add your answer

It had 4 questions of moderate difficulty

Q1. He went deep into my resume and asked questions from each line of it
Add your answer
Q2. Then he asked me that why you have only passed 10/14 test cases in 4th question
Add your answer
Q3. I said it was from dp and I had not studied dp properly
Add your answer

Q1. Tell me about your highest qualification?
Add your answer
Q2. Tell me your expected monthly income?
Ans. 
I am expecting a competitive salary based on my experience and the responsibilities of the role.
• I am open to negotiation based on the company's budget and benefits package.

• I have researched the average salary range for this position in the industry and location.

• I am confident in my skills and experience and believe I can bring value to the company.

• I am looking for a fair and reasonable compensation package that reflect
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The coding test was conducted on Hackerrank platform. The test was in the evening. There were two coding questions of easy difficulty. The test was proctored, our webcam was on but not the mic. Also we were not allowed to switch tabs.
About 360 students sat in this round out which 15 were shortlisted for the next interview round.

Q1. Maximum equal elements after K operations
You are given an arbitrary array/list of integers 'ARR' of size ‘N’ and an integer ‘K’. You need to find the maximum number of elements which can be made e...read more
Ans. 
This was a very easy question as I just had to traverse both the array and maintain a count variable and a variable to store last maximum equal element encountered which I initialized to a very small number (like INT_MIN in C++) . Now while traversing whenever you encounter equal elements which are greater than last maximum equal elements then increment count by 1. In the end just print count.
Answered Anonymously
Add your answer
Q2. Number of Pairs with Given Sum
You have been given an integer array/list(arr) and a number 'Sum'. Find and return the total number of pairs in the array/list which when added, results equal to the ...read more
Ans. 
Step 1 : Create a map and store count of each unique element in the array.
Step 2 : Maintain a count variable to store the number of unique pairs of elements whose sum is K.
Step 3 : Traverse the array. Let the array be called arr and arr[i] is current element in array while traversing. If value arr[i] and K-arr[i] in map is greater than 0 then increment count and make value of arr[i] and K-arr[i] in map as 0.
Answered Anonymously
Add your answer