← Back to Directory

Visa

Large Enterprises

Screna has 10 Visa interview write-ups. The most reported round is the technical phone screen (8).

10 interview notes · updated Jun 2026

Visa·Software Engineer·Onsite - Coding / Algorithms

Jun 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 where each person has up to two skills (skill 1 and skill 2) and an associated cost, return an array of minimum costs where the K-th element represents the minimum cost to select people such that at least K of them have both skills. Use -1 if it's not possible. Solve for all K from 1 to N.

“Felt defeated walking out.”

View Post

Visa·Software Engineer·Technical Phone Screen

Jun 2026
Visa SWE interview had at least one algorithmic problem that looked straightforward but needed a bit of greedy thinking to get right. Pretty standard coding round vibe.
  • You're given two arrays of equal length and an integer k. Each index contributes min(a[i], b[i]) to a running total. You can choose up to k indices to double the value of b[i], which changes that index's contribution to min(a[i], 2*b[i]). Return the maximum possible total sum.

“My first instinct was to just double the k largest b values, which is wrong.”

View Post

Visa·Software Engineer·Technical Phone Screen

May 2026
Visa SWE interview with a coding question that's basically a LeetCode problem but with three different k parameters instead of one. Pretty thin on details but the core problem is recognizable if you've done similar variations.
  • Solve a problem similar to a well-known LeetCode stock/subarray problem, but extended with three distinct k parameters instead of one.

“The base version of this problem is pretty standard prep material, but adding three separate k parameters changes the state space significantly.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Visa coding round, one algorithm question, pretty standard stuff for a software engineer screen. The problem itself wasn't brutal but the expectation to arrive at a greedy solution cleanly under pressure is its own thing.
  • 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.

“Classic jump game.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Visa SWE interview with a DP problem that looked familiar but had a twist that threw me off more than I'd like to admit.
  • You're given an array of binary strings and two integers m and n. Find the largest subset of those strings where the total number of zeros is at least m and the total number of ones is at least n. Each string can only be used once. Return the maximum subset size.

“I recognized the 2D knapsack shape right away from LeetCode 474 and started setting up the DP table almost on autopilot.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Visa SWE interview with a digit-DP problem that looks deceptively like a known LeetCode problem until you see the constraints. The brute force path is a trap you'll only notice if you've thought about scaling before.
  • Given a large integer n (up to 1e9 or more), group all integers from 1 to n by their digit sum. Find how many distinct digit-sum groups share the maximum group size.

“Looks like a simple counting problem at first.”

View Post

Visa·Software Engineer·Technical Phone Screen

Apr 2026
Visa coding round for a software engineer role. One algorithmic problem, fairly tricky to get right under pressure.
  • You're given two arrays A and B of the same length. Find the longest contiguous subarray where, at each index, you can pick a value from either A or B, such that the chosen values form a non-decreasing sequence.

“This one took me a minute to even parse correctly.”

View Post

Visa·Software Engineer·Onsite - System Design / Architecture

Apr 2026
System design round at Visa for a software engineer role, basically one long deep dive into designing a ride-hailing platform from scratch. The scope was wide and the follow-ups kept coming.
  • Design a ride-hailing service like Uber. Walk through the full system including functional requirements, non-functional requirements, and major architectural components.
  • How would you handle nearest-driver lookup at scale? Compare different geospatial indexing approaches.
  • Millions of drivers are sending location pings every few seconds. How do you design the ingestion pipeline to handle that volume?
  • How do you prevent two drivers from being matched to the same rider simultaneously?
  • How would you model the ride state in your data layer, and how would you shard the data?
  • How does your design handle sudden traffic bursts, like a major event ending and thousands of people requesting rides at once?

“I started with the ride lifecycle which felt natural but I spent way too long on it before getting to the interesting stuff.”

View Post

Visa·Software Engineer·Technical Phone Screen

Mar 2026
Visa SWE interview had at least one coding problem that looked straightforward until you actually had to nail the time complexity. The binary search angle wasn't obvious to me at first and I think it showed.
  • Given a sorted integer array, an integer k, and a target value x, return the k closest elements to x in the array, sorted in ascending order. For ties, prefer the smaller value.

“My first instinct was to just binary search for x and then expand outward with two pointers, which works but I fumbled explaining the complexity.”

View Post

Visa·Software Engineer·Technical Phone Screen

Mar 2026
Visa SWE interview with a graph problem. Pretty standard algorithmic round, nothing too surprising.
  • Given a directed weighted graph, find the shortest path between two nodes.

“Knew it was Dijkstra pretty fast, which was a relief.”

View Post