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 451–480 of 3276 results
- AppleMediumSoftware EngineerSolve Subset Sum And Return All Matching Subsets
This problem tests your ability to navigate the trade-off between dynamic programming and backtracking to find all unique combinations of elements that sum to a target value.
Coding & AlgorithmsTechnical ScreenBacktrackingRecursionSorting - AppleMediumSoftware EngineerSolve interval, grid-fill, and heap tasks
These combined tasks evaluate algorithmic problem-solving and data-structure design skills, specifically interval aggregation and counting over large timestamp ranges, constructive grid-filling with 4-directional connectivity constraints, and multiset operations supporting efficient retrieval and removal of minima and maxima.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSolve linked list, grid BFS, and median queries
This problem tests your ability to manipulate linked list pointers in-place, perform a multi-source Breadth-First Search on a grid, and maintain a sorted structure to retrieve medians efficiently.
Coding & AlgorithmsOnsiteLinked ListBFSHeaps - AppleMediumSoftware EngineerSolve mixed coding tasks from interviews
This question evaluates binary tree traversal and leaf detection, calendrical date arithmetic and palindrome checking, discrete-time edge-detection/stateful sequence processing, and implementation of comparison-based sorting; category/domain: Coding & Algorithms. It is commonly asked to assess correctness and edge-case handling (e.g.
Coding & AlgorithmsTechnical Screen - AppleMediumMachine Learning EngineerSolve stock and banana problems
This question evaluates algorithmic problem-solving skills related to array processing, optimization under constraints, and reasoning about performance trade-offs by presenting a maximum single-transaction stock profit problem and a minimum banana-eating speed problem.
Coding & AlgorithmsOnsite - AppleEasySoftware EngineerSolve three easy algorithm problems
This multi-part prompt evaluates proficiency in fundamental algorithmic concepts including sorted array handling, single-transaction optimization in time-series data, and bracket-sequence validation, measuring understanding of array and string manipulation, common data structures, algorithmic complexity, and edge-case reasoning.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSort and merge string lists by length
This question evaluates understanding of sorting algorithms, stability, merging strategies, and time/space complexity analysis when ordering strings by length, and is categorized under Coding & Algorithms.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerUnit Ratio Queries Across Independent Unit Families with Modular Answers
A graph coding problem: given multiplicative conversion factors between units that split into independent families, answer queries for how many units of one unit equal one unit of another, returning the ratio modulo a prime or -1 when the units cannot be converted. It tests graph traversal over a forest and modular arithmetic.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerVertical Order Traversal of a Binary Tree
This problem tests your ability to map tree nodes to a 2D coordinate system and group them based on their horizontal distance from the root, followed by specific sorting criteria.
Coding & AlgorithmsOnsiteBinary TreeHash TableSorting - AppleMediumMachine Learning EngineerWrite a generator for substring pattern matches
This question evaluates understanding of string pattern matching and generator/iterator design, testing skills in handling overlapping matches, streaming output, and worst-case time complexity considerations.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerZero out duplicates and sort an array
This question evaluates proficiency in array manipulation, duplicate handling, and custom sorting logic with attention to time and space complexity, and it falls within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerCompress vertices into uniques and indices
This question tests the ability to efficiently identify unique elements in a sequence while maintaining their original relative order, mapping them to integer indices to compress a large dataset.
Coding & AlgorithmsOnsiteHashingData StructuresOptimization - Applied IntuitionMediumSoftware EngineerDesign a nested transaction store
This question evaluates understanding of transactional state management, nested transaction semantics, scope resolution, and data-structure design for an in-memory key–value store.
Coding & AlgorithmsOnsite - Applied IntuitionMediumSoftware EngineerDesign a transactional in-memory key–value store
This question evaluates understanding of transactional state management, nested transaction semantics, scope shadowing, and efficient data-structure design for an in-memory key–value store, assessing competency in correctness, consistency, and algorithmic complexity under nested BEGIN/ROLLBACK/COMMIT operations.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerEvaluate Dependent Variable Assignments
Evaluate a list of variable assignment statements where variable values can depend on variables defined later in the input. The problem tests expression parsing, cycle detection, dependency resolution via topological ordering or memoized depth-first search, and deep recursion handling.
Coding & AlgorithmsTechnical Screengraphtopological-sortparsing - Applied IntuitionEasySoftware EngineerEvaluate variables in simple arithmetic DSL
This question evaluates implementation skills in parsing and evaluating a small arithmetic DSL, covering variable assignment parsing, symbol resolution, and evaluation order; it falls under the Coding & Algorithms category and emphasizes practical application and engineering of a correct evaluator rather than abstract theory.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerFind duplicate files by size
This question evaluates file parsing, data deduplication and grouping skills along with algorithmic efficiency and space-time trade-offs when identifying duplicate files by size rather than by content.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerFind first and last occurrence in sorted array
This question tests the ability to modify the standard binary search algorithm to achieve logarithmic time complexity when searching for the boundary indices of a target value in a sorted array.
Coding & AlgorithmsTechnical ScreenBinary SearchArrayAlgorithms - Applied IntuitionMediumSoftware EngineerFind grid cell minimizing sum distances
This question evaluates proficiency in grid-based graph traversal and shortest-path computation using BFS, reachability analysis from multiple marked points, and algorithmic time/space complexity reasoning.
Coding & AlgorithmsTechnical Screen - Applied IntuitionEasySoftware EngineerFind intersection of two line segments
This question evaluates a candidate's skills in computational geometry and numerical robustness, focusing on line-segment intersection reasoning, endpoint touching, collinearity, and precision handling.
Coding & AlgorithmsOnsite - Applied IntuitionEasySoftware EngineerGroup duplicate files by content
This question evaluates understanding of file deduplication, efficient I/O and hashing strategies, streaming large-file processing, and scalable algorithm design for identifying files with identical byte-for-byte contents.
Coding & AlgorithmsOnsite - Applied IntuitionMediumMachine Learning EngineerImplement a Fixed-Capacity Deque
This question evaluates proficiency with double-ended queue semantics, fixed-capacity data structure design, constant-time (O(1)) operations, and correct handling of boundary conditions and wraparound.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerImplement a fixed-capacity generic circular buffer
This question tests the ability to implement a space-efficient data structure using fixed-size arrays, modular arithmetic for index wrapping, and generic type constraints.
Coding & AlgorithmsOnsiteData StructuresArraysGenerics - Applied IntuitionMediumSoftware EngineerImplement a single-thread task scheduler API
This problem tests your ability to design a priority-based scheduler using a min-heap to manage tasks triggered by relative or absolute timestamps, ensuring execution occurs in the correct temporal order.
Coding & AlgorithmsOnsiteData StructuresPriority QueueAlgorithms - Applied IntuitionHardSoftware EngineerMerge Overlapping Collinear Lane Segments Given as Integer Point Lists
Merge straight lane segments, each given as a list of collinear integer points, so that segments lying on the same line whose extents overlap or touch become one segment containing all of their points. It tests exact collinearity checks, handling of horizontal and vertical segments, and interval merging along each line.
Coding & AlgorithmsTechnical Screen - Applied IntuitionHardSoftware EngineerMerge Overlapping Collinear Segments
This question evaluates computational geometry and algorithm design skills, focusing on collinearity testing, projecting points onto a line, merging overlapping 1D intervals generalized to arbitrary lines, ordering points along a line, and handling duplicates and edge cases.
Coding & AlgorithmsTechnical Screen - Applied IntuitionHardSoftware EngineerMerge Overlapping Straight Fence Runs From a Property Survey
Collapse a pile of straight fence-line survey readings into one run per physically continuous stretch of fence, by detecting which readings sit on the same infinite line and connect up. Tests exact collinearity detection, correct handling of every orientation, and interval merging per line.
Coding & AlgorithmsTechnical Screengeometryunion-findsorting - Applied IntuitionMediumSoftware EngineerMerge collinear overlapping 2D segments
This problem tests your ability to handle geometric data by identifying and merging overlapping segments that lie on the same infinite line.
Coding & AlgorithmsTechnical ScreenGeometryIntervalsSorting - Applied IntuitionMediumSoftware EngineerMerge overlapping 2D line segments
This problem tests your ability to handle geometric data by sorting and merging 1D intervals that exist within a 2D space, specifically focusing on collinear segments.
Coding & AlgorithmsTechnical ScreenGeometrySortingIntervals - Applied IntuitionMediumSoftware EngineerMulti-Agent Collision Simulator (Unicycle Kinematics)
Implement a discrete-time multi-agent simulator using unicycle kinematics and forward Euler integration to track agent trajectories and detect inter-agent collisions.
Coding & AlgorithmsTechnical ScreenRoboticsSimulationGeometry
Apple
Applied Intuition