Visa Interview Experience - SDE-1 Role
Interviewing at Visa was a mix of DSA challenges, graph-based reasoning and behavioral evaluation. The process tested not only coding ability but also how well you can model real-world problems and communicate your thought process. Here’s a detailed breakdown of my rounds.
Round 1: Online Coding Assessment
| Difficulty | Duration | Mode |
|---|---|---|
| Medium | 90 minutes | Remote (Codesignal) |
The first round was a timed online test with four coding problems, increasing in difficulty:
- Q1 & Q2 (Easy): Focused on basics like arrays, strings and number operations.
- Q3 (Medium/Hard): Required careful implementation, handling edge cases.
- Q4 (Hard): Optimization-heavy, designed to test deeper problem-solving under time pressure.
Tip: Pace yourself. Solve the easy ones cleanly, then move to the harder problems with structured thinking.
Round 2: Technical Interview 1
| Difficulty | Duration | Mode |
|---|---|---|
| Easy | 60 minutes | Remote |
Problem Statement:
Given a list of strings, construct a graph where the last character of one string connects to another string starting with that character. Detect if there's a cycle in the graph.
Example:
Input: `["abc", "def", "cfg", "gza"]`
Connections: `abc → cfg`, `cfg → gza`, etc.
My Approach:
- Modeled the problem using adjacency lists.
- Implemented cycle detection with DFS.
- Covered disconnected components and edge cases.
The interviewer appreciated the clarity in graph modeling and reasoning.
Round 3: Technical Interview 2
| Difficulty | Duration | Mode |
|---|---|---|
| Easy | 60 minutes | Remote |
Problem Statement:
Reconstruct a city travel path from given source → destination mappings and identify the true starting city.
Example Input:
Mumbai → Bangalore
Goa → Dehradun
Calcutta → Mumbai
Dehradun → Calcutta
Expected Output:
Goa → Dehradun → Calcutta → Mumbai → Bangalore
My Approach:
- Proposed a graph traversal using DFS.
- Discussed an alternative HashSet-based approach to track unique sources/destinations.
- Talked through edge cases and efficiency.
The interviewer liked the real-world analogy and systematic explanation.
Round 4: Hiring Manager Interview
| Difficulty | Duration | Mode |
|---|---|---|
| Easy | 45 minutes | Remote |
Questions Asked:
- Why Visa?
- Tell me about a time you made a mistake and what you learned.
- How do you plan to grow in your career?
The manager focused on mindset, adaptability and willingness to upskill.
Overall Experience
Visa's process felt balanced — DSA for coding ability, graph problems for reasoning and behavioral checks for mindset.
Key Takeaways:
- Graphs are critical. Be comfortable modeling real-world problems into graphs (cycle detection, path reconstruction).
- Online test ramps up fast. Don’t rush the easy problems. write clean, correct code before tackling harder ones.
- Behavioral rounds matter. Be honest about growth, mistakes and future aspirations.
Preparation Tips
- Revise graph fundamentals (DFS, cycle detection, topological sort, path reconstruction).
- Practice sliding window, arrays and string problems.
- For behavioral prep, align your answers with continuous learning and ownership.
In Interviews:
- Keep talking, share your thought process.
- Ask clarifying questions.
- Bring up optimizations proactively — shows depth of thinking.
