Capital One Coding OA Questions: 3 Experiences
- Company
- Capital One
- Level
- Unknown
- Stages
- OA
Capital One OA questions from September 2026: three reports, nine coding tasks, and a 70-minute CodeSignal test with four tasks and the webcam on.
At a glance
- Process: One coding OA. Reports 01 and 03 each listed four coding tasks, and report 02 remembered only one. The one report with format details (03) had 70 minutes on CodeSignal with camera, screen sharing and microphone on.
- Asked recently: Nine different tasks, and none showed up in more than one report. Counting over arrays or strings came up in 2 of 3 (reports 01 and 03).
- Difficulty: No report rated the tasks. One post behind report 03 said it was done in about 40 of the 70 minutes.
- Practise first: Distinct Values on Maximum-Sum Frames and Alternate String Ends (report 01), then Rank Football Teams (report 02). Each was named in one report.
Coverage: Three Capital One OA reports posted between September 4 and September 24, 2026. Report 02 is a full-time general software role. Reports 01 and 03 gave no role. No report states a hiring level or a result. One of report 03's posts places it in the UK.
None of the three reports states a hiring level (intern, new grad or experienced), so they all sit in one section below instead of one section per level.
Hiring level not reported
What came up
These are short, task-focused reports. Two of the three included a counting task over an array or a string. The rest were one-offs: a grid scan, a ranking with tie-breaks, a string rebuilt from both ends, and two tasks that replay a list of operations in order.
| Topic | Reports | Last seen |
|---|---|---|
| Counting over arrays or strings | 2 of 3 | Sep 2026 (report date) |
| Replaying operations step by step | 1 of 3 | Sep 2026 (report date) |
| Grids and matrices | 1 of 3 | Sep 2026 (report date) |
| Sorting with tie-breaks | 1 of 3 | Sep 2026 (report date) |
| Building a string | 1 of 3 | Sep 2026 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Distinct Values on Maximum-Sum Frames | 1 | Sep 2026 (report date) |
| Alternate String Ends | 1 | Sep 2026 (report date) |
| Count Subarrays with K Disjoint Equal Pairs | 1 | Sep 2026 (report date) |
| Wait Until the Next Bus | 1 | Sep 2026 (report date) |
| Rank Football Teams | 1 | Sep 2026 (report date) |
| Count Digits 0, 2, and 4 | 1 | Sep 2026 (report date) |
| Count Alternating Tile Groups | 1 | Sep 2026 (report date) |
| Inventory Discount Tracker | 1 | Sep 2026 (report date) |
| Rectangle Fit Queries | 1 | Sep 2026 (report date) |
Online assessments (OA)
OA 01: Four tasks, from equal pairs to bus times
Report date: Sep 24, 2026 · Role: Not given · Level: Not given · Result: Not disclosed
This candidate listed four tasks with one line each. They named no platform or time limit.
- Count Subarrays with K Disjoint Equal Pairs. Count the contiguous subarrays that hold at least
kpairs of equal values, where no two pairs share a position. The report didn't say how to pair up a value that appears three or more times. - Distinct Values on Maximum-Sum Frames. Look at every square of a fixed size inside a matrix and add up only its border cells. Find the best border sum. Then, across every square that ties for that best sum, add up the distinct values that sit on those borders. A value that appears on two winning borders counts once. Practice this problem
- Wait Until the Next Bus. Given a bus timetable and the current time, return how long until the next bus leaves. The report gave no time format and didn't cover the case where no bus is left that day.
- Alternate String Ends. Build a new string by taking characters from the two ends in turn: first, last, second, second-to-last, and so on toward the middle. For
abcdethe result isaebdc. Practice this problem
OA 02: Full-time role, one football ranking task
Report date: Sep 15, 2026 · Role: General software (full-time) · Level: Not given · Result: Not disclosed
The candidate remembered only one task from the OA.
- Rank Football Teams. Four arrays of the same length describe the teams:
wins,draws,scoredandconceded, where indexiis one team. A team earns 3 points per win and 1 per draw. More points ranks higher. On equal points, the bigger goal difference (scored minus conceded) wins. The candidate thought goals scored might be the next tie-break but wasn't sure. Return the indices of the first- and second-place teams. Practice this problem - Their approach. They built one tuple per team (points, goal difference, goals scored, index), sorted the list from high to low and returned the top two indices.
- The last tie-break. The candidate didn't say how a full tie on all three numbers is broken. Their high-to-low sort, index included, puts the larger index first. The FastPrep version uses goals scored as the third key and puts the smaller index first.
OA 03: CodeSignal, four tasks in 70 minutes
Report date: Sep 4–5, 2026 (three posts) · Role: Not given · Level: Not given · Location: UK (one post) · Platform: CodeSignal · Result: Not disclosed
Three posts from September 4 and 5 describe the same four tasks in almost the same words, so they count here as one report.
- Setup. Four coding tasks in 70 minutes on CodeSignal, with camera, screen sharing and microphone on the whole time. One post called the monitoring strict and said it was done in about 40 minutes.
- Count Digits 0, 2, and 4. For an integer
n, count every 0, 2 and 4 digit across all numbers from 0 ton. Each digit counts, so 22 adds two. Forn = 10the answer is 4. A solution up to O(n²) was allowed. That post looped over each number as a string and warned aboutn = 0. - Count Alternating Tile Groups. Tiles sit in a circle, each red (0) or blue (1). Count the runs of exactly
sizetiles in a row where every pair of neighbours has different colours, wrapping around the end. For[0, 1, 0, 1, 1]with size 3 the answer is 3. That post copied the firstsize - 1tiles onto the end and scanned once. - Inventory Discount Tracker. You get each item's regular price and a time-ordered log of sales, discount starts and discount ends. A discount lowers the price for a limited number of units. After that, units sell at the regular price. An item has at most one discount running at a time. Return total sales.
- Rectangle Fit Queries. Process operations in order.
[0, a, b]saves anabybrectangle.[1, a, b]asks whether every saved rectangle could fit, one at a time, in anabybbox, with 90-degree turns allowed. Return one true or false per query, and a query before any rectangle is saved returns true. That post kept only the largest short side and the largest long side seen so far, so each query takes constant time.
Common questions
How many questions are on the Capital One OA?
Reports 01 and 03 each listed four coding tasks. Report 02 remembered only one.
How long is the Capital One OA?
The one report that gave a length had 70 minutes for four tasks (report 03). The others didn't say.
Is the Capital One OA proctored?
Report 03 had camera, screen sharing and microphone on for the whole test. The other two reports didn't mention monitoring.
What platform does Capital One use for the OA?
Report 03 named CodeSignal. Reports 01 and 02 didn't name a platform.
Do Capital One OA questions repeat?
Not across these reports. The three reports share no task (reports 01–03).
Keep practicing
- Distinct Values on Maximum-Sum Frames: the border-sum grid task from OA 01.
- Alternate String Ends: the both-ends string task from OA 01.
- Rank Football Teams: the points-and-goal-difference ranking from OA 02.
- Capital One question bank: every Capital One problem on FastPrep, including the tasks above without a link (sign-in needed).
- Capital One interview guide: FastPrep's Capital One interview page.
- Experience feed: more interview reports from other candidates.
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.