I applied online. The process took 3 weeks. I interviewed at Visa Inc. (Singapore) in Mar 2018
Interview
Started with a coding test on HackerRank which was relatively simple.
First round interview with two other associates two weeks after the assessment. It was quite informal and manageable.
Second round of interview was with the tech lead, this interview was informal as well and was catered to find out more if I was a good fit.
Interview questions [1]
Question 1
Coding questions include writing/explaining recursive functions on the whiteboard and out of the box questions
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.