How to explain the complexity of the algorithm and the formal definition of O-large in terms of constants and input size?
Банк вопросов из реальных собеседований
Направления, темы и вопросы из записей интервью. Фильтры ниже сохраняются в ссылке.
Algorithms and data structures
23 questions from real interviews
How can H-index be computed in O(n), why may citations be capped at the number of papers, and what changes if the input array may be modified?
At the interview they asked: how many zeros are at the end of the number 100!, and how to accurately calculate this without calculating the factorial itself?
At the interview they asked: how many zeros are at the end of the number 100!, and how to accurately calculate this without calculating the factorial itself?
How do you reason about algorithmic complexity, when is a greedy choice valid, and how can an unknown biased coin produce a fair random bit?
When to use async, threading and multiprocessing in Python, and how does the GIL influence these choices?
Compare bagging with boosting, explain what a p-value means, and show how Bayes’ rule updates a hypothesis after an observation.
You need to verbally design a simple in-memory vector search: add, search top-K, cosine similarity, stats. What do you pay attention to?
What to say about linear programming, the simplex method and greedy algorithms if asked at a technical ML interview?
What basic runtime questions for Python often come after an algorithmic problem?
Describe the reservoir sampling algorithm for one element from a stream and explain why each element seen is selected with equal probability.
Compare REST and gRPC at a high level. Then explain what a database index does and what simple data structures can back an index.
The moderation model requires classes and data. How to collect labels, handle imbalances, and not mix different policies into one noisy dataset?
How are matrix equation, least squares, gradient descent and L1/L2 regularization related?
How does the distribution of selected numbers change if for each query we select the number with the maximum XOR?
What are the basic algorithm families in the recommendations and what to do with cold start?
Compare insertion and access complexity for a singly linked list, Python list, Python dict, and string concatenation. Where do amortized O(1) and worst-case caveats matter?
A disease has prevalence 1%. A test is 99% accurate for both sick and healthy people. If the test is positive, what is the probability that the person is actually sick?
How does a tokenizer translate text into identifiers, how do common algorithms differ, and when a new dictionary for a language or domain is needed?
There is a coin with an unknown probability of heads p, 0 < p < 1. How to get a fair random bit 0/1 using flips of this dishonest coin?
You already implemented set/get/sum for an Excel-like table with formulas and cycle checks. How would you add per-cell undo and redo operations?
There is a large TIN stoplist and PDF text where the numbers can be glued together or carried. How to quickly find candidates and not accept part of the account for the counterparty’s TIN?
Connect four different topics: embedding learning, RAG architecture, SHAP explanations, and quantile regression.