Coding & Algorithms interview questions

Showing 451–480 of 3276 results

• Solve Subset Sum And Return All Matching SubsetsMedium

  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.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve interval, grid-fill, and heap tasksMedium

  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.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve linked list, grid BFS, and median queriesMedium

  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.

  AppleSoftware EngineerCoding & AlgorithmsOnsite
• Solve mixed coding tasks from interviewsMedium

  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.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve stock and banana problemsMedium

  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.

  AppleMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve three easy algorithm problemsEasy

  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.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Sort and merge string lists by lengthMedium

  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.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Unit Ratio Queries Across Independent Unit Families with Modular AnswersMedium

  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.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Vertical Order Traversal of a Binary TreeMedium

  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.

  AppleSoftware EngineerCoding & AlgorithmsOnsite
• Write a generator for substring pattern matchesMedium

  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.

  AppleMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Zero out duplicates and sort an arrayMedium

  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.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compress vertices into uniques and indicesMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsOnsite
• Design a nested transaction storeMedium

  This question evaluates understanding of transactional state management, nested transaction semantics, scope resolution, and data-structure design for an in-memory key–value store.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsOnsite
• Design a transactional in-memory key–value storeMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate Dependent Variable AssignmentsMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate variables in simple arithmetic DSLEasy

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find duplicate files by sizeMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find first and last occurrence in sorted arrayMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find grid cell minimizing sum distancesMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find intersection of two line segmentsEasy

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsOnsite
• Group duplicate files by contentEasy

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsOnsite
• Implement a Fixed-Capacity DequeMedium

  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.

  Applied IntuitionMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement a fixed-capacity generic circular bufferMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsOnsite
• Implement a single-thread task scheduler APIMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsOnsite
• Merge Overlapping Collinear Lane Segments Given as Integer Point ListsHard

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Overlapping Collinear SegmentsHard

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Overlapping Straight Fence Runs From a Property SurveyHard

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge collinear overlapping 2D segmentsMedium

  This problem tests your ability to handle geometric data by identifying and merging overlapping segments that lie on the same infinite line.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge overlapping 2D line segmentsMedium

  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.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Multi-Agent Collision Simulator (Unicycle Kinematics)Medium

  Implement a discrete-time multi-agent simulator using unicycle kinematics and forward Euler integration to track agent trajectories and detect inter-agent collisions.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen