Coding & Algorithms interview questions

Showing 3211–3240 of 3276 results

• Merge words by head-tail chainingMedium

  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.

  YahooData ScientistCoding & AlgorithmsTechnical Screen
• Rank Items by Dot-Product Similarity to a User Embedding, Excluding Seen ItemsEasy

  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.

  YahooMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Solve Data Structure Challenges with Python AlgorithmsMedium

  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.

  YahooData ScientistCoding & AlgorithmsTechnical Screen
• Return Integers in Descending Ranked OrderEasy

  This problem tests the ability to manipulate lists and sort data while maintaining the relative order of duplicate elements using common programming patterns.

  YelpData ScientistCoding & AlgorithmsTechnical Screen
• Compute tree depth and meeting roomsHard

  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.

  Zest AIData ScientistCoding & AlgorithmsOnsite
• Implement k-th largest in a number streamMedium

  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.

  ZillowMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement placeholder-based pattern matcherMedium

  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.

  ZillowMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Compute maximum sum in a tree without adjacencyMedium

  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.

  ZipHQSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find flush and straight groups in cardsMedium

  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.

  ZipHQSoftware EngineerCoding & AlgorithmsOnsite
• Find root IDs and pathsMedium

  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.

  ZipHQSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Guaranteed Capture Time in a Turn-Based Graph GameHard

  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.

  ZipHQSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize non-adjacent sum on an N-ary treeMedium

  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.

  ZipHQSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Maximum-Tracking StackMedium

  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.

  ZiplineSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a voting counter for restaurantsMedium

  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.

  ZiprecruiterSoftware EngineerCoding & AlgorithmsOnsite
• Find Neighboring Records by IdentifierEasy

  This question tests the ability to manage ordered sequences and perform O(log n) lookups to retrieve adjacent elements in a dataset.

  ZiprecruiterMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Can a Car Meet a Truck?Hard

  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.

  ZooxSoftware EngineerCoding & AlgorithmsOnsite
• Choose fastest way to transfer 2 TBEasy

  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.

  ZooxData ScientistCoding & AlgorithmsOnsite
• Compute Roller Coaster ScoresMedium

  Tests string parsing, floating-point evaluation, conditional logic, and the implementation of an extensible rule-based scoring engine for ride telemetry.

  ZooxMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Lane-Change Safety and Longitudinal Motion SimulationMedium

  Implement a discrete-time kinematic simulator to evaluate whether an autonomous vehicle can safely execute a lane change given adjacent lead and lag vehicles.

  ZooxSoftware EngineerCoding & AlgorithmsTechnical Screen
• Three Array Problems for Trading Geometry and GroupingMedium

  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.

  ZooxSoftware EngineerCoding & AlgorithmsTechnical Screen
• Write SQL revenue and anomaly queriesMedium

  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.

  ZooxData EngineerCoding & AlgorithmsOnsite
• Write Transaction Analytics SQL QueriesMedium

  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.

  ZooxData EngineerCoding & AlgorithmsTechnical Screen
• Solve shortest and label-similar pathsMedium

  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.

  dYdXSoftware EngineerCoding & AlgorithmsTechnical Screen
• Assign Ads to Browser PositionsMedium

  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.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute the Wait for a Warmer DayMedium

  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.

  eBaySoftware EngineerCoding & AlgorithmsOnsite
• Count Connected Land RegionsMedium

  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.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Reachability for a Chinese-Chess Horse with Blocked LegsHard

  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.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Whether a String Is a Valid NumberMedium

  Implement a strict numeric string validator that checks whether an ASCII string conforms to valid integer, decimal, and scientific notation formats.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Find K most frequent elementsMedium

  This question tests the ability to combine frequency maps with selection algorithms or heap-based structures to efficiently identify top-k elements.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Container with the Most WaterMedium

  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.

  eBaySoftware EngineerCoding & AlgorithmsOnsite