The Visa OA on HackerRank and CodeSignal
- Know which Visa OA you'll likely get in 2026, CodeSignal or a HackerRank tier, and its length
- Know what a Visa OA score gets you and what it does not
- Solve the recurring CodeSignal set: bus departure, newspaper layout, odd zeros and memory allocation
- Solve the two-schedule mission problem and the binary palindrome count
Most Visa software engineering loops open with an online coding test, and it decides whether you get to the interviews at all. The test switched platforms this year. Through January 2026 most candidates sat a CodeSignal assessment of four problems in 70 minutes, scored out of 600, and CodeSignal sets were still reported in March and August 2026. From February 2026 most reports describe a HackerRank "Technical Skills Assessment" in named tiers, from Beginner up to Expert.
The questions repeat more than you'd expect. A bus departure problem, a newspaper text layout, a count of numbers with an odd number of zeros and a memory allocator kept turning up in four-problem sets from mid-2025 into March 2026. Those four lead the problems below. Next comes a two-schedule problem from a 2025 CodeSignal test and the 2026 campus drives, then the one HackerRank tier problem with a known statement. Each one runs in the editor against tests, and each carries the dates it was asked.
How the Visa OA works
- Platform: HackerRank since Feb 2026. Mostly CodeSignal through January 2026, and CodeSignal sets were still reported in February, March and August 2026. One November 2026 report names HackerEarth.
- Length: 2 to 4 problems, 70 to 90 min. CodeSignal gave four problems in 70 minutes. Senior and staff HackerRank tests run two or three problems in about 90 minutes.
- Score: Out of 600 on CodeSignal. Each problem scores up to 300. The raw total out of 1,200 becomes a final score out of 600, and Visa publishes no cutoff.
- Proctoring: Webcam, mic, screen, ID. Described in detail for the CodeSignal sittings in late 2025. An October 2026 Senior candidate also describes a proctored test.
The Visa CodeSignal OA (four problems, 70 minutes)
The CodeSignal version follows the General Coding Assessment shape. Two quick warm-ups come first, then a longer implementation problem and a harder fourth one. A US SDE1 candidate in November 2025 finished the first problem in ten minutes with five lines of code and spent about 30 minutes on the second. Each problem is worth up to 300 points. A December 2025 senior candidate saw a raw 910 of 1,200 become a final 503 of 600, and the conversion isn't published. The platform itself, its editor and how the GCA is scored are covered in the CodeSignal assessment guide.
Proctoring was strict. Candidates in the US and India describe webcam, microphone and screen sharing, plus a photo ID check. In November 2025 one candidate got an email asking them to retake the test. It pointed to irregularities in their typing pattern and to their eyes leaving the screen. Type your code live, don't paste it in, and keep your eyes on the screen.
The Visa HackerRank assessment (since February 2026)
From February 2026 the invites name a HackerRank "Technical Skills Assessment" with a tier attached: Coding - Beginner, Intermediate, Advanced or Expert. Visa hasn't published which tier goes to which level, so the mapping comes from what candidates got. Intern and new grad candidates reported Intermediate in February and March 2026. A UK graduate got a Beginner test in June. A senior candidate's Advanced invite promised one intermediate and one advanced question, and an Expert test in February had three problems in 90 minutes.
Senior and staff tests can run harder. A July 2026 staff candidate got two medium-to-hard problems in 90 minutes, something like a graph connectivity question and a cost-minimizing DP. An August 2026 Senior candidate got a medium plus a hard graph problem in the same time. In October 2026 a Senior candidate had three problems in 90 minutes under proctoring. Apart from the palindrome problem below, only the shapes of the tier tests are known so far, so practice the shapes: a graph problem and a DP problem at medium to hard.
The September to November 2026 campus drives in India used three-question sets, 75 minutes at one college, and they have their own lesson. Not everyone moved to HackerRank. An August 2026 Software Engineer I candidate describes a four-problem CodeSignal test, and a November 2026 .NET candidate got the test on HackerEarth, with one easy and two medium problems. Check the link in your invite before you assume the platform.
What your Visa OA score gets you
A pass usually leads to two technical interviews and then a hiring manager round. Things move fast once you're in. A November 2026 candidate waited about two weeks for the test link, a week for the result and only two days for scheduling.
The score never decides it alone. The rejection at 567 of 600 and the silence after a perfect 600 both date from December 2025, and the candidate who solved all four in February 2026 was rejected too. No cutoff has been published. One 2024 staff candidate wrote that you need at least 389, but that's one person's claim from two years ago. Treat full marks as the goal, since nothing below it is known to be safe.
How to work the Visa OA clock
On a four-problem CodeSignal test, bank the first two fast. A March 2025 staff candidate said the best chance of clearing everything was getting the first two done as soon as possible. Another candidate that month, who found the mediums heavy on implementation, advised the order 1, 2, 4, 3. The HackerRank tiers give you fewer problems and more time for each, so read every statement first and start with the one you can finish.
Pick the language you type fastest in. Visa's live rounds lean on Java in India, but the OA only runs your code against tests. Use whatever lets you write a parser and a loop without thinking about syntax.
The recurring CodeSignal problems are careful implementation more than algorithms. You parse a clock time into minutes, keep a line under a width, or scan memory for a free run. Points go to whoever gets the edge cases right: the bus leaving at exactly the current time, the odd space left over, the block that only fits after a release.
Asked at Visa
A March 2026 Senior candidate's CodeSignal set was bus departure, numbers with odd 0s, allocate memory and a fourth called "view gap mountain, find minGap". The first three also appear in an October 2025 on-campus set, and the bus problem in two more tests. Below are six problems, from most reported to least. Each of the first five has at least two reports. A palindrome count from a February 2026 HackerRank Expert test closes the set with one.
Other tests had questions of these shapes:
- A medium plus a hard graph problem. Four reports from March 2025 to August 2026 mention graph or matrix questions, from a grid much like counting a Premium question to the hard graph on a 2026 HackerRank test.
- Trie-based implementation problems, in January 2026 and March 2025. The 2026 candidate called the trie problem the one medium in a set of four.
- A five-line warm-up and an entity-management task, both November 2025. The second was about organizing entities with classifications and updates, careful operations more than clever algorithms.
For the 2026 India campus sets, see the India campus OA lesson.
Most recent bus departure
This is the most repeated Visa OA question, with four reports. Two fall in the last 12 months: the March 2026 senior set and a December 2025 senior CodeSignal test, where the candidate spent about 30 minutes on time parsing and edge cases. An October 2025 on-campus set asked how many minutes ago the bus left, and a January 2025 version wanted the wait for the next shuttle. The version below returns the departure time itself, something like the December 2025 one.
Most Recent Bus Departure
Problem
departures, a list of bus departure times as "HH:MM" strings in chronological order, and the current time current in the same format. Return the departure time of the bus that left most recently before current.A bus leaving exactly at
current hasn't left yet. If no bus left before current, return the string "-1".Every time falls within a single day. The list can hold the same time twice, and it can be empty.
Two buses have left by 10:00, and the later of them, at 09:30, is the answer.
Turn every clock string into minutes since midnight. The list is sorted, so a binary search for the current time lands just after the last bus that left.
Most Recent Bus Departure
Click "Run" to execute your code
bisect_left returns, and return -1 when that slot is past the end.Newspaper text layout
Three candidates met this one between August and December 2025, all on CodeSignal, so it predates the 2026 platform switch. A December 2025 senior had to lay paragraphs out within a width limit, pad each line depending on whether the leftover space was even or odd, and wrap the result in asterisks. They couldn't get the padding right and didn't solve it. An August 2025 intern got a centered version of the same idea, and an October 2025 intern called it a modified LeetCode 68. The version below centers each line inside a * border.
Newspaper Text Layout
Problem
paragraphs, a list of paragraphs where each paragraph is a list of words, and a page width. Lay the text out like a newspaper column and return the page as a list of strings.Fill each line greedily. Put as many words on it as fit, separated by single spaces, without going past
width. Every paragraph starts on a new line.Center each line within the width. When the leftover space is odd, the extra space goes on the right. Then frame the page with
*: the first and last strings are width + 2 asterisks, and every text line gets one * on each side. Every word fits within width."hello world" is 11 characters, so it breaks. "a cat sat" fills the width exactly. "on the" leaves 3 spaces, 1 on the left and 2 on the right.
Pack each paragraph into lines with a running length that counts the spaces, then pad each line with spare // 2 spaces on the left and the rest on the right. Add the border rows last.
Newspaper Text Layout
Click "Run" to execute your code
Numbers with an odd count of zeros
It was the first problem of the October 2025 on-campus set and the second of the March 2026 senior set, both four-problem tests. The October 2025 candidate's wording was to count how many numbers in an array have an odd number of zeroes. It's the five-minute question you clear before the clock starts to matter.
Numbers With an Odd Count of Zeros
Problem
numbers. Return how many of them contain an odd number of zero digits when written in decimal.The number
0 has one zero digit, so it counts. 100 has two zeros and doesn't count, while 1000 has three and does.10 has one zero and 1000 has three. 100 has two and 5 has none.
Count the zero digits of each number, either through its string form or by peeling digits with % 10, and keep the numbers where that count is odd.
Numbers With an Odd Count of Zeros
Click "Run" to execute your code
% 10 and // 10, adding one for each digit that equals zero, and treat the number 0 as one zero before the loop starts. The same loop answers the related warm-ups, like counting numbers with an even number of digits.Allocate memory
Both reports put this in a four-problem set, in March 2026 and October 2025. The October 2025 candidate pointed to LeetCode's Design Memory Allocator, so the class below follows that shape. You keep a row of memory units, give out the leftmost free block of a requested size, and free everything one owner holds. Method names and small rules may differ on the real test.
Allocate Memory
Problem
Allocator over n memory units, numbered from 0 and all free at the start.allocate(size, owner) finds the leftmost run of size consecutive free units, marks them as belonging to owner and returns the index of the first one. If no free run is long enough, it returns -1 and changes nothing.release(owner) frees every unit owner holds, across all of its blocks, and returns how many units it freed. Owner ids are positive integers, and one owner can hold several blocks at once.- Allocator(10)
- allocate(1, 1)→ 0
- allocate(1, 2)→ 1
- allocate(1, 3)→ 2
- release(2)→ 1
- allocate(3, 4)→ 3
Releasing owner 2 frees unit 1, but a block of 3 doesn't fit there. The leftmost free run of 3 starts at unit 3.
Store memory as a list of owner ids, where 0 marks a free unit. Allocate scans left to right counting the current free run, and release scans once to clear every unit with that owner.
Allocate Memory
Click "Run" to execute your code
[start, length] runs instead of one cell per unit. Allocate walks the runs to the first one long enough and trims it. Release looks up the owner's blocks in a dict from owner to its [start, length] list, puts each back into the free list and merges it with its neighbors. Both now cost time in proportion to the number of runs, which is far smaller than the number of units.Mission time across two schedules
This is the newest problem on the page. The autumn 2026 India campus drives framed it as shuttle missions between two space-station hubs. An August 2025 intern CodeSignal set had it earlier as two spaceships with sorted departure times. The August 2025 candidate summed it up as picking from the first array, jumping to the next greater time in the second, repeating that mission times and returning the end time. The version below is something like that, with one round trip counted as one mission.
Mission Time Across Two Schedules
Problem
alpha holds the departure times from Alpha and beta the departure times from Beta, both sorted ascending. Times are non-negative integers, and the trip itself takes no time.A mission is one round trip. You take an Alpha shuttle, then the earliest Beta shuttle that leaves strictly later. The first mission starts with the earliest Alpha shuttle. Each later mission starts with the earliest Alpha shuttle strictly later than your last Beta one.
Return the departure time of the last Beta shuttle after
missions round trips. If you ever need a later shuttle and none exists, return -1. missions is at least 1.Alpha 1, then Beta 3. Alpha 5 is the first one after 3, then Beta 6.
Each hop asks for the first time strictly greater than the current one in a sorted list. bisect_right answers that in O(log n).
Mission Time Across Two Schedules
Click "Run" to execute your code
travel time units, the next shuttle has to leave after you arrive. Search from time + travel instead of time and return the final arrival. And since your position in each list only moves forward, two pointers that never rewind solve any number of missions in O(n + m). Worked through below.Palindromic subsequences of length 5
The hardest problem here came from a February 2026 HackerRank Coding - Expert test, three problems in 90 minutes. The candidate described the third as a variation of LeetCode 2484 where the input holds only 0s and 1s. 8 of its 15 tests timed out on them, so a count that lists subsequences one by one isn't enough. On LeetCode it uses a full digit string and asks for the count modulo 10^9 + 7.
Palindromic Subsequences of Length 5
Problem
bits made only of 0 and 1. Count its palindromic subsequences of length 5.A subsequence keeps characters in their original order but may skip any of them. Two subsequences are different when they use different sets of indices, even if they spell the same string.
Return the count modulo
10^9 + 7. The string can be thousands of characters long.The only length-5 subsequence uses every character, and it reads the same backwards.
A length-5 palindrome reads a, b, middle, b, a. Fix the middle index and multiply the number of (a, b) pairs to its left by the number of (b, a) pairs to its right. With two symbols there are only four pair types.
Palindromic Subsequences of Length 5
Click "Run" to execute your code
Common questions
Does Visa use CodeSignal or HackerRank?
Both, depending on when you apply. CodeSignal ran most Visa OAs through January 2026, and most reports since February describe a tiered HackerRank Technical Skills Assessment. The 2026 India campus drives used HackerRank-style three-question sets. There are exceptions. A Staff candidate in February, a Senior candidate in March and a Software Engineer I candidate in August still had four-problem CodeSignal tests, and a November 2026 report names HackerEarth.
Is the Visa OA proctored?
The CodeSignal version was, with webcam, microphone, screen sharing and a photo ID check, and one November 2025 candidate was asked to retake it after the system flagged their typing and gaze. Fewer details exist for 2026, but an October 2026 senior candidate also describes a proctored test. Read your invite, and sit it as if it's watched.
What is a good Visa CodeSignal score?
There's no published cutoff, and no score guarantees an interview. In December 2025 one candidate was rejected at 567 of 600, and another heard nothing after a perfect 600. A US candidate in November 2025 ran out of time on one problem, scored 0 on it and finished just under 500. Aim for 600 by clearing the first two problems fast, then fight for every test on the last two.
Can you use AI on the Visa OA?
No. Visa's interview tips say using AI during interviews "is strictly prohibited" and can get you disqualified. The CodeSignal test was proctored and flagged pre-written typing, so practice without any AI help. AI shows up later in the loop as a topic instead, since some 2026 interviewers ask how you use coding assistants.
How to practice for the Visa OA
If your invite names a HackerRank tier, remember that only the shapes of those tests are known so far. Run the palindrome problem with a graph medium and a DP medium of your choice as one 90-minute set. If your invite says CodeSignal, do the four recurring problems as one 70-minute block instead: bus departure, odd zeros, allocate memory, then the newspaper layout. Write each from a blank file, run the tests, and fix only what fails. The second pass a few days later shows whether the warm-ups now take five minutes, which is what frees up time for the hard one.
Key Takeaways
- ✓The Visa OA was mostly CodeSignal through January 2026, four problems in 70 minutes. Most reports since then describe a tiered HackerRank test.
- ✓No score guarantees an interview. Candidates were rejected at 567 of 600 and after solving all four problems.
- ✓The repeat CodeSignal set is bus departure, newspaper layout, odd zeros and memory allocation. Clear the easy ones fast.
- ✓Type your solutions live. A November 2025 candidate was asked to retake the test after it flagged their typing pattern.
Visa interview guideKnow what Visa asks before you walk in.
30 coding · 8 system design · 20 behavioral questions
Get their questions first.
InterviewLegend is independent and not affiliated with or endorsed by any company it covers.