Visa Fullstack Developer Intern Interview Questions, Process, and Tips

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 Problem Statement
Given two strings STR1 and STR2, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...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 Problem
Given a graph with N nodes and a threshold value THRESHOLDVALUE, two distinct nodes X and Y are directly connected if there exists a Z such that:
X % Z == 0
Y % Z == 0
Z ...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 Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...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 Problem Statement
You are given an array of strings ARR. The task is to find out the second most frequently repeated word in the array. It is guaranteed that each string in the a...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 Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...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 Problem Statement
Imagine you have a special keyboard with four keys:
• Key 1: (A) to print one ‘A’ on screen.
• Key 2: (Ctrl-A) to select the entire screen.
• Key 3: (Ctrl-C) to copy th...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