Interview
OAs Got Harder Than NeetCode 150: What to Practise Now
Candidates say OAs outgrew NeetCode 150. What they report, what CodeSignal, HackerRank and Amazon publish, where the claim breaks, and what to practise.

Got an OA link? Take a timed practice set now
In early November a post on r/leetcode about an Amazon mid-level online assessment reached 444 upvotes. The candidate wrote that the question was the hardest they had ever seen and was not on LeetCode at all; the recruiter who followed up said she thought it was a medium, and that other candidates had passed it (r/leetcode, 5 Nov 2026).
Both statements can be true at once. The distance between them is most of what this post is about.
Short answer: Some online assessments did get harder, but mostly in a direction NeetCode 150 does not train. Candidates report unseen problems, hidden tests that fail anything short of the optimal complexity, and less time per question, while vendors add AI-allowed formats. Keep NeetCode 150 as vocabulary, then practise unseen problems under a clock, read constraints for the target complexity, and submit partial solutions early.
If an OA link is sitting in your inbox with a seven-day expiry, the plan is further down. The reasoning comes first because the plan only makes sense after it.
Last checked: 15 Nov 2026. Candidate reports come from the Reddit threads linked inline (upvote counts as of that date) and are labelled candidate-reported. Vendor facts come from CodeSignal's published framework and April 2026 announcement, HackerRank's CEO letter, and Amazon's OA page. Our own numbers come from the 17 practice sets in Thita's OA practice, counted on 15 Nov 2026.
What candidates say changed
Candidates report competitive-programming problems, advanced graph and DP questions, heavy implementation under tight time limits, hidden tests that reject anything slower than optimal, and problems that are not on LeetCode at all. These come from self-selected threads and are not measured trends.
The earlier of the two threads was posted in July: "Why is no one talking about how Online Assessments have become insanely difficult?" (r/leetcode, 8 Jul 2026, 356 upvotes). The poster lists four things they keep seeing:
- problems that need competitive programming skill
- advanced graph or dynamic programming questions
- complex implementation with very tight time limits
- hidden test cases that punish anything less than an optimal solution.
The replies are more interesting than the post. The top comment, at 256 upvotes, says the smaller the company, the harder the OA gets. One commenter describes a DP problem at a mid-tier startup that they put at about Codeforces 1800, where an O(n²) memoized solution timed out on half the hidden cases. Another describes four problems in roughly 45 usable minutes. Another says the OA at "the rainforest company" was much harder than the live interviews that followed it. All candidate-reported, none verifiable, and I would not build a plan on any single one of them.
What the threads do agree on is the suspected cause. Many of the top comments in both say candidates are pasting OA questions into an AI model, and a few describe how. That comes back later.
What the vendors actually publish
The vendors tell a quieter story. CodeSignal's published GCA spec still excludes graphs and DP from three of four questions. HackerRank's CEO has apologised for LeetCode-style hiring and is moving to AI-assisted repository tasks. Amazon's OA page describes coding plus a work simulation.
CodeSignal. The General Coding Assessment is four questions in 70 minutes. CodeSignal's General Coding Skills Evaluation Framework budgets about 10, 15, 20 and 30 minutes for them, which adds up to 75 minutes of expected work in a 70-minute window. The first three questions exclude graphs, number theory and dynamic programming; the fourth excludes named advanced algorithms like Dijkstra or FFT. On paper that is a test of speed and careful implementation, nothing like a Codeforces round (our GCA guide).
CodeSignal is also moving the other way. In April 2026 it launched agentic assessments in which candidates build with tools like Claude Code, Cursor or Codex and explain their decisions to a human reviewer. Its announcement says about one-third of its customers adopted an AI-assisted format during 2025 (CodeSignal via PR Newswire, 2 Apr 2026).
HackerRank. Its co-founder and CEO published a letter titled "Sorry, we made you grind LeetCode" (HackerRank). It lists three shifts: from algorithmic questions to real work in code repositories, from code correctness to AI fluency and judgment, and from an IDE to an agentic environment. It also says algorithm questions still have value, and that "the problem is the weightage." Candidates noticed: the r/cscareerquestions thread on it drew 592 upvotes. What HackerRank's AI-assisted tests look like from the candidate's side is in our HackerRank AI assistant guide.
Amazon. Amazon's SDE OA page lists a coding assessment averaging 70 minutes, a Workstyles survey and, for full-time roles, a 60-minute Work Simulation. It does not publish questions or difficulty. Candidates applying for 2027 internships report a split: some got two traditional coding questions, others one coding problem plus a 60-minute repository debugging task (PracHub, candidate reports). More in the Amazon OA guide.
No vendor publishes difficulty over time. Nobody can show you a chart of the average OA getting harder, including me.
Why OAs might be getting harder (a hypothesis)
My read is that the AI-cheating complaints are the cause. An unproctored test of known problems stops filtering once a model can solve them, so employers have four moves: harder problems, unseen problems, in-person rounds, or AI-allowed formats. There is public evidence for the last three.
Follow it from the employer's side. An OA exists because a company has far more applicants than interview slots, and it works only while the pass rate stays low and tracks skill. One commenter in the July thread says they have not seen an OA problem a current model cannot solve from a pasted statement. If that is even half true for known LeetCode problems, a company keeping last year's question bank watches its pass rate climb and its signal fall. Something has to change:
| Response | What candidates would see | Public evidence |
|---|---|---|
| Raise the difficulty | CP-style problems, Codeforces-rated DP | Candidate reports only (July thread) |
| Use unseen problems | Questions not on LeetCode that the recruiter calls "medium" | Candidate report (Amazon, Nov thread); CodeSignal says it writes new questions "on an ongoing basis to minimize the impact of leaks" (framework) |
| Move a round in person | At least one onsite coding round | Google, reported Aug 2025 (Entrepreneur); a Nov 2026 r/csMajors thread on in-person OAs (286 upvotes) |
| Allow AI and grade how you use it | Repository tasks, agent tools, logged prompts | CodeSignal agentic (Apr 2026), HackerRank's letter, Amazon's reported debugging task |
The first row is the one the threads talk about, and it is the one with the weakest evidence. The second row is the one I would bet on, partly because I suspect it is the cheapest for a company to do. Writing a fresh medium is easier than writing a fresh hard, and a problem with no published editorial is harder to paste into a model and harder to have memorised.
The second row also explains the Amazon thread. A problem can be a medium by its intended solution and still feel like the hardest thing you have seen if you have never met its shape. The recruiter and the candidate were measuring different things.
Where the claim is overstated
"OAs are harder than NeetCode 150" mixes up difficulty with familiarity. NeetCode 150 already has 21 Hard problems. The threads are self-selected, since people post about the OA they failed. And the most standardised OA, CodeSignal's GCA, still excludes graphs and DP from three of four questions in its published spec.
Selection. Nobody starts a thread called "the OA was about what I expected." The July poster says so themselves: they ask whether they have "just had unusually difficult assessments." A few hundred upvotes say the experience is common enough to recognise. They do not say the median OA moved.
The list is not easy. Counted from NeetCode's public problem data, the list is 28 Easy, 101 Medium and 21 Hard. That is 14% Hard. If the issue were raw difficulty, finishing NeetCode 150 properly would cover most OAs. What the list cannot do is surprise you. After a month on it, most problems are ones you have seen or seen a cousin of, and the skill being trained is recognition.
Topic fit. NeetCode 150 spends 15 problems on trees and 11 on linked lists. It has no prefix-sum section; Subarray Sum Equals K, a staple of counting problems, is not in it. CodeSignal's spec, meanwhile, puts heavy weight on 2D arrays, hash maps and multi-part implementation. The list and the test overlap less than the "just do NeetCode" advice assumes, and that would be true even if no OA had changed at all.
What our own OA practice sets show
Our 17 timed OA sets use 50 problems: 15 Easy, 32 Medium and 3 Hard. Only 24 of the 50 are in NeetCode 150, and the 26 outside it are mostly Easy and Medium. Leaving the list made the sets less familiar, not harder.
The practice sets come in two kinds. Format sets copy a vendor's shape, such as four problems in 70 minutes for a CodeSignal-style general assessment. Company sets (Amazon, Google, Meta, Microsoft, Goldman Sachs, Uber and five others) use only problems carrying that company's tag in our interview-report data, with no untagged padding. Each problem has 15 test cases, two shown and the rest hidden, and scoring gives partial credit per case, weighted 1, 2 and 3 by difficulty.
| Problems | Easy | Medium | Hard | |
|---|---|---|---|---|
| NeetCode 150 | 150 | 28 | 101 | 21 |
| Our 17 OA sets | 50 | 15 | 32 | 3 |
| of which in NeetCode 150 | 24 | 4 | 19 | 1 |
| of which outside NeetCode 150 | 26 | 11 | 13 | 2 |
The tagging rule, not a difficulty target, is what took the sets off the list. Rotate String, Diagonal Traverse, Remove K Digits, Fruit Into Baskets, Next Greater Element: none is hard, and none is in NeetCode 150. Two of the three Hards, Split Array Largest Sum (Google set) and Bus Routes (Uber set), are outside it too.
What this data cannot show matters as much. These are well-known problems, and someone with 500 LeetCode solves has probably seen most of them. Our sets practise the clock, the hidden tests and partial credit. They do not practise novelty, and after reading these threads I think novelty is the part that changed. Our mix probably matches the median OA and undershoots the worst ones.
The gap is novelty and the clock
My position: for most candidates the gap between NeetCode 150 and a 2026 OA is the first ten minutes with an unfamiliar statement, plus hidden tests that only an optimal solution passes in the time left. Harder topics are a smaller part of it. Practice should target those two things directly.
In the first ten minutes of an OA problem you read a story-wrapped statement, strip the story off to see what is being computed, read the constraints to decide the complexity you need, and only then pick a technique. NeetCode 150, done the usual way, trains the last step and quietly skips the first three, because the titles and the topic grouping give the game away. "Sliding Window: Longest Repeating Character Replacement" has told you its technique before you have read the first line.
Hence the opinion I expect some people to disagree with: if you have finished NeetCode 150, do not start NeetCode 250 next. Another 100 curated problems, grouped by topic, mostly buy more recognition. The marginal hour is worth more on problems you meet cold, with no label, against a timer. The fair counter-argument is that the worst OAs in those threads do use topics outside the list. They do, so the plan includes some breadth, as the second priority.
What to practise now
In order: unseen, unlabelled problems under a timer; reading constraints to set the target complexity before coding; and submitting a brute force first to bank partial credit. Then add a few topics NeetCode 150 underweights. If your invite allows AI, practise directing it and reviewing what it writes.
1. Unseen problems, cold
The best free source of unseen, unlabelled, timed problems is contest archives. LeetCode's weekly contests have a virtual-contest mode, and in my read questions 2 and 3 sit near the OA range. Codeforces Div. 3 (problems C and D) and Div. 2 (B and C) run roughly 1200 to 1600 in rating, below the one 1800 report and a sensible place to start. Rules for these reps:
- Do not read the tags. Hide them if the site shows them.
- 25 minutes per problem, then read the editorial, then re-solve from scratch the next day.
- Write one line before coding: what is being computed, stripped of the story.
2. Constraints first
Hidden tests are sized to kill the slower solution, which is what that O(n²) commenter ran into. Read the constraints before thinking about technique and set your target. The usual rule of thumb assumes about 10⁸ simple operations per second; Python gets less, so leave a margin.
| Largest n | Target complexity | Typical techniques |
|---|---|---|
| ≤ 20 | O(2ⁿ · n) | bitmask enumeration, backtracking |
| ≤ 500 | O(n³) | interval DP, triple loops |
| ≤ 5,000 | O(n²) | 2D DP, pairwise checks |
| ≤ 10⁵ to 10⁶ | O(n log n) or O(n) | sorting, heaps, two pointers, prefix sums, binary search on the answer |
| ≤ 10⁹ or more | O(log n) or O(1) | binary search, math |
If your idea is O(n²) and n is 10⁵, you know it fails the hidden tests before you write a line, and on a test that budgets 75 minutes into 70, that time is the margin.
3. Bank partial credit
Both CodeSignal and HackerRank award points per hidden test passed, and on CodeSignal the best submission per question counts. Write the brute force, submit it, then optimise. A brute force that passes 6 of 15 cases scores; a half-written optimal solution scores nothing. Our scorer works the same way, so a timed set rehearses the habit.
4. Topics NeetCode 150 underweights
Short list, from the gaps above and from what our tagging rule pulled into the sets:
- prefix sums with a hash map (Subarray Sum Equals K, Continuous Subarray Sum)
- binary search on the answer beyond Koko (Split Array Largest Sum, Capacity to Ship Packages)
- grid and matrix simulation (Diagonal Traverse, or the Tetris-style task in CodeSignal's own sample)
- monotonic stack variants (Remove K Digits, Next Greater Element)
- difference arrays and sweep lines for range updates.
Two a day is enough; the DSA patterns sheet groups them.
5. If AI is allowed
CodeSignal's agentic and Cosmo formats and HackerRank's AI-assisted tests allow AI. Practise a loop: write a short spec, ask for a plan, review it, accept small diffs, run tests. HackerRank's AI Fluency scoring reads your prompts and actions, so the transcript is graded too.
A schedule
If the link expires in 7 days: two cold contest problems a day for five days, with the constraint line written first. On day 6, one full timed set in your vendor's shape. Day 7, rest and take it.
If you have 3 weeks: week 1, finish or revise NeetCode 150 at speed (recognition, 15 minutes per medium, no new problems). Week 2, one cold problem and one topic-gap problem a day, plus one virtual contest. Week 3, three full timed sets in your vendor's format, reviewing which question type cost the most time after each.
On cheating, since half of each thread is about it: whatever gets you past an OA, the live rounds after it, and at Google at least one in-person round, have to be solved without it. Proctoring rules by vendor are in are online assessments proctored?
OA guides by vendor
- CodeSignal assessment (GCA) guide
- HackerRank AI-assisted assessment guide
- HireVue interview guide, including the CodeVue coding test
- Karat interview guide, the live human-run screen
- Amazon online assessment guide
- Is NeetCode 150 enough for FAANG? and NeetCode 150 vs NeetCode 250 vs Blind 75, if you still need a list
The question I cannot answer yet is whether the no-AI OA survives at all. If the fix for AI cheating is unseen problems, the fix lasts until the models solve unseen mediums as reliably as known ones, and from those threads that may already be the case. The vendors that sell both the no-AI test and the agentic one seem to be hedging on the same question.
Frequently Asked Questions
Is NeetCode 150 enough for online assessments?
For the median OA, mostly yes on topics and difficulty: the list has 101 Mediums and 21 Hards. What it does not train is solving an unseen problem from a long statement under a clock. Finish it, then spend your remaining time on unlabelled contest problems and timed sets rather than another curated list.
Is HackerRank harder than LeetCode?
The platform sets no difficulty; the employer picks the questions. HackerRank tests differ from LeetCode mainly in format: hidden test cases, a fixed timer and partial credit per case. HackerRank's CEO has said the company is moving toward AI-assisted, repository-based tasks, which are a different kind of test altogether.
How hard is the Amazon online assessment?
Amazon does not publish difficulty. Its page lists a coding assessment averaging 70 minutes plus a Workstyles survey and, for full-time roles, a work simulation. Candidates report anything from LeetCode-medium questions to problems not found on LeetCode, and some 2027 intern candidates report a repository debugging task instead of a second algorithm question.
Can you fail an Amazon online assessment?
Yes. The coding assessment is scored on hidden test cases, and Amazon emails full-time candidates after each section to say whether they move on. Partial solutions still count for something on most OA platforms, so submitting a working brute force is better than leaving a question blank.
Can online assessments detect cheating?
Many can. Amazon says it logs browser use and ends the session if you use print screen. CodeSignal's proctored tests record camera, microphone and screen, reviewed by its own team. Vendors also rotate questions to limit leaks. Even an undetected pass leads to live rounds you must solve unaided.
Sources
- r/leetcode, "Why is no one talking about how Online Assessments have become insanely difficult?", 8 Jul 2026, 356 upvotes on 15 Nov 2026 (candidate-reported).
- r/leetcode, "Have you noticed OAs getting far more difficult?", 5 Nov 2026, 444 upvotes (candidate-reported).
- r/cscareerquestions, thread on HackerRank's pivot, 12 Oct 2026 (discussion).
- r/csMajors, "In person OAs better not become the norm", 9 Nov 2026 (discussion).
- CodeSignal, General Coding Skills Evaluation Framework (PDF) (official; modules, timing, exclusions, question rotation).
- CodeSignal, agentic coding assessments announcement, 2 Apr 2026, via PR Newswire (official; survey figures are CodeSignal's).
- HackerRank, "Sorry, we made you grind LeetCode", letter from the co-founder and CEO (official; undated on the page).
- HackerRank help centre, AI Fluency evaluation (official).
- Amazon, SDE online assessment page (official; sections, timing, rules).
- PracHub, Amazon SDE intern OA 2027 reports (candidate-reported).
- Entrepreneur, Google and McKinsey bring back in-person interviews, Aug 2025 (press report).
- NeetCode 150 counts: NeetCode's public problem data (neetcode-gh/leetcode), as mirrored in our curated list on 15 Nov 2026.
- Thita OA practice sets: our own catalogue of 17 sets and 50 problems, counted 15 Nov 2026.
Topics
Related on Thita
Your next step
Got an OA link? Take a timed practice set now
A timed set on Thita keeps the clock running, hides most test cases and ends with a score report on what to fix. It is practice in the format, not the employer's own test. Three sets are free with a signup; Pro adds the rest.