visa logo
Visa· SDE-1

Visa Virtual Interview SE-1

Location
Virtual
Experience
1.83 years
Posted
23 May 2025
371 reads

Summary

I shared my virtual interview experience with Visa for an SDE-1 role, which consisted of 4 rounds: an online coding test, two technical interviews, and a hiring manager round.

How it went

Hi all, I just wanted to share my Visa interview experience with you all. Total it had 4 rounds.

Current experience : 1 year 10 months Current title : SDE-1

1st round - Online coding test on Codesignal. 2nd round - First technical interview. 3rd round - Second technical interview 4th round - HM round.

1st round :

I dont exactly remember the questions but the first 2 problems are gonna be easy level questions. 3rd question would be medium to hard. 4th question would be hard to tackle.

2nd round : First technical interview was scheduled where a question on graphs was there.

Question : You have been given a list of Strings where the logic of building adjacency list would be using the first and last letters of the string. For example : "abc","def","cfg","gza" Then abc is connected to cfg because the last letter of string abc is c and the first letter of cfg is 'c'.

The question was to find a cycle whether it exists in this graph or not.

3rd round : Second technical interview was scheduled right after the second round on the same day itself.

Question : Given String in the input with source and destination cities. For example : "Mumbai" -> "Bangalore", "Goa" - > "Dehradun", "Calcutta"->"Mumbai", "Dehradun"->"Calcutta"

Here i had to find the source station starting from any city, that would complete the travel of all the cities mentioned. i.e. the answer for this question would be "Goa"->"Dehradun","Dehradun"->"Calcutta", "Calcutta"->"Mumbai", "Mumbai"->"Bangalore" Here i am able to visit all the cities and this is the only possible answer for this question.

I told the graph approach using DFS, but there is also one HashSet approach to this.

4th round : Last round was conducted by the hiring manager, he asked some behavioural questions and just wanted to check if I wanted to learn and grow in my career.

That's all for this interview experience.

Questions asked (2)

  1. 01

    Detect Cycle in String Graph

    Data Structures & Algorithms

    You have been given a list of Strings where the logic of building adjacency list would be using the first and last letters of the string. For example : "abc","def","cfg","gza" Then abc is connected to cfg because the last letter of string abc is c and the first letter of cfg is 'c'. The question was to find a cycle whether it exists in this graph or not.

  2. 02

    Find Travel Itinerary from Tickets

    Data Structures & Algorithms

    Given String in the input with source and destination cities. For example : "Mumbai" -> "Bangalore", "Goa" - > "Dehradun", "Calcutta"->"Mumbai", "Dehradun"->"Calcutta" Here i had to find the source station starting from any city, that would complete the travel of all the cities mentioned. i.e. the answer for this question would be "Goa"->"Dehradun","Dehradun"->"Calcutta", "Calcutta"->"Mumbai", "Mumbai"->"Bangalore" Here i am able to visit all the cities and this is the only possible answer for this question.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Visa recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!