VISA | SDE Intern | Bengaluru | Sept 2022
Anonymous User
739

2024 Grad
Education: B.Tech from Tier-1 college (Non NIT, IIT)

Visa was one of the first companies to visit my college for campus placements. The interview process basically consisted of 2 rounds, 1 OA and 1 [Technical + HR] interview.

ROUND 1: Online Assessment

The assessment was conducted in the hackerrank platform. The assessment consisted of 2 questions, the time given was 1 hour. Both the questions were medium-hard and involved the usage of graphs and dp.

Number of participants in this round: ~400
Number of people selected for the next round: ~20

ROUND 2: Online Interview [Technical + HR]

The interview started off with the interviewer asking me to tell me about myself. Then I was asked about my projects (which were very unimpressive) so i was quick to shift the interviewer's focus towards my habit of doing CP and went on to tell them about a few of my achievements. I was then given 2 questions to solve using the hackerrank code pair platform. Both the questions were straight out of leetcode. Both of them were medium but one of them was a tad bit tricky as the interviewer expected an efficient answer. After I managed to solve both of them, we talked about the work culture at Visa for a bit and the interview ended.

The results were announced the same day and out of the ~20 people, around half of the people got the intern offer.

Questions asked in Online assessment:

  1. Find the number of pairs of elements in an array such that their sum is within the range [x,y]. Normal brute force will lead to a TLE, binary search is needed.

  2. Given an array of integers denoting the height of each building, for each building, find the number of buildings visible to its left and right. It goes something like that, but I think you guys will get what I mean.

Questions asked in Technical interview:
The first question was 56. Merge Intervals (https://leetcode.com/problems/merge-intervals/).
The second question was 1123. Lowest common ancestor of deepest leaves. (https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/).
As I said, direct leetcode questions. I was given 45 minutes to do these questions. I was asked to code it up, and then conduct a dry run on test cases that I chose, followed by running the code on test cases the interviewer chose.

Comments (2)