System designLast seen Oct 2026
Design an Inventory Management Service
Design an authoritative inventory service that supports safe point adjustments and large asynchronous file-based updates.
Open practiceVisa interview practice
Visa Coding Interview Questions and Assessment Practice Start with verified evidence.
Practice from 75 Visa-tagged public coding problems, organized only by the stage, topic, difficulty, and recency metadata FastPrep can verify. The broader public catalog also includes 2 system-design exercises.
- Catalog
- 77 public practice assets (75 coding)
- Start here
- Use the stage named in your invitation
- Evidence
- OA · Phone · Onsite metadata, shown in context
OA practice path
Online Assessment
Build a timed implementation rhythm from prompt to edge cases. Problems are ranked by repeated public catalog sightings.
72 Visa-tagged Online Assessment problems available.
| Company | Problem | Difficulty | Public evidence | Action |
|---|---|---|---|---|
VIVisa | Minimum Values with Even Powers of TwoArrayMath | Medium | 4 public reportsLast reported Sep 2026 | Practice |
VIVisa | Distinct Chapters Missed During a Cyclic AbsenceMathSimulation | Easy | 3 public reportsLast reported Sep 2026 | Practice |
VIVisa | Maximum Non-Decreasing Array LengthArrayDynamic Programming | Hard | 3 public reportsLast reported Sep 2026 | Practice |
VIVisa | Sum of Index-Ordered Pair DifferencesArrayMath | Medium | 3 public reportsLast reported Sep 2026 | Practice |
VIVisa | Planning ProductionGreedySorting | Medium | 3 public reportsLast reported Sep 2026 | Practice |
VIVisa | Subarray SumArrayMath | Easy | 3 public reportsLast reported Sep 2026 | Practice |
VIVisa | Format a Centered Newspaper PageStringGreedy | Medium | 3 public reportsLast reported Dec 2025 | Practice |
VIVisa | Maximum Equalized Substrings After One Adjacent SwapStringPrefix Sum | Medium | 2 public reportsLast reported Sep 2026 | Practice |
VIVisa | Optimal TransferGraphGreedy | Hard | 2 public reportsLast reported Sep 2026 | Practice |
VIVisa | Total Server DowntimeArraySorting | Easy | 2 public reportsLast reported Sep 2026 | Practice |
VIVisa | Minimum Anagram PeriodStringHash Table | Medium | 2 public reportsLast reported Sep 2026 | Practice |
VIVisa | Maximum Server Processing TimeArrayDynamic Programming | Hard | 2 public reportsLast reported Aug 2026 | Practice |
VIVisa | Distribution Center Package AllocationArraySimulation | Medium | 2 public reportsLast reported Dec 2025 | Practice |
VIVisa | Count Attack Vectors by Divisor RangeArrayMath | Medium | 1 public reportLast reported Oct 2026 | Practice |
VIVisa | Longest Non-Decreasing Substring After Pair SwapsStringGreedy | Medium | 1 public reportLast reported Oct 2026 | Practice |
VIVisa | Minimum Operations to Reduce a Transaction LedgerStringHash Table | Easy | 1 public reportLast reported Oct 2026 | Practice |
VIVisa | Count Valid Space-Delimited WordsStringParsing | Easy | 1 public reportLast reported Oct 2026 | Practice |
VIVisa | Earliest Common Meeting StartArrayIntervals | Medium | 1 public reportLast reported Oct 2026 | Practice |
VIVisa | Maximum Index-Weighted Sum with Disjoint SwapsArrayDynamic Programming | Hard | 1 public reportLast reported Oct 2026 | Practice |
VIVisa | Minimum Power-of-Two Removal OperationsArrayMath | Medium | 1 public reportLast reported Sep 2026 | Practice |
Phone practice path
Phone Screen
Practice solving while explaining assumptions, tradeoffs, and complexity. Problems are ranked by repeated public catalog sightings.
| Company | Problem | Difficulty | Public evidence | Action |
|---|---|---|---|---|
VIVisa | Find the Intersection Node of Two Linked ListsLinked ListTwo Pointers | Easy | 1 public reportLast reported Sep 2026 | Practice |
VIVisa | Sort ColorsArraySorting | Medium | 1 public reportLast reported Sep 2026 | Practice |
Onsite practice path
Onsite
Practice complete solutions and defend the choices behind them. Problems are ranked by repeated public catalog sightings.
| Company | Problem | Difficulty | Public evidence | Action |
|---|---|---|---|---|
VIVisa | Longest Increasing Path in a MatrixArrayMatrix | Hard | 1 public reportLast reported Sep 2026 | Practice |
01 · Preparation plan
Move from counting pairs to traversing weighted state.
Visa's coding catalog supports preparation across counting, simulation, and graph search. Pair frequency accounting is a useful warm-up before grid movement and weighted paths. The page covers technical practice, not payment-network architecture or a universal Visa assessment format. This is a suggested practice sequence, not the employer's interview process. Your invitation and recruiter guidance remain the source of truth.
- 01
Count pairs with multiplicity
Use cross-array target-sum pairs to distinguish counting all matches from returning unique values. Frequency maps make repeated inputs part of the solution rather than an edge-case patch.
- Test duplicated values in both arrays.
- Use a wide type for the pair count.
- Avoid mutating one array's counts unintentionally.
- 02
Model movement and teleport transitions
The grid-walk exercise asks for a precise transition model. Distinguish ordinary movement, blocked cells, and teleport behavior before choosing a traversal strategy.
- Trace a teleport followed by an obstacle.
- Define repeated-state behavior from the contract.
- Validate coordinates before accessing the grid.
- 03
Choose shortest paths by edge semantics
Use the weighted undirected graph exercise to explain why ordinary breadth-first search is insufficient for unequal costs. Make the algorithm's weight assumptions explicit.
- Skip obsolete priority-queue entries.
- Test unreachable vertices and parallel choices.
- State the nonnegative-weight requirement.
02 · Broader technical practice
Practice beyond standalone coding questions.
These public Visa-tagged exercises cover additional technical formats. They are included only when a verified catalog record and a crawlable practice page both exist.
System designLast seen Aug 2026
Design an E-Commerce Top-Spender Query
Model a compact relational commerce dataset and design a correct, index-aware query for the ten highest-spending users in a trailing thirty-day window.
Open practice03 · Evidence boundary
What “Visa interview questions” means here.
It means practicing transferable implementation, testing, and technical reasoning with public catalog assets FastPrep tags to Visa. It does not mean FastPrep has access to the company's assessments or any private interview bank.
Repeated public sightings and last-reported dates can help you prioritize practice, but they cannot predict the questions, format, or platform in a specific interview.
- Only Visa-tagged FastPrep catalog problems appear above.
- Stage labels and report dates remain visible as context.
- No official, private, leaked, or proprietary questions are claimed.
04 · Plain answers
Visa interview practice questions, answered plainly.
This page owns technical-practice intent for Visa. Hiring activity, timelines, and market signals remain on the separate hiring-insights page.
01Do these Visa problems require payment-industry knowledge?
The selected exercises are grounded in their stated programming inputs, outputs, and constraints. They do not require access to a payment network or confidential financial data. Any domain-specific interview expectations should come from the actual role; a company-tagged algorithm is not evidence of a payments syllabus.
02Is FastPrep affiliated with Visa?
No. FastPrep is an independent interview-preparation product and is not affiliated with Visa. The page uses FastPrep's public practice catalog and does not claim official, private, leaked, or proprietary employer questions.
03How are Visa problems assigned to interview stages?
Stage labels come from FastPrep's public problem metadata. A problem can carry more than one reported stage, and hiring processes can change by role, level, location, and date. Treat the labels as preparation context, not a guarantee.
04Which Visa interview stage should I practice first?
Start with the stage named in your invitation or recruiter message. If no stage is known, use the largest available set to build general problem-solving fluency, then rehearse explanation and testing separately.
05Does this page predict the Visa interview process?
No. Public catalog counts, stage tags, and last-reported dates can help prioritize practice, but they cannot predict a specific interview's questions, sequence, timing, or platform.
Your next stage, made concrete
Pick a problem. Solve it end to end.
Start with the stage named in your invitation, then use public evidence as context—not as a promise of what you will be asked.
Open the practice set