Search the siteSearch in

Interview paths
Question bank
Coding practice
Study materials
Infrastructure lab

Community

Weekly sessions
Peer practice
Contribute

News

Jobs

Open roles
Market intelligence
Companies
Roles

Feedback

Product feedback
Developer feedback

Checking account…

Home
Question bank

Frontier AI technical interview question bank.

Practice coding, system design, behavioral, and project questions for frontier AI roles.

Company

Loading the question catalog…

Preparing this page…

Your current navigation and account state stay available while the next page loads.

Frontier Rehearsal · Independent practice · Not affiliated with OpenAI, Anthropic, or xAI.

Home Interview questions Company interview processes Company reports Role reports Market intelligence Open roles Python lab Materials How it works About Feedback Uploads Feature requests Terms Privacy 中文 English

Home
Question bank

Frontier AI technical interview question bank.

Practice coding, system design, behavioral, and project questions for frontier AI roles.

Company

FREE PRACTICE

Public demos, always pinned.

Start with either demo. They remain here when you filter or sort.

Free account: sign in to practice the marked Free questions.

Newest published questions; deterministic, never randomized.

Demo 1Number search with delayed feedback
Demo 2Design real-time device monitoring and control

Question bank filters

Reset filters

Question groups

Filter question bank by interview groupAll 161 Coding 161 System design 0 Behavioral 0 Hiring manager 0 Project deep dive 0

Topics

Filter question bank by topic tagsAll 269 Python 161 Algorithms 40 Data structures 46 Concurrency 27 Distributed systems 7 Storage & state 43 Networking 7 Reliability 30 ML / AI 27 Data / SQL 24 Security 7 Product design 25 Communication 66

Independent and not affiliated with the companies represented. Collected material does not predict future interview questions.

155 questions

Sort question bankSortFree first Newest Oldest AI ratio ↓AI ratio ↑

Question bank results

Every question has a public brief with the task, constraints, and follow-ups. Labels describe interactive practice access.

Public brief

Topic tags
Python
Data structures

MetaCoding

Python codingWebAssembly + public tests

Reported interview periodNov 2025–May 2026

Kth largest value with duplicates counted

Return the k-th value in descending order from an integer array, treating equal values as separate entries. The input arrives in one of two line layouts.

Practice focusRequirements - Layout A: line one is the element count, line two holds the integers, and line three is k . - Layout B: line one is nums=[3,2,1,5,6,4] and line two is k=2 , with no space before either equals sign. - k is one-based and always lies between 1 and the array length, so k = 1 asks for the maximum and k equal to the length asks for the minimum. - Return the selected value as a decimal string; it is a value, not a position.…

Public brief

Topic tags
Python
Concurrency
Distributed systems
Storage & state
Data / SQL

AnthropicCodingHalf AI-generated

Talk-through codingNo local grader

Reported interview periodOct 2025–May 2026

Design Worker and Coordinator Protocols for Distributed Statistics

You control N workers and one coordinator. Worker i can read only shard i. Endpoints communicate by messages; there is no shared mutable dataset. Sending captures an independent snapshot of the payload; later s…

Practice focusThe task is either mode or median . For mode, return the globally most frequent integer with the smaller value winning ties. For median, return the exact middle value as a float, or the mean of the two middle values for even cardinality. The global input is non-empty; individual shards may be empty. Requirements - Define message shapes and an explicit completion condition. - Do not assume the coordinator can read worker data directly. - Avoid shipping complete raw shards in the scalable solution.…

Public brief

Topic tags
Python

MetaCoding

Python codingWebAssembly + public tests

Reported interview periodApr 2026

Fewest inserts to balance brackets

Report how many bracket characters must be inserted anywhere in a parenthesis string to make every prefix and the whole line balanced.

Practice focusRequirements - The input is one line containing only ( and ) . - A string is balanced when every prefix has at least as many ( as ) , and the total counts are equal. - Insertions may be placed at any position. Removing, replacing, or reordering characters is not allowed. - Return the minimum number of inserted characters as a decimal string. - A line that is already balanced returns "0" . - run case(case: dict) forwards case["stdin"] to solve . - Do not append a trailing newline to the returned string; return the value exactly once.

Public brief

Topic tags
Python
Algorithms

MetaCoding

Python codingWebAssembly + public tests

Reported interview periodApr 2026

Tightest slice covering a character multiset

Find the shortest contiguous slice of a source string that contains every character of a required multiset with at least the required multiplicity, and return that slice.

Practice focusRequirements - Line 1 is the source string. Line 2 lists the required characters. - The chosen slice must be contiguous and must contain each required character at least as many times as it appears on line 2. - Compare slices by length. When several slices tie for the shortest length, return the one that begins earliest. - If no slice qualifies, return an empty string. - Matching is case-sensitive. - Return the slice itself, not its length and not its bounds. - run case(case: dict) forwards case["stdin"] to solve .…

Public brief

Topic tags
Python
ML / AI

AnthropicCodingHalf AI-generated

Talk-through codingNo local grader

Reported interview periodOct 2025–Apr 2026

Debug a GRPO Training Step

A small PyTorch implementation of Group Relative Policy Optimization runs without exceptions but learns poorly. Inspect and correct its sampling, advantage normalization, and clipped policy loss while preservin…

Practice focusRequired behavior - Convert logits to probabilities with softmax before sampling tokens. - For each prompt group, compute A i = (r i - mean(r)) / (std(r) + eps) using a positive epsilon so zero-variance groups remain finite. - Compute the per-token importance ratio as exp(current logprob - old logprob) . - Exclude masked tokens from both the loss sum and averaging denominator. - Compute the negative mean of the minimum between the unclipped and clipped ratio times advantage. - Return a finite zero loss if every token is masked.…

New public brief

Topic tags
Python
Concurrency

xAICoding

Talk-through codingNo local grader

Reported interview periodNov 2025–Apr 2026

Make a Bank Account Thread-Safe

You are given a BankAccount whose deposit method performs a read-modify-write operation and may pause between reading and writing. You cannot modify that class. Implement a subclass that makes deposits safe whe…

Practice focusCall the inherited implementation rather than copying it. Two deposits of 500 and 700 into an account starting at 0 must finish with 1200 . Ensure the lock is released if the inherited method raises. The supplied constructor creates the account and its lock. Complete deposit only. The provided run case adapter owns the concurrent fixture execution; it is not candidate work. Opening balances and deposit amounts are integers, and deposit amounts are nonnegative. Empty deposit lists leave the opening balance unchanged. Each successful call returns None .…

New public brief

Topic tags
Python
Data structures
Communication

xAICoding

Python codingWebAssembly + public tests

Reported interview periodApr 2026

Resumable Iterators

Implement an iterator over a copied list that can serialize its position and later resume at the next not-yet-yielded item. Then compose the same behavior across a sequence of lists.

Practice focusSaved state points to the next item, never the last item returned. A completed iterator restores completed. State must be serializable and restoration must not repeat or skip values. The chain state records both the current group and the position within it. Use exactly {"index": integer} for list state and {"outer": integer, "inner": {"index": integer}} for chain state. Reject malformed keys, booleans/nonintegers and negative or out-of-range active indices with ValueError .…

New public brief

Topic tags
Python
Storage & state

xAICoding

Python codingWebAssembly + public tests

Reported interview periodDec 2025–Apr 2026

In-Memory Database with Expiry and Snapshots

Build an in-memory database in four stages. Each key owns string field/value pairs.

Practice focusMissing values return "" . Scans emit field(value) entries sorted by field. A TTL value is live over [created at, created at + ttl) . A backup captures all live fields and each field's remaining lifetime. Restore selects the newest backup at or before timestamp to restore , replaces current state, and restarts remaining lifetimes at timestamp . Assume timestamps supplied to mutating timed operations are nondecreasing. Backups must not share mutable state with the live database.…

New public brief

Topic tags
Python

xAICoding

Python codingWebAssembly + public tests

Reported interview periodFeb 2026

Flatten and Rebuild Nested Values

A nested value contains integer leaves and internal list, tuple, or dict nodes. Dictionaries are traversed in insertion order.

Practice focusImplement: flatten returns leaves in traversal order. unflatten uses structure as a shape template and rebuilds the same container types while replacing leaves from left to right. Raise ValueError when there are too few or too many replacement values, and TypeError for unsupported nodes, including booleans. Empty containers must round-trip. Replacement values must be a list of non-boolean integers; reject other values with TypeError . Do not modify either input.…

Public brief

Topic tags
Python
Data structures

xAICoding

Python codingWebAssembly + public tests

Reported interview periodFeb 2026

Weighted LRU Cache

Build an LRU cache whose capacity is the total weight of stored entries rather than the number of keys.

Practice focusget returns -1 when absent and marks a hit most-recently used. put inserts or replaces a key. On replacement, remove the old weight before checking capacity. Evict least-recently used entries until the new value fits; one insertion may evict several entries. A non-positive size or a size exceeding capacity raises ValueError without changing the cache. Exact fits are valid. Target average O(1) time for get and for each individual insert, update, or eviction. The provided run case owns fixture dispatch and is not candidate work.…

Public brief

Topic tags
Python
Data / SQL

xAICoding

Python codingWebAssembly + public tests

Reported interview periodJan 2026

Live Audio Room Analytics

Events have (operation, room_id, user_id, timestamp), where operation is create, join, or leave. Creating a room also places that user inside it.

Practice focusImplement a batch function that returns total person-seconds per room and a live tracker that ranks rooms by current participant count: For batch processing, sort by timestamp and ignore exact duplicate events. A user may occupy only one room: joining another closes the previous stay at that timestamp. Rejoining the same room is a no-op, and an unmatched leave is ignored. Open stays count through current time when supplied; otherwise they contribute nothing. Live top-k breaks count ties by room ID.…

Public brief

Topic tags
Python
Concurrency

xAICoding

Talk-through codingNo local grader

Reported interview periodDec 2025–Jan 2026

Sort Integers with Multiple Workers

Implement an ascending integer sort that divides sufficiently large inputs into chunks, sorts chunks concurrently, and merges the sorted runs.

Practice focusReturn a new list and do not mutate the input. For fewer than 1000 values or a single worker, a direct sort is acceptable. On the large-input path, actually partition the input and dispatch chunk sorts; do not sort the entire list in one call. Cap the worker count to useful work and merge all runs correctly, including duplicates and negative values. The worker count must be a positive integer (not a boolean); reject invalid counts with ValueError before dispatch. Use native worker execution for the concurrent path.…

Public brief

Topic tags
Python
Reliability

xAICoding

Python codingWebAssembly + public tests

Reported interview periodDec 2025

Identify Faulty Nodes with Group Tests

There are n compute nodes with IDs 0 through n - 1. A supplied function test(group) returns True exactly when every node in group is healthy. A test group must contain at least two node IDs. Assume at least two…

Practice focusImplement: Return every faulty node ID in ascending order. Minimize unnecessary tests, but prioritize correctness. Do not assume that testing one node is legal. The supplied run case owns fault labels and the test callback; implement only find faulty nodes . Each test must contain at least two distinct valid non-boolean integer IDs. The public safety budget is at most n (n-1)//2 + n-1 callback calls; it admits pair discovery followed by classification and is not an optimality claim. Nodes are fixed during a run, and n is an integer at least two.…

New public brief

Topic tags
Python

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Best Time to Buy and Sell Stock

Given daily prices, compute the maximum profit obtainable by buying once and selling once later. You may choose not to trade, in which case the profit is 0.

Practice focusPrices are non-negative integers. An empty or one-day input returns 0 . Solve the problem in O(n) time and O(1) auxiliary space. Staged follow-ups 1. Allow any number of non-overlapping transactions while holding at most one share. 2. Add a fixed transaction fee or a one-day cooldown after selling. 3. Return the chosen buy and sell days with deterministic tie-breaking.

New public brief

Topic tags
Python
Algorithms

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Binary Search

Given a strictly increasing array of integers and a target, return the target's index or -1 when it is absent.

Practice focusThe solution must run in O(log n) time and use O(1) auxiliary space. An empty array returns -1 . Staged follow-ups 1. Return the first position where the target could be inserted while preserving order. 2. Support duplicate values by returning the first matching index. 3. Search a conceptually unbounded sorted data source through a bounded-access interface.

New public brief

Topic tags
Python

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Count Values with an Even Number of Digits

Given a list of positive integers, return how many contain an even number of decimal digits.

Practice focusFor example, [12, 345, 2, 6, 7896] returns 2 . Assume every value is positive and fits in a signed 32-bit integer. Target O(n) time. Staged follow-ups 1. Extend the definition to include zero and negative integers without counting a sign. 2. Avoid converting numbers to strings. 3. Count digits in an arbitrary base supplied at runtime.

New public brief

Topic tags
Python
Storage & state

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Course Schedule

There are num_courses courses labeled 0 through num_courses - 1. Each prerequisite pair (course, prerequisite) states that the prerequisite must be completed first.

Practice focusImplement: Return whether it is possible to complete every course. Courses with no edges are valid, and duplicate prerequisite pairs should not change the answer. Aim for O(V + E) time. Staged follow-ups 1. Return one valid course order, or an empty list when none exists. 2. Return an explicit cycle to explain why the schedule is impossible. 3. Process prerequisite additions incrementally and reject an addition that creates a cycle.

New public brief

Topic tags
Python

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Maximum Non-Adjacent Sum

Each value in amounts is the reward available at one location. You may select any subset, but cannot select two adjacent locations. Return the largest total reward.

Practice focusAssume rewards are non-negative. The empty input returns 0 . Produce an O(n) -time solution and then reduce its auxiliary space to O(1) . Staged follow-ups 1. Return the selected indices, with deterministic tie-breaking. 2. Arrange the locations in a circle, so the first and last are also adjacent. 3. Generalize to a tree where directly connected nodes cannot both be selected.

Public brief

Topic tags
Python
Algorithms

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Palindrome Integer

Determine whether a signed 32-bit integer reads identically from left to right and right to left in decimal notation.

Practice focusNegative numbers are not palindromes because of the sign. A positive number ending in zero is not a palindrome unless the value itself is zero. Staged follow-ups 1. Solve without converting the number to a string. 2. Reverse only half the digits to avoid overflow and unnecessary work. 3. Generalize the check to an arbitrary base from 2 through 36.

Public brief

Topic tags
Python

MetaCoding

Python codingWebAssembly + public tests

Reported interview periodNot available

Maximum profit from repeated stock trades

You are given a price for each trading day and may complete as many round trips as you like, holding at most one share at a time. Report the largest total gain reachable across the whole window.

Practice focusRequirements - The input has two lines: a day count, then that many space-separated integer prices on the second line. The count matches the number of prices. - A round trip means buying one share on some day and selling it on a later day; positions cannot overlap and short selling is not allowed. - Return the total profit as a plain decimal string. A window with no profitable round trip, including a single day, yields 0 . - Prices are non-negative integers and the day count is at least one.…

New public brief

Topic tags
Python

Scale AICodingAI-generated

Python codingWebAssembly + public tests

Reported interview periodNot available

Reconcile noisy annotator labels

Three annotators label each item and report an integer confidence. Produce the final label by weighted vote and count the items where every annotator agreed.

Practice focus- The first line is the item count n . Each of the next n lines has exactly three <label :<confidence pairs, where the label is A or B and the confidence is a nonnegative integer. - Sum the confidence per label. Return A when its total is higher, B when its total is higher, and ABSTAIN on an exact tie. - After the per-item labels, return one final line agreed=<count , where an item is agreed only when all three raw labels match. - Return one label per item in input order, then the agreement line. Do not append a trailing newline.

New public brief

Topic tags
Python

NVIDIACodingAI-generated

Python codingWebAssembly + public tests

Reported interview periodNot available

Batch inference requests under a capacity budget

A serving path receives requests in order. Pack them greedily into batches that respect both a total-size capacity and a maximum request count, then report the batch count and batch sizes.

Practice focus- The first line has two integers: the batch capacity C and the maximum request count per batch B . The second line is the request count n , and the third line has n request sizes. - Walk the requests in input order. Add the next request to the current batch when the total size stays within C and the count stays within B ; otherwise close the batch and start a new one. - Every request must be placed exactly once, in order; a request equal to C forms its own batch. - Return batches=<count ;sizes=<s1 ,<s2 ,... with the batch totals in order.…

New public brief

Topic tags
Python

CursorCodingAI-generated

Python codingWebAssembly + public tests

Reported interview periodNot available

Apply sequential line edits to a file

An editing agent proposes line-range replacements against a small document. Apply them in order, with each edit seeing the document produced by the previous one, and report the final content.

Practice focus- The first line is the current line count m , followed by the m document lines. The next line is the edit count k , then k edit lines. - Each edit line is <start <end <replacement with 1-based inclusive bounds over the current document. Replace those lines with the single replacement line, preserving spaces inside the replacement. - Apply edits sequentially; later edits index the already-updated document. All edits are valid. - Return the final document lines, then a final line lines=<count . Do not append a trailing newline.

Public brief

Topic tags
Python
Algorithms
ML / AI
Product design

Coding exerciseCodingAI-generated

Practice formatRunnable coding45–70 min

Reported interview periodN/A

Build a token-budget batcher

Implement a small batching primitive, then adapt it to padded cost, bounded output, and production reasoning.

Practice focusPython, Greedy algorithms, Boundary cases, ML batching, Complexity through a runnable coding exercise.

Previous6 of 7Next

Browse all original practice

Build a token-budget batcher
Sliding-window rate limiter
Interval calendar
Nested dictionary transforms
Command-log store
Dependency-ready scheduler
Streaming metric window
Evaluation slice aggregator
Build a reliable job runner
Build one adaptable decision story
Defend your role fit
Prepare one project deep dive
Design an evaluation artifact registry
Defend a reversible launch decision
Negotiate an ambiguous role scope
Trace a project from claim to evidence
Choose between two urgent priorities
Resolve a cross-functional disagreement
Own a consequential failure
Increase a team’s leverage
Warm a cold cache without a thundering herd
Ship a 500 GB checkpoint without a startup stampede
Make every document decision traceable to evidence
Share eight GPUs between two workloads with different promises
A mutable indexed sequence that must restart exactly
Trace a falling unit price to a rising bill
Keep a very long conversation usable while it streams
Design durable scheduled publishing
Make speculative code edits safe to accept
Recover a grouping rule from two-word phrases

CONTENT BOUNDARY

Independent frontier AI interview practice. Includes adaptations of collected interview material and original exercises; not official company questions and not affiliated with the companies represented. Collected material does not predict future interview questions. Report a correction.

Loading the question catalog…

FREE PRACTICE

Public demos, always pinned.

Start with either demo. They remain here when you filter or sort.

Free account: sign in to practice the marked Free questions.

Newest published questions; deterministic, never randomized.

Demo 1Number search with delayed feedback
Demo 2Design real-time device monitoring and control

Question bank filters

Reset filters

Question groups

Filter question bank by interview groupAll 161 Coding 161 System design 0 Behavioral 0 Hiring manager 0 Project deep dive 0

Topics

Independent and not affiliated with the companies represented. Collected material does not predict future interview questions.

155 questions

Sort question bankSortFree first Newest Oldest AI ratio ↓AI ratio ↑

Question bank results

Every question has a public brief with the task, constraints, and follow-ups. Labels describe interactive practice access.

Public brief

Topic tags
Python
Data structures

MetaCoding

Python codingWebAssembly + public tests

Reported interview periodNov 2025–May 2026

Kth largest value with duplicates counted

Return the k-th value in descending order from an integer array, treating equal values as separate entries. The input arrives in one of two line layouts.

Public brief

Topic tags
Python
Concurrency
Distributed systems
Storage & state
Data / SQL

AnthropicCodingHalf AI-generated

Talk-through codingNo local grader

Reported interview periodOct 2025–May 2026

Design Worker and Coordinator Protocols for Distributed Statistics

Public brief

Topic tags
Python

MetaCoding

Python codingWebAssembly + public tests

Reported interview periodApr 2026

Fewest inserts to balance brackets

Report how many bracket characters must be inserted anywhere in a parenthesis string to make every prefix and the whole line balanced.

Public brief

Topic tags
Python
Algorithms

MetaCoding

Python codingWebAssembly + public tests

Reported interview periodApr 2026

Tightest slice covering a character multiset

Find the shortest contiguous slice of a source string that contains every character of a required multiset with at least the required multiplicity, and return that slice.

Public brief

Topic tags
Python
ML / AI

AnthropicCodingHalf AI-generated

Talk-through codingNo local grader

Reported interview periodOct 2025–Apr 2026

Debug a GRPO Training Step

New public brief

Topic tags
Python
Concurrency

xAICoding

Talk-through codingNo local grader

Reported interview periodNov 2025–Apr 2026

Make a Bank Account Thread-Safe

New public brief

Topic tags
Python
Data structures
Communication

xAICoding

Python codingWebAssembly + public tests

Reported interview periodApr 2026

Resumable Iterators

Implement an iterator over a copied list that can serialize its position and later resume at the next not-yet-yielded item. Then compose the same behavior across a sequence of lists.

New public brief

Topic tags
Python
Storage & state

xAICoding

Python codingWebAssembly + public tests

Reported interview periodDec 2025–Apr 2026

In-Memory Database with Expiry and Snapshots

Build an in-memory database in four stages. Each key owns string field/value pairs.

New public brief

Topic tags
Python

xAICoding

Python codingWebAssembly + public tests

Reported interview periodFeb 2026

Flatten and Rebuild Nested Values

A nested value contains integer leaves and internal list, tuple, or dict nodes. Dictionaries are traversed in insertion order.

Public brief

Topic tags
Python
Data structures

xAICoding

Python codingWebAssembly + public tests

Reported interview periodFeb 2026

Weighted LRU Cache

Build an LRU cache whose capacity is the total weight of stored entries rather than the number of keys.

Public brief

Topic tags
Python
Data / SQL

xAICoding

Python codingWebAssembly + public tests

Reported interview periodJan 2026

Live Audio Room Analytics

Events have (operation, room_id, user_id, timestamp), where operation is create, join, or leave. Creating a room also places that user inside it.

Public brief

Topic tags
Python
Concurrency

xAICoding

Talk-through codingNo local grader

Reported interview periodDec 2025–Jan 2026

Sort Integers with Multiple Workers

Implement an ascending integer sort that divides sufficiently large inputs into chunks, sorts chunks concurrently, and merges the sorted runs.

Public brief

Topic tags
Python
Reliability

xAICoding

Python codingWebAssembly + public tests

Reported interview periodDec 2025

Identify Faulty Nodes with Group Tests

New public brief

Topic tags
Python

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Best Time to Buy and Sell Stock

Given daily prices, compute the maximum profit obtainable by buying once and selling once later. You may choose not to trade, in which case the profit is 0.

New public brief

Topic tags
Python
Algorithms

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Binary Search

Given a strictly increasing array of integers and a target, return the target's index or -1 when it is absent.

New public brief

Topic tags
Python

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Count Values with an Even Number of Digits

Given a list of positive integers, return how many contain an even number of decimal digits.

New public brief

Topic tags
Python
Storage & state

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Course Schedule

There are num_courses courses labeled 0 through num_courses - 1. Each prerequisite pair (course, prerequisite) states that the prerequisite must be completed first.

New public brief

Topic tags
Python

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Maximum Non-Adjacent Sum

Each value in amounts is the reward available at one location. You may select any subset, but cannot select two adjacent locations. Return the largest total reward.

Public brief

Topic tags
Python
Algorithms

ByteDanceCoding

Talk-through codingNo local grader

Reported interview periodNot available

Palindrome Integer

Determine whether a signed 32-bit integer reads identically from left to right and right to left in decimal notation.

Public brief

Topic tags
Python

MetaCoding

Python codingWebAssembly + public tests

Reported interview periodNot available

Maximum profit from repeated stock trades

You are given a price for each trading day and may complete as many round trips as you like, holding at most one share at a time. Report the largest total gain reachable across the whole window.

New public brief

Topic tags
Python

Scale AICodingAI-generated

Python codingWebAssembly + public tests

Reported interview periodNot available

Reconcile noisy annotator labels

Three annotators label each item and report an integer confidence. Produce the final label by weighted vote and count the items where every annotator agreed.

New public brief

Topic tags
Python

NVIDIACodingAI-generated

Python codingWebAssembly + public tests

Reported interview periodNot available

Batch inference requests under a capacity budget

A serving path receives requests in order. Pack them greedily into batches that respect both a total-size capacity and a maximum request count, then report the batch count and batch sizes.

New public brief

Topic tags
Python

CursorCodingAI-generated

Python codingWebAssembly + public tests

Reported interview periodNot available

Apply sequential line edits to a file

An editing agent proposes line-range replacements against a small document. Apply them in order, with each edit seeing the document produced by the previous one, and report the final content.

Public brief

Topic tags
Python
Algorithms
ML / AI
Product design

Coding exerciseCodingAI-generated

Practice formatRunnable coding45–70 min

Reported interview periodN/A

Build a token-budget batcher

Implement a small batching primitive, then adapt it to padded cost, bounded output, and production reasoning.

Practice focusPython, Greedy algorithms, Boundary cases, ML batching, Complexity through a runnable coding exercise.

Previous6 of 7Next

Browse all original practice

Build a token-budget batcher
Sliding-window rate limiter
Interval calendar
Nested dictionary transforms
Command-log store
Dependency-ready scheduler
Streaming metric window
Evaluation slice aggregator
Build a reliable job runner
Build one adaptable decision story
Defend your role fit
Prepare one project deep dive
Design an evaluation artifact registry
Defend a reversible launch decision
Negotiate an ambiguous role scope
Trace a project from claim to evidence
Choose between two urgent priorities
Resolve a cross-functional disagreement
Own a consequential failure
Increase a team’s leverage
Warm a cold cache without a thundering herd
Ship a 500 GB checkpoint without a startup stampede
Make every document decision traceable to evidence
Share eight GPUs between two workloads with different promises
A mutable indexed sequence that must restart exactly
Trace a falling unit price to a rising bill
Keep a very long conversation usable while it streams
Design durable scheduled publishing
Make speculative code edits safe to accept
Recover a grouping rule from two-word phrases

CONTENT BOUNDARY