I applied through college or university. The process took 2 weeks. I interviewed at Visa Inc. (New Delhi) in Oct 2025
Interview
it was on campus drive held in my college on 28 october 2025, the selection is based on two rounds, oa and one technical interview, oa includes 4 questions, 2 are simples from array, and two was dp questions.
i cleared oa, technical interview was a good experiences, a dsa question of dynamic programming(frog jumps in k islands) was asked, i tell him approach.
Interview questions [1]
Question 1
also he asked a situational question that how can you think a different process on your project.
I applied through college or university. I interviewed at Visa Inc. (Bengaluru)
Interview
The interview lasted around 30 minutes. It started with a coding question, and I was given about 5 minutes to solve it. After that, the interviewer asked a logical puzzle, followed by questions on Object-Oriented Programming concepts. I was then asked to implement inheritance in Java. Finally, I was given a binary search problem and was expected to explain the approach from the brute-force solution to the optimal solution while discussing the time complexity of each approach. Overall, the interview focused on coding, problem-solving, Java fundamentals, and algorithm optimization.
Interview questions [1]
Question 1
Coding Question: Given two integers a and b, generate a string containing the characters 'a' exactly a times and 'b' exactly b times such that no character appears more than two times consecutively.
I applied online. I interviewed at Visa Inc. (Warsaw, Masovia)
Interview
Reasonable interview. Basic implementation of DSA such as implement a Stack in your preferred IDE. Some theory questions regarding the coding language such as types and defaults. Ex. what are possible visibility keywords in Java and what is the default
Interview questions [1]
Question 1
Ex. what are possible visibility keywords in Java and what is the default
2 medium (string, arrays) and 1 dictionary (hard problem). all leetcode level questions. Interview was in hacker rank with camera on.
The Challenge: Design a data structure to store the strings' count with the ability to return the strings with minimum and maximum counts. Implement a class that increments a string's count, decrements a string's count, gets the key with the maximum count, and gets the key with the minimum count—all in \(O(1)\) time complexity.