StackAdapt interview questions

Showing 1–10 of 10 results

• Analyze time complexity for dictionary operationsMedium

  This question evaluates understanding of dictionary/hash table performance characteristics, covering hashing, collision-resolution strategies, load factor and resizing impacts, and the cost of iterating or copying keys into a dynamic-array-backed list within the Coding & Algorithms/data structures domain.

  StackAdaptSoftware EngineerCoding & AlgorithmsHR Screen
• Calculate conditional probabilities for coin tossesEasy

  This question evaluates understanding of conditional probability and independence in simple probabilistic experiments. It belongs to the Statistics & Math domain, is commonly asked to assess foundational probabilistic reasoning used in statistical inference and algorithmic decision-making, and targets conceptual understanding with elementary practical computation.

  StackAdaptSoftware EngineerStatistics & MathHR Screen
• Camel and Bananas: Maximize Bananas Delivered Across the DesertMedium

  Classic camel-and-bananas brainteaser: a camel that carries at most 1,000 bananas and eats one per kilometer must move 3,000 bananas to a market 1,000 km away. Find the maximum number that can arrive, testing piecewise cost reasoning, depot planning, and a proof of optimality.

  StackAdaptMachine Learning EngineerStatistics & MathOnsite
• Design a Recipe and Inventory Ordering ServiceEasy

  Design an object-oriented recipe service where nested dishes consume raw inventory and an order either succeeds atomically or changes nothing. The prompt tests typed references, cycle detection, quantity expansion, overflow handling, concurrent stock updates, immutable views, and explicit replacement and query semantics.

  StackAdaptSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Design a time-windowed key-value storeEasy

  This question evaluates a candidate's ability to design efficient data structures and algorithms for a time-windowed key-value store, focusing on expiration handling, update semantics, and maintaining aggregate metrics under memory constraints.

  StackAdaptSoftware EngineerCoding & AlgorithmsTechnical Screen
• Explain Why a Geometric Mean Can Exceed Its MedianEasy

  Tests derivation and comparison of the expected value and median of a geometric distribution, explaining how right-skewness drives the mean above the median across different parameterizations.

  StackAdaptMachine Learning EngineerStatistics & MathTechnical Screen
• Find the Flaws in an End-to-End ML Pipeline Case Study ReportMedium

  Review a condensed end-to-end machine learning case study, from its goal and labels through normalization, evaluation, and deployment, and point out what is wrong with it. Tests systematic pipeline review, reasoning about what data each step uses, and ranking problems by how much they undermine the conclusions.

  StackAdaptMachine Learning EngineerMachine LearningOnsite
• Maintain the Median of an Integer StreamEasy

  This problem tests your ability to maintain dynamic statistics in a data stream using efficient heap-based data structures.

  StackAdaptMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Rebuild a Binary Tree From Preorder and Inorder Sequences, Returned in Level OrderMedium

  Reconstruct a binary tree with distinct values from its preorder and inorder traversals and return it in level-order form with null markers. Tests how the two traversal orders pin down structure, careful index bookkeeping, and efficient handling of deep, skewed trees.

  StackAdaptMachine Learning EngineerCoding & AlgorithmsOnsite
• Reservoir Sampling: Uniform k-of-n Sample From a Stream of Unknown LengthMedium

  Design a one-pass algorithm that keeps a uniform random sample of k items from a stream whose length is unknown in advance, using memory proportional to k. Tests the replacement rule, an inductive proof that every item is kept with equal probability, complexity, and edge cases.

  StackAdaptMachine Learning EngineerStatistics & MathOnsite