practice a little every day, paws crossed ♡
Coding & Algorithms Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 3211–3240 of 3276 results
- YahooMediumData ScientistMerge words by head-tail chaining
This question evaluates graph-theoretic reasoning and string-manipulation skills, focusing on the ability to reason about ordering constraints, edge cases like self-loops and multiple identical relationships, and traversal over relationships between items.
Coding & AlgorithmsTechnical Screen - YahooEasyMachine Learning EngineerRank Items by Dot-Product Similarity to a User Embedding, Excluding Seen Items
Rank candidate items for a user by the dot product of the user's embedding with each item's embedding, returning item indices from highest to lowest score with ties broken by index. A follow-up removes items the user has already seen, testing vectorized scoring, sorting and filtering.
Coding & AlgorithmsTechnical Screen - YahooMediumData ScientistSolve Data Structure Challenges with Python Algorithms
This question evaluates proficiency in fundamental data structure manipulation and string-processing algorithms, specifically preserving insertion order during list deduplication and performing iterative overlap-based word merging.
Coding & AlgorithmsTechnical Screen - YelpEasyData ScientistReturn Integers in Descending Ranked Order
This problem tests the ability to manipulate lists and sort data while maintaining the relative order of duplicate elements using common programming patterns.
Coding & AlgorithmsTechnical ScreenSortingArraysAlgorithms - Zest AIHardData ScientistCompute tree depth and meeting rooms
This question evaluates skills in tree traversal and recursion for computing maximum depth of a binary tree, alongside interval scheduling and resource allocation for determining the minimum number of meeting rooms, testing reasoning about data structures such as trees and interval endpoints.
Coding & AlgorithmsOnsite - ZillowMediumMachine Learning EngineerImplement k-th largest in a number stream
This question evaluates proficiency with data structures and order-statistics in a streaming context, focusing on API design and time/space complexity trade-offs within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - ZillowMediumMachine Learning EngineerImplement placeholder-based pattern matcher
Implement placeholder-based pattern matcher evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - ZipHQMediumSoftware EngineerCompute maximum sum in a tree without adjacency
This question evaluates dynamic programming on trees and graph component identification by requiring selection of non-adjacent nodes to maximize a sum, targeting skills in tree algorithms, constraint-based optimization, and rigorous correctness and complexity reasoning.
Coding & AlgorithmsTechnical Screen - ZipHQMediumSoftware EngineerFind flush and straight groups in cards
This question evaluates array and string manipulation, grouping and sequence-detection competencies, specifically handling same-rank aggregation and same-suit consecutive runs with overlap and maximality considerations.
Coding & AlgorithmsOnsite - ZipHQMediumSoftware EngineerFind root IDs and paths
This question evaluates understanding of graph/tree relationships, identification of root nodes, and path reconstruction from parent references, assessing algorithmic reasoning and data-structure familiarity.
Coding & AlgorithmsTechnical Screen - ZipHQHardSoftware EngineerFind the Guaranteed Capture Time in a Turn-Based Graph Game
Solve guaranteed capture time in a finite turn-based graph pursuit game, including Jerry-first moves, staying, optimal adversarial play, and infinite evasion on cycles.
Coding & AlgorithmsTechnical Screen - ZipHQMediumSoftware EngineerMaximize non-adjacent sum on an N-ary tree
This question evaluates skills in tree-based dynamic programming, recursive traversal, and per-node state management for selecting non-adjacent nodes in an N-ary tree.
Coding & AlgorithmsTechnical Screen - ZiplineMediumSoftware EngineerImplement a Maximum-Tracking Stack
This question evaluates competency in data structure design and algorithmic analysis, focusing on stack operations augmented with maximum-tracking and correctness when multiple maximal elements and ordering constraints are present.
Coding & AlgorithmsTechnical Screen - ZiprecruiterMediumSoftware EngineerDesign a voting counter for restaurants
This question tests the ability to manage real-time updates to counters using hash maps and to implement a deterministic sorting logic for ranking items with tie-breaking rules.
Coding & AlgorithmsOnsiteHash MapSystem DesignSorting - ZiprecruiterEasyMachine Learning EngineerFind Neighboring Records by Identifier
This question tests the ability to manage ordered sequences and perform O(log n) lookups to retrieve adjacent elements in a dataset.
Coding & AlgorithmsTechnical ScreenBinary SearchArraysEfficiency - ZooxHardSoftware EngineerCan a Car Meet a Truck?
This problem tests your ability to determine if two entities moving on a 2D grid can ever occupy the same coordinate at the same time, using interval arithmetic and pathfinding logic.
Coding & AlgorithmsOnsiteGeometryAlgorithmsSimulation - ZooxEasyData ScientistChoose fastest way to transfer 2 TB
This question evaluates a candidate's ability to compare large-scale data transfer methods and reason about trade-offs among bandwidth, latency, security, cost, and logistics, reflecting competency in data engineering, networking, and systems design.
Coding & AlgorithmsOnsite - ZooxMediumMachine Learning EngineerCompute Roller Coaster Scores
Tests string parsing, floating-point evaluation, conditional logic, and the implementation of an extensible rule-based scoring engine for ride telemetry.
Coding & AlgorithmsTechnical ScreenString ParsingImplementationDesign Patterns - ZooxMediumSoftware EngineerLane-Change Safety and Longitudinal Motion Simulation
Implement a discrete-time kinematic simulator to evaluate whether an autonomous vehicle can safely execute a lane change given adjacent lead and lag vehicles.
Coding & AlgorithmsTechnical Screensimulationkinematicsautonomous-vehicles - ZooxMediumSoftware EngineerThree Array Problems for Trading Geometry and Grouping
Implement three foundational utility functions for an algorithmic trading log analyzer: maximum single-transaction profit, detection of four collinear price points, and deterministic equivalence grouping of trader nicknames.
Coding & AlgorithmsTechnical ScreenArrayGeometryUnion Find - ZooxMediumData EngineerWrite SQL revenue and anomaly queries
This question evaluates SQL proficiency and data engineering competency in revenue aggregation, netting purchases and refunds, joining transaction and vendor tables, and designing data quality and anomaly detection checks.
Coding & AlgorithmsOnsite - ZooxMediumData EngineerWrite Transaction Analytics SQL Queries
This question evaluates proficiency in SQL for analytical queries, covering aggregation, time-based filtering, joins between transactions and vendor metadata, and the use of ranking/window functions for top-N calculations.
Coding & AlgorithmsTechnical Screen - dYdXMediumSoftware EngineerSolve shortest and label-similar paths
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve shortest and label-similar paths states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - eBayMediumSoftware EngineerAssign Ads to Browser Positions
This question evaluates algorithmic problem-solving around randomized selection, constraint-based resource allocation, and per-user state management, including enforcing eligibility rules and incrementing display counts.
Coding & AlgorithmsTechnical Screen - eBayMediumSoftware EngineerCompute the Wait for a Warmer Day
This problem tests your ability to efficiently find the distance to the next greater element in an array, typically requiring an O(n) approach using a monotonic stack.
Coding & AlgorithmsOnsiteArraysStackMonotonic Stack - eBayMediumSoftware EngineerCount Connected Land Regions
This question evaluates understanding of graph connectivity and grid traversal, specifically the detection of connected components within a 2D matrix. It is commonly asked to assess algorithmic problem-solving, efficiency and handling of matrix-based data structures; it belongs to the Coding & Algorithms domain and tests practical implementation skills alongside conceptual understanding of graph-related complexity under the given input constraints.
Coding & AlgorithmsTechnical Screen - eBayHardSoftware EngineerDetermine Reachability for a Chinese-Chess Horse with Blocked Legs
Determine if a Chinese-chess horse can reach a target coordinate on a 10x9 board while respecting obstacle-blocked destinations and 'hobbled leg' movement constraints.
Coding & AlgorithmsTechnical Screenbfsgraphmatrix - eBayMediumSoftware EngineerDetermine Whether a String Is a Valid Number
Implement a strict numeric string validator that checks whether an ASCII string conforms to valid integer, decimal, and scientific notation formats.
Coding & AlgorithmsTechnical ScreenStringFinite AutomataParsing - eBayMediumSoftware EngineerFind K most frequent elements
This question tests the ability to combine frequency maps with selection algorithms or heap-based structures to efficiently identify top-k elements.
Coding & AlgorithmsTechnical ScreenHash MapHeapBucket Sort - eBayMediumSoftware EngineerFind the Container with the Most Water
This problem tests your ability to optimize an O(n^2) brute-force approach into an O(n) two-pointer solution by leveraging geometric constraints.
Coding & AlgorithmsOnsiteArraysTwo PointersGreedy