Visa Software Engineer interview questions

26 Software Engineers have shared notes from their Visa interviews, with the questions they were asked in each round. That is 70% of the 37 Visa interview notes on Screna AI.

26 Software Engineer interview notes

Visa·Software Engineer·Onsite - System Design / Architecture

Jul 2026
System design round at Visa for a software engineering role. Just one question but it had enough surface area to go in a lot of directions, which I found both freeing and kind of paralyzing.
  • Design a system that stores multiple images inside a single file, with support for efficient storage, retrieval, and metadata.

“I started with the obvious stuff, a container format with a header index, offsets per image, maybe a footer checksum.”

View Post

Visa·Software Engineer·Technical Phone Screen

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

“Knew it was Dijkstra the second I read the problem.”

View Post

Visa·Software Engineer·Technical Phone Screen

Jul 2026
Visa SWE interview, coding round with a string problem. Pretty standard stuff but the substring angle made me second-guess my approach midway through.
  • Given a string, how would you count the number of palindromic substrings it contains?

“Started with the brute force and they let me run with it for a bit before nudging me toward something better.”

View Post

Visa·Software Engineer·Hiring Manager Screen

Jun 2026
Interviewed at Visa for a program manager role, one round, one question about global team management. Pretty sparse as far as interviews go.
  • What experience do you have managing global teams?

“I rambled a bit.”

View Post

Visa·Software Engineer·Technical Phone Screen

Jun 2026
Visa SWE interview with a greedy optimization problem. Pretty clean question but the edge cases around when doubling actually helps took me a minute to think through properly.
  • Given two arrays of equal length and an integer k, where each index contributes min(a[i], b[i]) to a total sum, you can choose up to k indices to double b[i]. What strategy maximizes the total sum?

“My first instinct was just to sort by the gain from doubling, which is the right direction, but I fumbled on figuring out the actual gain formula.”

View Post

Visa·Software Engineer·Recruiter / HR Screen

Jun 2026
Applied as a new grad for a junior SWE role at Visa and skipped straight past the OA stage to a recruiter screen covering sponsorship, work model, and salary. Been radio silence for a week since and still no word on what comes next.
  • Do you require work sponsorship now or in the future?
  • Are you comfortable with a hybrid work arrangement?
  • What are your salary expectations for this role?

“Pretty standard gatekeeping question.”

View Post

Visa·Software Engineer·Technical Phone Screen

Jun 2026
Did a technical screen for a SWE role at Visa. One question on OOP vs procedural, pretty standard stuff, nothing too wild.
  • How does object-oriented programming differ from procedural programming?

“Knew this one but fumbled the explanation a bit.”

View Post

Visa·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Behavioral round at Visa for a SWE role. Pretty standard stuff, one question about team dynamics that I didn't feel great about afterward.
  • What kinds of teammates do you find challenging to work with?

“I fumbled this a bit.”

View Post

Visa·Software Engineer·Online Assessment (OA)

Jun 2026
Visa new grad OA with three HackerRank problems, two easy and one intermediate. Scored full marks on the first two but hit TLE on the third optimization problem, ending up at 36/40 total. Left wondering if that's enough to move forward.
  • Optimization problem requiring you to reduce an O(n^3) solution down to O(n^2).
  • Greedy algorithm problem, easier difficulty.
  • Another O(n^3) to O(n^2) optimization problem, intermediate difficulty.

“Got full marks on this one.”

View Post

Visa·Software Engineer·Online Assessment (OA)

Jun 2026
Visa OA for a software engineer role, three coding problems back to back. Nothing behavioral, just pure algorithm grind. The problems ranged from pretty approachable to genuinely tricky depending on how fast you see the key insight.
  • Given two arrays `a` and `b` of the same length and an integer `k`, each index contributes `min(a[i], b[i])` to a total score. You can pick up to `k` indices and double `b[i]` at each chosen index, changing that contribution to `min(a[i], 2 * b[i])`. Return the maximum total score.
  • Given an integer array and a positive integer `d`, count all index triplets `(i, j, k)` with `i < j < k` such that the sum of the three elements is divisible by `d`.
  • Given two integer arrays `A` and `B` of the same length, find the longest contiguous subarray where at each index you pick either `A[i]` or `B[i]`, and the chosen values form a non-decreasing sequence.

“My first instinct was greedy and it turned out to be right, but I second-guessed myself for way too long.”

View Post