Get AmbitionBox App
Faster and better experience!
AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Visa Software Developer Interview Questions and Answers
11 Interview questions
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 featur...
A binary tree is a data structure in which each node has at most two children.
Start with a root node
Each node has a left and right child
Nodes can be added or removed
Traversal can be done in-order, pre-order, or post-order
A Singleton class is a class that can only have one instance at a time.
It restricts the instantiation of a class to a single object.
It provides a global point of access to that instance.
It is often used in situations where a single object is required to coordinate actions across a system.
Example: Database connection manager, Configuration manager, Logger manager.
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 possibl...
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
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. E...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.
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 elements...
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.
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 num...
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.
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; otherwi...
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.
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 ma...
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...
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 co...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.
Visa Software Developer Interview Experiences
11 interviews found
Anonymous
I applied via Campus Placement
One medium and one standard DP question
(1 Question)
- Q1. Medium level question based on binary search
(2 Questions)
- 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...
- 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.
(2 Questions)
- Q1. Puzzles available on GFG
- Q2. Behavioral question
Interview Preparation Tips
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Feb 2024. There was 1 interview round.
2d grid , 4 questions easy to medium
Selected
I applied via Company Website and was interviewed in Jan 2024. There were 3 interview rounds.
SQL core Java Angular React Spring Boot
SQL Core Java Angular React Spring Boot
(1 Question)
- Q1. SQL Core Java Angular React Spring Boot
Interview Preparation Tips
I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.
The questions were medium-difficult level
Selected
I applied via Campus Placement and was interviewed before Jul 2022. There were 3 interview rounds.
It had 4 questions of moderate difficulty
(3 Questions)
- Q1. He went deep into my resume and asked questions from each line of it
- Q2. Then he asked me that why you have only passed 10/14 test cases in 4th question
- Q3. I said it was from dp and I had not studied dp properly
Interview Preparation Tips
- Data Structures
- Web Development
I appeared for an interview in Dec 2020.
(2 Questions)
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...
- 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...
- Q2.
Count Pairs with Given Sum
Given an integer array/list
arrand 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... - 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.
Interview Preparation Tips
Tip 1 : Prepare data structures and algorithms thoroughly and practice atleast 2 to 3 questions daily for 4-5 months consistently.
Tip 2 : Have few good projects in your resume and also prepare your core subjects like Operating System, DBMS.
Tip 3 : Before interview do a little research about the company.
Tip 1 : Mention at least 2 good projects.
Tip 2 : You should be able to defend whatever you have put on your resume so don't mention anything false.
Skills evaluated in this interview
I appeared for an interview in Nov 2020.
(2 Questions)
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...
- 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.
- 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...
- 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.
(1 Question)
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... - 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.
(1 Question)
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
Scontaining only three types of characters:('),)'), and*.Explanation:
A Valid String is characterized by the following conditions:
1. ... - 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.
Round duration - 60 minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : Work on your problem-solving skills. Solve as many questions as you can.
Tip 2 : Communication skills are very important in interviews.
Tip 3 : Do some good projects.
Tip 1 : Mention some good projects on your resume and be prepared.
Tip 2 : Do not put false things on your resume.
Skills evaluated in this interview
I appeared for an interview in Dec 2020.
(1 Question)
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
ARRof 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... - 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
Interview Preparation Tips
Tip 1 : Ability to apply data structures in questions(practice graph and Tree questions)
Tip 2 : Thorough knowledge of the projects done
Tip 3 : Good knowledge about computer science concepts
Tip 1 : Mention projects that you have done yourself and are thorough with
Tip 2 : mention soft skills
Skills evaluated in this interview
Pranav Bhat Thirthahalli
Interview Questionnaire
14 Questions
- Q1. What is race condition and how can it be eliminated
- Ans.
Race condition is a situation where multiple threads/processes access and manipulate shared data simultaneously.
It can be eliminated by using synchronization techniques like locks, semaphores, and mutexes.
Another way is to use atomic operations that ensure the data is accessed and modified atomically.
Using thread-safe data structures can also prevent race conditions.
Example: Two threads trying to increment a shared var...
- Q2. What is JCube?
- Ans.
JCube is a Java library for creating and manipulating Rubik's Cube puzzles.
JCube provides classes for representing Rubik's Cube puzzles and algorithms for solving them.
It supports various cube sizes and can generate random scrambles.
JCube can be used in Java applications or as a standalone command-line tool.
It is open source and available on GitHub.
- Q3. What is regression testing?
- Ans.
Regression testing is the process of testing changes made to a software application to ensure that existing functionality still works.
It is performed after making changes to the software
It ensures that existing functionality is not affected by the changes
It helps to catch any defects or bugs that may have been introduced
It can be automated using testing tools
Examples include retesting after bug fixes, testing after new...
- Q4. Discussion on different sorting techniques
- Q5. Discussion on SQL and SQL optimisaion
- Q6. Software engineering principles
- Ans.
Software engineering principles are the best practices and guidelines for developing high-quality software.
Software should be designed with modularity and scalability in mind.
Code should be well-documented and easy to read.
Testing and debugging should be an integral part of the development process.
Version control should be used to manage code changes.
Security and privacy should be considered throughout the development ...
- Q7. Java and OOP's question
- Q8. Define Singleton class
- Ans.
A Singleton class is a class that can only have one instance at a time.
It restricts the instantiation of a class to a single object.
It provides a global point of access to that instance.
It is often used in situations where a single object is required to coordinate actions across a system.
Example: Database connection manager, Configuration manager, Logger manager.
- Q9. Explain Testing principles and Design principles
- Ans.
Testing principles ensure software quality, while design principles guide software development.
Testing principles include unit testing, integration testing, and acceptance testing.
Design principles include SOLID, DRY, and KISS.
Testing principles ensure that software meets requirements and is free of defects.
Design principles guide software development to be modular, maintainable, and scalable.
- Q10. Types of machine learning and methods and examples, they may give you a situation and ask you which technique is good and why
- Q11. Why choose you for VISA?
- Ans.
I have the necessary skills, experience, and passion to contribute to VISA's success.
I have a strong background in software development and have worked on projects similar to those at VISA.
I am a quick learner and can adapt to new technologies and programming languages easily.
I am passionate about creating high-quality software that meets the needs of users and exceeds their expectations.
I am a team player and can work...
- Q12. Which profile is good for you?
- Ans.
A profile that challenges me to learn and grow while allowing me to contribute to a team.
A position that encourages continuous learning and development
A role that allows me to collaborate with a team and contribute to projects
A company culture that aligns with my values and work ethic
- Q13. About the work culture at VISA Inc
- Q14. If u already have a placement, why this company
- Ans.
I am interested in exploring new opportunities and challenges that this company can offer.
I am impressed with the company's reputation and growth potential.
I am excited about the projects and technologies this company is working on.
I believe this company can provide me with a better work-life balance and career growth opportunities.
I am looking for a company culture that aligns with my values and goals.
I am open to exp...
Interview Preparation Tips
Experience: Online Test on mettl.com
- 2 coding questions ( 15*2 = 30 marks ) - Moderate level
- 10 MCQs on Programming and Java ( 1*10 = 10)
- 6 MCQs on Machine Learning and Hadoop ( 1*6 = 6 )
- 6 MCQs on Computer Networks ( 1*6 = 6 )
- 6 MCQs on Computer Infrastructure and Architecture ( 1*6 = 6)
- 6 MCQs on Application security and Cryptography ( 1*6 = 6)
15 shortlisted from here including 8 B.Techs and 7 M.Techs for F2F interviews, which were taken by VISA employees from their US and Singapore offices( since they don't have any office at India ).
Round: Technical Interview
Experience: They may give you a situation and ask you to explain which Software engineering principles will you use. They ask you how will you explain the concept of stacks and queues to a 7 year old, or to a granny, so as to encourage programming(like seriously ? )
General Tips: Nothing as such, since this was my second on-campus placement, I had good experience of interviews.
Keep your fundamentals in all computer science subjects open. Unlike other companies they don't focus much on coding alone. The only other company which also looks at perfection in all computer science aspects is Xerox Research Center India.
Challenging and Equally rewarding, but seriously a unique experience with no much tension
Skills:
College Name: NIT Surathkal
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Tell me about your project ( written in language)?
- Ans.
Developed a web application using Python and Django framework for managing inventory and sales.
Used Python programming language for backend development
Implemented Django framework for building web application
Designed database schema for inventory and sales data
Integrated frontend using HTML, CSS, and JavaScript
Implemented user authentication and authorization features
Interview Preparation Tips
Experience: They asked 3 question on data structures .
1.Merging linekd list
2 and 3 BST related
Duration: 1 hour
Total Questions: 3
Round: Technical Interview
Experience: Interviewer asked me to explain projects which I had mentioned in Resume. Then He asked me to implement a problem on basis of my project.
It was telephonic round.
CGPA and my project mattered.
College Name: IIT Roorkee
Top trending discussions
Visa Interview FAQs
Tell us how to improve this page.
Visa Interviews By Designations
- Visa Software Engineer Interview Questions
- Visa Senior Software Engineer Interview Questions
- Visa Software Developer Interview Questions
- Visa Data Scientist Interview Questions
- Visa Software Engineer Intern Trainee Interview Questions
- Visa Data Engineer Interview Questions
- Visa Staff Engineer Interview Questions
- Visa Product Manager Interview Questions
- Show more
Top Skills for Visa Software Developer
Software Developer Interview Questions from Similar Companies
Visa Software Developer Reviews and Ratings
based on 6 reviews
Rating in categories
|
Senior Software Engineer
659
salaries
|  ₹14.5 L/yr - ₹45 L/yr |
|
Software Engineer
369
salaries
| ₹7.8 L/yr - ₹30 L/yr |
|
Staff Software Engineer
184
salaries
| ₹24 L/yr - ₹61 L/yr |
|
Staff Engineer
99
salaries
| ₹19.2 L/yr - ₹64 L/yr |
|
Senior Data Engineer
99
salaries
| ₹20 L/yr - ₹45 L/yr |
MasterCard
American Express
Paytm
FIS
- Home >
- Interviews >
- Visa Interview Questions >
- Visa Software Developer Interview Questions
