Visa Software Developer Interview Questions, Process, and Tips

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

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 provided with an array/list of integers named 'ARR' of size 'N' and an integer 'K'. Your task is to determine the maximum number of elements that can be m...read more
Ans. 
Determine the maximum number of elements that can be made equal by performing at most K operations on an array of integers.
• Sort the array in non-decreasing order to easily identify the elements that need to be increased

• Calculate the difference between adjacent elements to determine the number of operations needed to make them equal

• Keep track of the total number of operations used and the maximum number of elements that
Answered by AI
Add your answer
Q2. 
Count Pairs with Given Sum
Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
Input:
The first line c...read more
Ans. 
Count the total number of unique pairs in an array whose elements sum up to a given value.
• Use a hashmap to store the frequency of each element in the array.

• Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.

• Increment the count of pairs if the complement exists in the hashmap.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was an elimination round. There were 2 coding questions. Both questions were of medium level and I solved them in a given time. After this round, 29 students got shortlisted and I was one of them.

Q1. 
Ninja's Dance Competition Pairing Problem
Ninja is organizing a dance competition and wants to pair participants using a unique method. Each participant chooses a number upon entry, and Ninja selects a nu...read more
Ans. 
Find the number of distinct pairs of participants with a given difference in chosen numbers.
• Iterate through the array and for each element, check if the pair exists with the required difference 'K'.

• Use a hash set to keep track of unique pairs to avoid counting duplicates.

• Return the size of the hash set as the final count of distinct pairs.
Answered by AI
Add your answer
Q2. 
Find Maximum Length Sub-array with Specific Adjacent Differences
Given an array of integers ‘A’ of length ‘N’, find the maximum length of a sub-array where the absolute difference between adjacent element...read more
Ans. 
Find the maximum length of a sub-array with adjacent differences of 0 or 1 in an array of integers.
• Iterate through the array and keep track of the current sub-array length with adjacent differences of 0 or 1.

• Update the maximum length encountered so far as you traverse the array.

• Return the maximum length found as the result.
Answered by AI
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round on Zoom. The interviewer was very friendly. He gave me one coding problem. I solved the problem and then he asked to improve time and space complexity if possible. I explained my logic very well. After this question, he asked to me explain 3NF(3rd normal form). Then we had some discussion on OOPs concepts.

Q1. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
• Use a combination of hashmap and doubly linked list to implement the LRU cache.

• Keep track of the least recently used item and evict it when the cache reaches its capacity.

• Update the position of an item in the cache whenever it is accessed to maintain the order of recently used items.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was another technical round. The interviewer gave me a coding problem to solve.
 

Q1. 
Valid String Problem Statement
You are provided with a string S containing only three types of characters: ('), )'), and *.
Explanation:
A Valid String is characterized by the following conditions:
1. ...read more
Ans. 
Check if a given string containing parentheses and asterisks is valid based on certain conditions.
• Iterate through the string and keep track of the count of left parentheses, right parentheses, and asterisks.

• Use a stack to keep track of the positions of left parentheses and asterisks.

• If at any point the count of right parentheses exceeds the count of left parentheses and asterisks, the string is invalid.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 60 minutes
Round difficulty - Medium

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

Q1. 
Minimum Cost to Reach End Problem
You are provided with an array ARR of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...read more
Ans. 
Find minimum cost to reach end of array by jumping with constraints
• Use dynamic programming to keep track of minimum cost at each index

• Iterate through the array and update the minimum cost based on reachable indices within K steps

• Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Answered by AI
Add your answer