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.

142 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.

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.

Binary Search

Count Values with an Even Number of Digits

Course Schedule

Maximum Non-Adjacent Sum

Palindrome Integer

Maximum profit from repeated stock trades

Reconcile noisy annotator labels

Batch inference requests under a capacity budget

Apply sequential line edits to a file

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

Grade book

Vial log

Comment batches

Launch order

Notes table

Binary Search

Count Values with an Even Number of Digits

Course Schedule

Maximum Non-Adjacent Sum

Palindrome Integer

Maximum profit from repeated stock trades

Reconcile noisy annotator labels

Batch inference requests under a capacity budget

Apply sequential line edits to a file

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

Grade book

Vial log

Comment batches

Launch order

Notes table