I applied online. The process took 3 weeks. I interviewed at Visa Inc. (Dallas, TX) in Aug 2022
Interview
2 rounds together. I passed first round. The tec senior SDE ask a tree question follow his rule to solve it. After that, he asked me use recursion to solve it instead of BFS.
Interview questions [1]
Question 1
implement small programming that the print from the edge of tree's value to root value.
Had two technical interviews, back to back. Medium leet code problems. Not that hard. After received an email that they did not proceed with me, but had other manager internally interested in my profile
First round OA
Second round interview in which I was given a dp question and then asked about my projects in detailing then we move to some oops and language based questions
The interview process started with a coding test from Hackerrank with 2 easy and 1 intermediate question. I found the questions to be rather difficult given that you are not allowed to use google or check syntax.
Interview questions [1]
Question 1
The asked me to implement LFU cache with lower complexity than o(n)