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 211–240 of 1706 results
- AppleMediumSoftware EngineerImplement deep clone for complex objects
This question evaluates mastery of deep object cloning, reference and memory management, and knowledge of language runtime details such as prototypes, property descriptors, symbol-keyed and non-enumerable properties, and built-in types like Maps, Sets, Dates, RegExps, and typed arrays.
Coding & AlgorithmsTechnical Screen - AppleEasySoftware EngineerImplement flood fill using BFS and DFS
This question tests the ability to implement graph traversal algorithms (BFS and DFS) on a 2D grid, focusing on boundary conditions and state management.
Coding & AlgorithmsTechnical ScreenGraphBFSDFS - AppleMediumAnalytics EngineerImplement most frequent key without using max()
Category: Coding & Algorithms — this problem evaluates frequency counting, dictionary-based aggregation, string handling, manual maximum-finding without built-in functions, and stable tie-breaking by first appearance in the input.
Coding & AlgorithmsTechnical Screen - AppleEasyData EngineerImplement most_frequent_key without using max()
This question evaluates proficiency in Python fundamentals and object-oriented inheritance, focusing on frequency aggregation using a precomputed dictionary, iteration over mappings, and correct handling of ties and empty inputs.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerMaximize funds with capital-gated projects
Maximize funds with capital-gated projects 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 - AppleMediumSoftware EngineerMerge overlapping time intervals
This problem tests your ability to manipulate array-based data using sorting and linear scanning to identify and merge overlapping intervals.
Coding & AlgorithmsTechnical ScreenSortingIntervalsGreedy - AppleHardSoftware EngineerMinimum Cells to Bridge a Magic Grid
Tests graph modeling and shortest-path optimization on a 2D grid with zero-weight transitions and unit-weight bridges using 0-1 BFS or Dijkstra's algorithm.
Coding & AlgorithmsTechnical ScreenGraph0-1 BFSMatrix - AppleMediumSoftware EngineerMultiply Two Sparse Matrices
This problem tests your ability to optimize matrix multiplication by leveraging data sparsity to avoid unnecessary computations and handle memory efficiently.
Coding & AlgorithmsTechnical ScreenArraysMatricesOptimization - AppleMediumMachine Learning EngineerRotate a Matrix In Place
This question evaluates proficiency in in-place matrix and array manipulation, spatial data transformation, and reasoning about time and space complexity.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSimulate a Fixed-Capacity Least-Recently-Used Cache over a Stream of Operations
A coding question that asks you to implement a fixed-capacity key-value cache with least-recently-used eviction and run it over a stream of get and put operations. It tests precise recency and eviction rules, updates to keys already in the cache, and the design of a data structure with constant-time operations.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSolve 15 common Apple coding questions
This set evaluates algorithmic problem-solving and data-structure competence, including mastery of hash tables, linked lists, stacks, queues, heaps, graphs, sliding-window and two-pointer techniques, complexity analysis, and in-place transformations.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSolve 15 common interview problems
This collection evaluates algorithmic problem-solving skills, mastery of fundamental data structures (arrays, strings, hash maps, stacks, queues, trees, graphs, linked lists) and the ability to reason about time and space complexity.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSolve Digit-Square and Grid BFS Problems
This question evaluates understanding of digit-based state convergence and cycle detection alongside graph traversal and constrained shortest-path search, testing skills in number manipulation, state-space search, and BFS-style exploration.
Coding & AlgorithmsTechnical Screen - 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 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 - 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 - 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 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 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 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
Apple
Applied Intuition