Visa Software Developer Interview Questions, Process, and Tips

One medium and one standard DP question

Q1. Medium level question based on binary search
Add your answer

Q1. Design google-pay
Ans. 
Design Google Pay - a digital wallet platform for online payments and transactions.
• Allow users to securely store payment information such as credit/debit cards, bank accounts, and loyalty cards.

• Enable users to make payments in stores, online, and within apps using their stored payment methods.

• Implement security features like biometric authentication, tokenization, and encryption to protect user data.

• Provide features fo...read more
Answered by AI
Add your answer
Q2. HLD of recursive
Ans. 
High Level Design (HLD) of recursive functions in software development.
• Recursive functions call themselves to solve smaller instances of the same problem.

• HLD of recursive functions involves defining the base case, recursive case, and termination condition.

• Example: HLD of a recursive function to calculate factorial of a number involves defining base case as factorial(0) = 1.
Answered by AI
Add your answer

Q1. Puzzles available on GFG
Add your answer
Q2. Behavioral question
Add your answer

2d grid , 4 questions easy to medium

SQL core Java Angular React Spring Boot

SQL Core Java Angular React Spring Boot

Q1. SQL Core Java Angular React Spring Boot
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 And The Dance Competetion
Ninja has been asked to organize a dance competition. Ninja decided that he will take individual entries and then will divide them into pairs. As part of the entry, he asked...read more
Ans. 
I solved this question using the map in O(n) time complexity. First I stored the count of elements in an array then by checking the condition(k > 0 && map.containsKey(i + k) || k == 0 && map.get(i) > 1), I incremented the result by one every time when condition satisfied. Below is my code for the same.

class Solution {
public int findPairs(int[] nums, int k) {
Map map = new HashMap();
for(int num : nu...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Maximum length sub-array having absolute difference of adjacent elements either 0 or 1.
Given an array ‘A’ of ‘N’ integers, you need to find the maximum length of the sub-array such that the absolute diffe...read more
Ans. 
This was a simple array problem. I solved this using question as:
Starting from the first element of the array, find the first valid sub-array and store its length then starting from the next element (the first element that wasn’t included in the first sub-array), find another valid sub-array. Repeat the process until all the valid sub-arrays have been found then print the length of the maximum sub-array.
Answered by CodingNinjas
View 2 more amswers

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 Implementation
Design and implement a data structure for Least Recently Used (LRU) cache to support the foll...read more
Ans. Array Approach
We will use an array of type Pair<key, value> to implement our LRU Cache where the larger the index is, the more recently the key is used. Means, the 0th index denotes the least recently used pair, and the last index denotes the most recently used pair.
 
The key will be considered as accessed if we try to perform any operation on it. So while performing the get operation on a key, we will do a ...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 60 minutes
Round difficulty - Medium

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

Q1.  Valid String
You have been given a string 'S' containing only three types of characters, i.e. '(', ')' and '*'.
A Valid String is defined as follows:
1. Any left parenth...read more
Ans. Brute Force
We can try each of the three possibilities for every asterisk in the string with the help of recursion. 
 
We will use a temporary string which will keep track of our current possible string. In the end, we can linearly check each possible string. If any of the possible string is a valid string, we print ‘Yes’, otherwise ‘No’.
Space Complexity: O(n)Explanation:
O(N), where ‘N’ is the length of the str...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 60 minutes
Round difficulty - Easy

Q1. General
What do you want to work in?
Why do you want to join VISA?
Asked what kept them at VISA? And what they’re objectives in their career?
Add your answer
Q2.  System Design problem
What to do if there are too many requests to a web server? Don’t know if they’re correct. I feel it was a more test to see your critical thinking and acquired knowledge.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

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

Q1. Minimum Cost to Reach End
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...read more
Ans. Dynamic Programming
The idea is to use a bottom-up dynamic programming approach instead of a memoization approach. In this, we use the recurrence relation of memoization approach as dp(j) = min{dp(i) + abs(arr[i] – arr[j])} where i is in [0, N-1] and j is in [i + 1, j + K + 1], and K is number of jumps allowed. 
 
Algorithm:
1. Create a dp[]  of size N and Initialize with a maximum value of Integer
2. Set dp[0]=0
3. We...read more
Answered by CodingNinjas
Add your answer