← Back to Directory

Visa interview notes, page 1 of 4

Large Enterprises

Most of these Visa write-ups come from Software Engineers (26), then Product Managers (7) and Data Scientists (3). The most reported rounds are the technical phone screen (17), the product sense round (4), the system design round (4) and the recruiter screen (4).

37 interview notes · updated Sep 2026

Visa·Product Manager·Onsite - Product Sense / Strategy

Apr 2026
Visa PM interview, one question deep into fraud detection for a specific geography. Pretty focused case, not a lot of fluff around it.
  • How would you detect a fraudulent transaction in a geography where most user spending happens online?

“I went straight to behavioral signals like velocity checks and device fingerprinting, but I think I underweighted the geography-specific angle.”

View Post

Visa·Product Manager·Recruiter / HR Screen

Apr 2026
Quick Visa PM screen, basically just one question about motivation for the company. Not much to report.
  • Why do you want to work at Visa?

“Pretty standard opener.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Visa coding round, one algorithm question the whole time. Pretty standard greedy problem but the pressure of explaining your reasoning out loud while coding makes it feel harder than it looks on paper.
  • Given an integer array where each element represents the maximum jump length from that position, determine whether you can reach the last index starting from index 0.

“I knew this one, which was a relief.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Visa SWE interview with a digit-DP problem that looks like a simple grouping question until you realize n can be up to a billion and brute force is completely off the table.
  • Given a large integer n (potentially up to 1e9 or more), compute the digit sum for every integer from 1 to n, group integers by their digit sum, and return how many distinct digit-sum groups share the maximum group size.

“My first instinct was to just iterate up to n and tally digit sums.”

View Post

Visa·Software Engineer·Onsite - System Design / Architecture

Apr 2026
Visa SWE interview with a system design question on building a login system. Pretty standard stuff but there's more to it than it sounds once you start thinking about auth flows and scale.
  • Design a user login system.

“Started with the basics, username/password, session tokens, and then they kept pushing.”

View Post

Visa·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Visa coding round for a Software Engineer role. One problem, LeetCode Hard territory, and I left feeling pretty beaten up about it.
  • Given a list of people, each with zero, one, or both of two specific skills and an associated cost, return an array where the value at index K represents the minimum total cost to select people such that at least K of them have both skills. Use -1 where it's not possible.

“It's a variant of a known LeetCode problem but the twist of returning answers for every K from 1 to n in one shot is what killed me.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Visa SWE interview with a coding question that's basically a variant of a well-known LeetCode problem, except they swap out the single parameter for three separate ones. Not a lot of context to go on from what I remember.
  • Solve a variation of a classic sliding window / dynamic programming problem where instead of one parameter k, you are given three distinct parameters that each constrain the solution differently.

“It's basically that well-known problem but they split k into three separate values, which changes the complexity a bit.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Visa coding interview, one question about string manipulation. Pretty standard stuff, nothing fancy about the setup.
  • Write a program to find all non-repeating characters in a string.

“Classic frequency count problem.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a software engineering role at Visa and got hit with a pretty meaty dynamic programming problem about counting distinct coin sums. The problem had enough layers to it that I was still thinking about edge cases after the call ended.
  • You have two arrays representing coin denominations and their available counts. How many distinct positive sums can you form using at most the given number of coins for each denomination? Walk through your algorithm, its time and space complexity, and how you'd handle cases where the maximum reachable sum gets very large (up to around 1 million).

“This is basically a bounded knapsack variant and I knew that going in, but the 'distinct sums' framing threw me for a second because I kept second-guessing whether I needed to track combinations or just reachability.”

View Post

Visa·Machine Learning Engineer·Technical Phone Screen

May 2026
Interviewed for an ML engineer role at Visa and got a geometry/algorithms problem that I wasn't expecting at all. Pretty standard technical screen vibe but the question itself was a classic comp sci problem I hadn't touched in a while.
  • Given an array of 2D points (x, y), write a function that returns the distance between the closest pair of points.

“I knew the brute force immediately, just check every pair and track the minimum.”

View Post