Visa OA (2-Month SDE Intern)
Summary
I recently completed Visa's Online Assessment for a 2-month SDE Intern position. The assessment involved four coding challenges, from which I successfully solved three completely and made good progress on the remaining one, achieving a score of 531 out of 600. I am now awaiting the results of this round.
Full Experience
I had the opportunity to participate in Visa's campus recruitment drive for a 2-month SDE Intern role, which included an Online Assessment. The OA was structured with a 70-minute time limit and presented four distinct coding problems: two easy, one medium, and one hard. I focused my efforts on solving each problem efficiently. I managed to fully solve three of the four questions within the time limit and made substantial progress on the fourth one. My final score for the assessment was 531 out of a possible 600. I'm currently in the process of waiting for an update regarding the next stages of the interview.
Interview Questions (4)
Return the sum of elements in the array that are greater than both of their neighbors.
Given two sorted arrays representing departure times of two spaceships and an integer mission, find the time required to complete the mission.
(For each element in array1, pick the next greater element from array2. Repeat this mission times and return the end time).
Very similar to LeetCode 68. Text Justification, but instead of left-aligning words, we had to center-align them.
(Implementation heavy).
Given an array nums and an integer k, find the number of contiguous subarrays that contain at least k distinct elements.
(Note: repeated elements in a subarray don’t count as distinct).