Constraints Interview Questions

Count the stretches of a price series whose highest value and lowest value are both exactly the two figures you were given. This MathWorks question is a two-condition counting problem, and the clean answer tracks the last position of each required value together with the last position that broke the range. You will handle the case where the two targets are equal, keep the scan linear, and avoid the quadratic double loop. A subscription unlocks the complete problem and the reference solution.

Decide whether rotating an array right by a stated amount leaves it in strictly decreasing order. This Capital One question is short and worth reading twice, because the ambiguity about whether the rotation amount is given or chosen changes the problem entirely. You will implement the check without materialising the rotated copy, handle strictness at every adjacent pair, and say what an array with repeated values means for the answer. The full problem and the model solution require a subscription.

Schedule a daily stream of labelling work across human annotators and models, with per-day capacity limits and a history that nobody may repeat. This OpenAI problem is an assignment question in disguise, and the accumulating history is what stops yesterday's greedy answer from working today. You will enforce one task per person per day, respect the no-repeat rule across all previous rounds, and keep the allocation fair as the backlog shifts. The full problem statement and the model solution are available with a subscription.

Find the longest path through a network of transmitters where every consecutive pair along the route broadcasts on frequencies within one step of each other. Asked at Snowflake, the network is a tree, so the answer is a constrained diameter: the usual two-pass or rooted-depth technique still applies, but an edge only counts when the two frequencies are compatible. You will compute the best downward reach per device, combine two branches at each device, and return zero when no pair can reach each other at all. The complete problem and the reference solution are available to subscribers.

This Rubrik graph question asks you to label the nodes of a connected network with integers under rules that fix how far apart neighbouring labels may be, some with a forced direction, and to make the overall range of labels as wide as possible. It tests modelling with difference constraints, parity reasoning on graphs and shortest-path thinking, at a scale where brute force is not an option.

Tackle a practical system design and object-oriented programming challenge frequently reported during Uber onsite interviews, where you must dynamically generate a specialized grid game card. This exercise tests your ability to manage complex state constraints, probabilistic placement rules, and strict dimensional boundaries across rows and columns. Building a clean, modular solution requires careful class design and robust logic handling. Unlock the full architectural breakdown and comprehensive code solution by securing your subscription today.

Resolve a set of package requirements into an installable plan, honouring version ranges and reporting an honest conflict when no plan exists. Reported at OpenAI, this engineering-heavy question grows through several stages and rewards correctness and clear data modelling over clever optimisation. You will model constraints as a graph, order work so that dependencies come first, and distinguish a genuine conflict from a resolution order you have not tried yet. A subscription gives access to the complete problem and the reference resolver.