Start here: how to prepare, and where to begin

Nearly every candidate can recite softmax(QKᵀ/√d_k)V. What the interviewer is after is the variance derivation and the precise training failure the scale heads off. This is the response that tells rote recall apart from real grasp.

The most frequently asked applied GenAI question, and the one most candidates turn into a definition dump. What the interviewer wants is a decision framework with a default and the conditions that override it. Here is the call that earns points.

Alignment has become a baseline expectation even beyond 'safety' roles. The interviewer is looking for the three-stage RLHF pipeline and a sharp account of why DPO threw out the reward model completely. Here is the answer that leads with mechanism, not the buzzwords.

A tidy fundamentals question that trips up anyone who only knows GPT. The signal is pairing each architecture to its task through its attention pattern, and explaining why the field settled on decoder-only even for tasks that are not generation. Here is that answer.

Every customer wants to know how to stop the model inventing things. The weak reply is 'better prompts.' The signal is understanding why models hallucinate and stacking grounding, abstention, and measurement into a system you can defend.

Tokenization reads like plumbing until it accounts for your bill, your latency, and why the model stumbles on numbers and rare languages. The signal is understanding how subword tokenizers operate and the consequences that follow from them.

MoE explains why some frontier models carry huge parameter counts yet serve cheaply. The signal is the sparse-activation idea, the routing mechanism, and the operational cost (memory, load balancing) that the FLOP savings quietly conceal.

Attention is permutation-invariant, so with no position information a transformer cannot detect word order. The signal is knowing why, and why the field shifted from absolute sinusoidal encodings to relative ones like RoPE and ALiBi that extrapolate to longer contexts.

Every LLM product tunes these knobs, and the interviewer wants to hear what each one does to the probability distribution and which setting suits which task. That includes why factual and creative tasks call for opposite settings.

Evaluation is the toughest and most underrated part of shipping LLMs. The signal is understanding why public benchmarks mislead, why LLM-as-judge carries bias, and how to build a task-specific eval you can genuinely trust.

Embeddings are the foundation of modern NLP and retrieval. This tests whether you grasp the distributional idea behind them, not just 'words become vectors.' What matters is how training on context yields geometry that encodes meaning.

PEFT is how everyone fine-tunes large models now. What matters is the low-rank insight behind LoRA, why it cuts memory so sharply, and what 4-bit QLoRA adds. Here is the answer that goes past 'it's efficient fine-tuning.'

In-context learning is the property that turned prompting into a paradigm; chain-of-thought is its most useful trick. What matters is knowing what 'learning' means here (no weight updates) and why making the model reason step by step actually helps. Here is the answer.

Instruction tuning converts a bare next-token predictor into a model that obeys instructions. What you are being tested on is slotting it correctly into the pretrain to SFT to alignment pipeline and stating precisely what it does and does not repair.

LLM-as-judge is how you grade open-ended generation at scale, and G-Eval put a formal frame on it. What shows depth is naming the biases that make raw judge scores untrustworthy and demonstrating exactly how you harden them.

Tool calling powers every agent. The signal is grasping that the model executes nothing: it emits a structured request your code runs, then you hand the result back. Here is the loop and the details that determine reliability.

One of the most common AI, ML, and GenAI design rounds. Sketching embed-retrieve-generate is easy; the signal lives in chunking, hybrid retrieval, the rerank/latency tradeoff, and how you prove it works. Here is the structure that scores.

Agents get reached for too often. A strong answer pushes past the hype: most tasks are better served by a single structured call, and agents pay off only under particular conditions. Here is when one is worth it and how to stop it from compounding errors.

Most RAG systems ship without genuine evaluation, which is why most of them quietly degrade. The signal is breaking evaluation into retrieval and generation, and scoring faithfulness apart from relevance. Here is the framework that makes RAG improvements measurable.

Agents and integrations depend on the model returning valid, schema-conforming output. The signal is stacking constrained decoding, schema validation, and retries, rather than trusting a prompt to do the job. Here is the production-reliability answer.

Every RAG system rests on a vector index, and the interviewer wants proof you grasp the recall/latency/memory tradeoff, not just 'use a vector DB.' The signal is why exact search will not scale and how HNSW and IVF place different bets.

Multi-agent is the pattern most often reached for without cause in AI today. The signal is holding back unless the task genuinely calls for specialization or parallelism, knowing the supervisor and handoff patterns, and grasping why coordination magnifies failure.

Conversations and agent tasks grow past the context window, and the naive 'stuff the whole history' approach breaks on cost, latency, and lost-in-the-middle. The signal is a tiered memory design: recent buffer, summarized mid-term, retrieved long-term.

MCP standardized how agents connect to tools and data, but tool design is what determines reliability. The signal is knowing what MCP actually standardizes and the principles behind a tool the model can call correctly from its description alone.

Chunking quietly caps RAG quality, and 'split every 500 tokens' leaves recall on the table. The signal is knowing the strategy families and the parent-child trick that separates retrieval size from context size.

Reranking is the cheapest large win in RAG quality: pull a broad set, then reorder it precisely. The signal is the bi-encoder-versus-cross-encoder distinction and the retrieve-then-rerank two-stage design. Here is the answer.

Pure vector search drops exact terms; pure keyword search drops meaning. The signal is understanding why each fails on its own and how to merge two rankings on incomparable scales without hand-tuning weights. Here is the answer.

Standard RAG retrieves once and generates; agentic RAG makes retrieval an iterative, reasoning-driven loop. The signal is the agent deciding whether, what, and when to retrieve, then re-retrieving until the evidence holds.

A deceptively easy ML-coding ask. Writing exp/sum is trivial; the signal is the max-subtraction trick and the log-sum-exp form that stop it overflowing. Here is the stable implementation and the reason the naive version breaks.

The from-scratch implementation that frontier labs and NVIDIA really do ask. Writing it shows you grasp shapes, the scale factor, the causal mask, and how heads split and recombine. Here is a correct, readable implementation plus the follow-ups.

A classic that checks whether you reach past sorting for the right structure. The signal is the heap solution (O(n log k)), the bucket-sort O(n) trick, and how it shifts for an unbounded stream. Here is the answer.

Sliding window is one of the highest-yield coding patterns, and this is its canonical problem. The real signal is spotting when a window collapses an O(n squared) scan into one linear pass, and holding the invariant cleanly.

DP feels like pattern-matching magic until you have a method. The signal is a repeatable drill: spot overlapping subproblems and optimal substructure, define the state and recurrence, then memoize or tabulate. Here is that method applied to a worked example.

Merging intervals is a staple that probes the sort-then-sweep idea. The tell is sorting by start and merging in a single pass, O(n log n). Below is the pattern along with the family of problems it opens up.

Binary search is simple to explain and notoriously easy to botch (off-by-one, infinite loops). Interviewers look for a correct template plus the variants (boundaries, rotated arrays) that show up constantly. The answer follows.

A warm-up that tests for the stack instinct. Interviewers look for recognizing that last-opened-first-closed maps onto a stack, plus handling the edge cases (leftover opens, early close). The pattern follows.

The textbook warm-up that tests for the hash-map instinct: swap space for time to turn O(n squared) into O(n). Interviewers look for the one-pass complement lookup. The pattern follows.

A staple grid-traversal problem probing BFS/DFS flood fill and disciplined visited-marking. What interviewers watch for: viewing the grid as a graph and tallying connected components. Here is the answer.

Reversing a linked list is the archetypal pointer-handling screen. What interviewers watch for: the three-pointer walk executed without ever dropping the tail of the list, plus why the iterative version wins over recursion in production. Here is the answer.

Turning a tree into a string and reconstructing it faithfully rests on one choice most candidates overlook. Skip it and the structure turns ambiguous. Here is the answer and the interview-grade reasoning.

The DP that reveals why greedy quietly fails on non-standard denominations, and how a single bottom-up table fixes it. What interviewers watch for: the dp[amount] recurrence and the unbounded-reuse insight.

Validating a BST trips up people who only check parent-child pairs and miss violations buried deep in a subtree. The signal is propagating min/max bounds or relying on in-order monotonicity. Here is the answer.

Course Schedule collapses to a single question: is the prerequisite graph a DAG? The signal is seeing the graph framing and applying topological sort or DFS to detect a cycle. Here is the answer.

The naive triple loop runs O(n cubed). Sort first, then fix one element and converge two pointers for O(n squared). The real test is deduplication: returning unique triplets without a set. Here is the clean template.

The most frequent ML fundamentals question, and a subtle seniority check: anyone can repeat the definition, but can you break down the error and convert it into a concrete debugging plan?

The interviewer wants to see whether you choose metrics to fit the problem or just recite definitions. The signal that counts is recognizing when accuracy and even AUC mislead, and linking each metric to a decision.

Shipping a model is itself an experiment, and this question tells apart people who run A/B tests from those who p-hack them. The signal is pre-registering the metric, sizing the test, and holding back from peeking.

Imbalance turns up in fraud, churn, and abuse, and the naive answer (oversample, done) leaks data and inflates offline metrics. The signal is favoring cost-sensitive learning, fixing the metric, and resampling correctly. Here is the full toolkit with its tradeoffs.

Tabular ML is won on features, and this question checks whether you navigate the practical traps: target leakage in encodings, informative missingness, and fitting transforms on the wrong data. The signal is leakage-safe preprocessing. Here is the toolkit.

A near-universal ML fundamentals question. Anyone can recite 'L1 is lasso, L2 is ridge'; the signal is the gradient-and-geometry reason L1 forces weights to exactly zero and when you'd choose each. Here is that answer.

Ensembles dominate tabular ML, and this question tests whether you grasp that they attack different parts of the error. The signal is bagging-reduces-variance vs boosting-reduces-bias and why GBMs win on tabular data. Here is the answer.

Trees are the building block of the ensembles that rule tabular ML, so interviewers check you can explain how a split gets chosen and how a lone tree overfits. The Gini-vs-entropy part is a trap: candidates over-weight a choice that barely matters. Here is the answer.

Dimensionality questions probe linear-algebra intuition and practical judgment together. What interviewers reward is what PCA really does (project onto max-variance directions), why high dimensions hurt, and the honest catch: it is unsupervised, so it can discard the exact direction your label needs. Here is the answer.

Backprop is the algorithm that makes deep learning trainable, and the interviewer wants the chain-rule mechanics, not just 'it computes gradients.' What interviewers reward is the forward-then-backward flow and why it is efficient. Here is the answer.

Hypothesis testing sits under every experiment, and what matters is reading the p-value correctly (it trips most people) and picking the right test. Here is the rigorous, plain-language answer.

Everyone says 'gradient descent,' but the batch-size decision and momentum are the actual interview content. What earns credit is the noise-vs-cost tradeoff across batch/SGD/mini-batch and why momentum pays off.

The loss sets what the model optimizes, and the wrong choice silently sinks it. What counts is matching the loss to the task and data (outliers, imbalance), rather than reflexively reaching for MSE or cross-entropy.

Cross-validation yields a reliable performance estimate, but the wrong scheme leaks data and misleads. What matters is matching the CV scheme to the data (stratified, grouped, time-series) and fitting preprocessing inside the fold.

k-means is the reflex answer, yet it silently assumes round, equal-size clusters and requires you to know k in advance. What earns credit is positioning each alternative by the specific assumption it drops, and knowing when to use it.

XGBoost and LightGBM win most tabular problems, and interviewers want more than 'it's boosting.' What matters is the fit-to-residuals mechanism plus the engineering (regularization, histograms, second-order) that makes it both fast and accurate.

Pipelines fail and retry, so the real question is whether a retry corrupts your data. What interviewers look for is idempotent writes (not 'exactly-once delivery') alongside watermarks for late data. Here is how to keep re-runs safe without double-counting.

Top-N-per-group is the window-function question every data round asks, and the trap is RANK vs ROW_NUMBER vs DENSE_RANK. What interviewers want is picking the right ranking function for ties and understanding window frames. Here is the pattern and the tie nuance.

A pipeline-design question that rewards fitting the architecture to the freshness requirement rather than chasing real-time for its own sake. What interviewers want is the latency-vs-complexity tradeoff and an understanding of why Kappa arose to kill Lambda's dual codebase. Here is the decision.

A data-warehouse fundamentals question that tells apart people who model for analytics from those who only know OLTP normalization. What interviewers listen for is facts vs dimensions, the star schema, and why analytics denormalizes where transactional systems normalize.

Keeping a warehouse in sync with a live OLTP database is a CDC problem, and the naive 'full reload nightly' or 'query by updated_at' answers leave real gaps. The signal is log-based CDC and idempotent merges.

Query tuning is a core data-engineering skill, and what interviewers watch for is reading the execution plan before you change anything, then applying the right fix. Here is the diagnostic method that tells guessers apart from engineers.

Dedup is a daily data-engineering task and a frequent screen. The signal is ROW_NUMBER to keep the right record (not just DISTINCT), pinning down what 'duplicate' actually means, and handling near-duplicates at scale.

Joins are the core of SQL, and the real signal is precise semantics: semi/anti joins (EXISTS / NOT EXISTS), the NOT IN null trap, and the fan-out bug that quietly doubles your sums.

The most common ML system design round. Interviewers reward the funnel structure: candidate generation, then ranking, then re-ranking, with the right model at each stage plus an honest plan for cold start, freshness, and feedback loops. This lays out that structure.

Ads ranking is where calibrated probabilities collide with tight latency and money. The signal is knowing that CTR has to be calibrated (not just ranked), the feature and serving design, and the auction context. Here is the design that goes past 'train a classifier.'

The canonical AI system-design question. The signal is covering both the model lifecycle and the serving stack at real scale, without rambling. Most candidates design only half and lose the points.

The modern agentic system-design question. The signal is the plan, search, read, synthesize, verify loop with per-claim citations, plus keeping cost and latency bounded. The hard parts are not the writing.

Limited GPUs, dozens of models, and every team demanding low latency for little money. The signal is whether you can shape that into a single governed serving fleet: continuous batching, KV cache, per-tenant quotas, and cost you can genuinely attribute.

How large recommenders and search draw candidates from millions of items in milliseconds. The signal is why the user and item towers stay separate, how that enables precomputed embeddings plus an ANN index, and where ranking takes over.

Feed ranking is multi-objective ML at massive scale with a harsh serving constraint. The interviewer wants to see whether you optimize a value model toward long-term satisfaction, or fall into the CTR trap that breeds clickbait. Here is the design.

The service under every RAG stack and semantic search box. The signal is your ANN index choice and how you deal with the three things that quietly break it: metadata filtering, live updates, and scale.

The Dynamo question. Interviewers want three decisions made cleanly: how you partition keys so adding nodes does not reshuffle everything, how you replicate for durability, and where you sit on the CAP spectrum. Here is how to reason through all three with concrete quorum math.

Every API platform needs one. Interviewers reward the candidate who picks the right algorithm (token bucket vs sliding window) for the burst behavior, then cracks the genuinely hard part: holding one shared limit across many servers without a per-request round trip to a central store.

Looks simple until the follow-ups: which layer do you balance at, how do you keep traffic off a dead server, and how does the load balancer itself avoid being a single point of failure? Interviewers want the algorithm, the health-check loop, and the high-availability story.

A deceptively rich warm-up. The interesting calls are how you mint short, collision-free, unguessable keys at scale, and how a read-heavy 100:1 workload shapes storage and caching. Here is the clean design with capacity math.

The observability infrastructure question. Interviewers want you to split the three telemetry types, choose storage that withstands massive write volume, and design alerting that fires fast without burying on-call in noise. Here is the pipeline with retention and cardinality math.

The real-time messaging staple. Interviewers look for the delivery path (persistent connections, not polling), a fan-out strategy that survives large groups, and a clear story on ordering and delivery guarantees. This lays out that design, including the fan-out tradeoff that marks senior candidates.

The rookie reply is 'retrain weekly.' The experienced call is a hybrid: drift-triggered retraining backed by a max-staleness fallback, plus a gate requiring any new model to beat the incumbent. Here is how to think it through.

The trap is describing ordinary software CI/CD. The signal is the three additions ML brings: data validation, a model-quality gate against a baseline, and versioning data plus model plus code as a unit. Here is what truly differs.

Deploying a model is more than flipping a switch. The signal is knowing what each rollout strategy validates, why shadow is uniquely useful for ML, and keeping rollback a single step away. Here is the comparison and when each fits.

The most common ML production failure is not a code bug but a quiet upstream data change. The signal is validating at ingestion (schema plus distribution), data contracts with producers, and failing loud rather than training on garbage.

LLMOps is not MLOps with bigger models. What counts is the genuinely new surfaces (prompts as deployable artifacts, eval-driven development, often no training step) and treating prompts with the same version discipline as code.

Models decay silently as the world shifts, and 'monitor for drift' is too vague. What counts is the actual statistical methods and separating data drift you can detect without labels from concept drift you often cannot.

A high accuracy number hides slice failures, brittleness, and silent data bugs. What counts is naming the test layers that catch what the headline metric can't. Here is the framework that gets scored highest.

'Which model is in prod right now, and how did it get there?' should be a one-second lookup with an audit trail. If it isn't, you already have a rollback and compliance problem. Here is the promotion pipeline.

Interviewers here want concrete figures, not 'grab a bigger GPU.' Weight memory stays constant, the KV cache scales with traffic, and the order you pull levers in settles the outcome. This walks through the napkin math and the serving stack.

The interviewer is checking that you understand how a model too large for any one GPU still gets trained, and can run the optimizer-state memory math that justifies sharding. This covers the parallelism taxonomy and the 16-bytes-per-parameter figure.

Quantization is the opening move for shrinking and accelerating models, and the interviewer expects more than 'use fewer bits.' What they grade is whether you know what each precision level gains you, why outliers wreck naive quantization, and how you demonstrate quality survived. This lays that out.

The KV cache is what makes LLM serving hard, and the interviewer wants the mechanics: what it holds, why it caps concurrency, and the tricks that shrink it. This is the answer that shows you grasp decode-time economics.

Mixed precision is routine at scale, and the interviewer wants the numerics: why FP16 needs loss scaling, why BF16 mostly does not, and what remains in FP32. What they grade is whether you understand dynamic range vs precision. This is that answer.

Knowing the algorithms is only half the job. The rest is the serving stack that actually delivers throughput within a latency budget. What they grade is whether you match the server to the workload and name the four knobs that move the needle.

Continuous batching is the biggest single throughput lever in modern LLM serving. The signal is explaining why static batching leaves the GPU idle on variable-length generation, and why PagedAttention is what makes the fix practical.

LLM serving has its own metrics, and a single latency number hides the real bottleneck. The signal is separating prefill from decode and treating GPU utilization as a clue, not a verdict. Here is the diagnostic toolkit.

nvidia-smi reading 100% can mask the fact that you are tapping only a fraction of the hardware's real compute. What matters is MFU (useful FLOPs vs peak) and the gap between 'the GPU is busy' and 'the GPU is efficient'.

There is no one-shot patch for prompt injection, and answering 'sanitize the input' loses the round. What lands is defense in depth: privilege boundaries, handling retrieved content as data rather than instructions, and a human gate on irreversible actions. Here is the layered answer.

A CISO-facing question that trips up engineers who focus only on model quality. What matters is treating governance as architecture rather than a checkbox: minimization, isolation, auditability, and never training on customer data by default. Here is the framework.

Getting an LLM feature to production safely is an evaluation problem first and a model problem second. What lands is a layered eval-plus-guardrail design with honest, segmented metrics rather than a single 'safety classifier.' Here is how to measure and defend each failure mode.

Most ML security centers on inference-time attacks; this one targets the training pipeline, where a poisoned dataset or a tampered dependency can hide a backdoor that clean-data evaluation never catches. What lands is naming the attack classes and recognizing that defense means provenance, not a single model fix.

Enterprise AI deals turn on governance, and engineers who can speak it stand out. What lands is treating it as documentation, accountability, and risk-tiered controls across the lifecycle rather than a legal afterthought.

Red teaming is how you uncover an AI system's failures before users or attackers do. What lands is a structured program covering the real attack surface (jailbreaks, harmful content, leakage, bias) and routing every finding back into defenses.

'Add guardrails' says nothing concrete. The strong answer names the specific input and output checks, the mechanisms that enforce them, the fail-safe behavior when one trips, and the honest admission that they are imperfect. Here is the implementation answer.

Every loop includes this question, and most answers slip one of two ways: too combative or too much of a doormat. The signal is evidence-based persuasion plus real disagree-and-commit. Here is the arc that connects and the traps that sink it.

Applied AI is half translation. Panels ask this to gauge whether you can shed the jargon, cast tradeoffs in business terms, and win trust from the people who own the roadmap. Here is how to demonstrate that skill inside the answer itself.

This is an entire interview round (OpenAI's project deep dive, Amazon's Tech Talk), not small talk. It is where they check whether you genuinely understand the work you claim. The signal is depth, your specific contribution, and the tradeoffs you can defend. Here is how to prepare and deliver it.

Applied AI work is ambiguous by nature, and panels (Meta's 'embracing ambiguity,' Anthropic's deliberately under-specified problems) check whether you freeze or drive. The signal is structured progress under uncertainty. Here is the arc that connects.

This question screens for ego and growth, not perfection. The interviewer wants to watch you take hard feedback without getting defensive, own a real mistake in first person, and change as a result. The signal is humility plus a durable, concrete change.

A soft-sounding question that quietly filters out low-effort candidates and tests real fit. The signal is specific, researched reasons tied to your trajectory, not flattery. Here is the structure that lands.

Hype primes customers to expect a system that reads minds and never fails. Resetting that without losing the deal is an applied-AI skill interviewers probe head-on. Here is the move.

With billions of candidate items and only tens of milliseconds to choose the next 10, a feed is a latency problem first. The interview probes the two-stage architecture, how you set the objective when engagement fights integrity, and the biases that silently corrupt your training labels.

A track runs three minutes, a session runs an hour, and a fresh release has zero plays on launch day. The interview centers on mixing collaborative filtering with audio content embeddings, handling cold start on both sides, and reading a skip as the loud negative it really is.

Training a pCTR model is the easy part. The challenge is proving a change helps before it reaches revenue, when the model runs inside an auction, the logs surface only ads that won, and a 1% calibration error costs real money. This is an eval question, not a model question.

The positive class runs about 1 in 1,000, your labels show up late and noisy, and the instant you ship a model the adversary starts probing it. This is the uncommon ML problem where the data actively fights back, so the design hinges on labels, latency, and enforcement cost as much as on the classifier.

Fraud is well under 1% of transactions, the labels land weeks late as chargebacks, and the fraudsters deliberately adapt to your model. Optimizing accuracy hands you a model that approves everything. The interview is about dollars-at-risk thresholding, label delay, and a review queue with a fixed headcount.