Coding & Algorithms interview questions

Showing 391–420 of 3276 results

• Simulate Threshold Infection EfficientlyHard

  Simulate a synchronous threshold-based infection process on a grid using an incremental multi-source BFS to achieve optimal linear time complexity.

  AnthropicSoftware EngineerCoding & AlgorithmsOnsite
• Simulate stack traces from logsMedium

  This question evaluates stack-based simulation for computing exclusive execution time in nested function call logs and stream-processing concepts for handling equal timestamps, slight reordering, and detection of N consecutive categorical events.

  AnthropicSoftware EngineerCoding & AlgorithmsOnsite
• Solve programming task with follow-upsMedium

  This question evaluates algorithmic problem-solving skills, including core algorithm implementation, handling a consecutive-N-element constraint, and designing an optimization that leverages suffix-related information.

  AnthropicSoftware EngineerCoding & AlgorithmsTechnical Screen
• Time-Based Key-Value StoreMedium

  Design a versioned key-value store that supports storing values at specific timestamps and retrieving the most recent value at or before a given timestamp.

  AnthropicSoftware EngineerCoding & AlgorithmsOnsite
• Word Search in a Letter GridMedium

  This problem tests the ability to implement a backtracking search on a 2D grid, optimized with a Trie data structure to efficiently search for multiple strings simultaneously.

  AnthropicSoftware EngineerCoding & AlgorithmsOnsite
• Character Frequency Count in a StringMedium

  This problem tests your ability to manipulate strings and utilize hash maps to count character frequencies while maintaining the original order of character appearance.

  AntraSoftware EngineerCoding & AlgorithmsTechnical Screen
• Longest Substring Without Repeating CharactersMedium

  This problem tests your ability to implement an efficient sliding window technique using a hash map to track character indices and maintain a valid substring constraint.

  AntraSoftware EngineerCoding & AlgorithmsTechnical Screen
• Capture Enclosed O Regions in an X/O Grid Using Union-Find Instead of Flood FillMedium

  Given a grid of X and O cells, capture every region of edge-connected O cells that does not touch the border by turning it into X, using a disjoint-set (union-find) structure instead of flood fill. Tests union-find implementation, mapping grid cells to set indices and correct border handling.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute conflicts and minimum meeting roomsHard

  This question evaluates the ability to reason about interval overlaps and resource allocation, testing algorithmic thinking and efficient handling of time-interval data in scheduling contexts and belongs to the Coding & Algorithms domain.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute island size in gridMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute island size in grid states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute minimum required meeting roomsMedium

  This question evaluates understanding of interval scheduling and resource-allocation concepts, proficiency with data structures for detecting temporal overlaps (heap and sweep-line paradigms), and the ability to analyze time and space complexity while handling edge cases.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute optimal matrix-chain multiplication orderHard

  This question evaluates dynamic programming, algorithmic analysis, and sensitivity reasoning for matrix-chain multiplication, and it belongs to the Coding & Algorithms domain; it is commonly asked because it tests understanding of optimal substructure, trade-offs in parenthesization, and correctness versus greedy heuristics.

  AppleData ScientistCoding & AlgorithmsOnsite
• Compute top three scores per studentMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute top three scores per student states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Convert a Roman Numeral to an IntegerMedium

  This problem tests your ability to parse string-based symbols while applying conditional arithmetic logic to handle additive and subtractive Roman numeral rules.

  AppleSoftware EngineerCoding & AlgorithmsOnsite
• Copy a Linked List with Random PointersMedium

  This problem tests your ability to manipulate linked structures and manage pointer state without using extra hash maps for space optimization.

  AppleSoftware EngineerCoding & AlgorithmsOnsite
• Count Islands in a Binary GridMedium

  This problem tests your ability to perform graph traversal on a 2D grid while adhering to strict memory constraints and preserving the integrity of the original data structure.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count subarrays with sum equals kHard

  This problem tests your ability to optimize subarray sum calculations using prefix sums and hash maps to achieve linear time complexity.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count the Nodes in a Chain Reachable Only Through Left and Right LinksMedium

  Starting from one node of a chain in which every node links only to its left and right neighbors, count the nodes in the whole chain. It tests traversal in both directions from an arbitrary node, handling of chain ends and single-node chains, and the design of your own test cases.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Debug a PyTorch U-Net shape mismatchMedium

  This question tests your ability to calculate the output dimensions of convolutional layers in a U-Net architecture and resolve shape mismatches caused by cropping or padding requirements during feature map concatenation.

  AppleMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Decode a Run-Length Encoded String Where a Missing Count Means OneMedium

  Implement a decoder for run-length encoded strings in which each lowercase letter is followed by an optional repeat count, so that a5b3c becomes aaaaabbbc. It tests careful string parsing, multi-digit counts, letters written without a count, and writing your own test cases.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a rolling five-minute hit counterMedium

  This question evaluates understanding of data-structure selection, amortized time complexity, space-time trade-offs, sliding-window state management for expiring events, and the ability to design a concise API with unit tests.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a snapshotable key-value storeMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Design a snapshotable key-value store states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design card deck with shuffle and orderMedium

  This question evaluates understanding of data modeling and API design for a deck abstraction, algorithmic handling of randomization and sorting, and the ability to analyze time and space complexity.

  AppleSoftware EngineerCoding & AlgorithmsOnsite
• Determine Whether an Undirected Graph Is Two-ColorableMedium

  Determine whether an undirected graph with disconnected components, potential self-loops, and parallel edges can be colored using two colors such that no two adjacent vertices share the same color.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Encode and Rebuild a Binary TreeHard

  This question evaluates skills in data structure serialization and deserialization, binary tree representation, and algorithmic design for deterministic data formats.

  AppleData EngineerCoding & AlgorithmsTechnical Screen
• Find All Tree Nodes at Distance KMedium

  This problem tests tree traversal, graph representation (converting a tree to an undirected graph), and breadth-first search (BFS) to find nodes at a specific distance.

  AppleSoftware EngineerCoding & AlgorithmsOnsite
• Find Common Prefix Across StringsEasy

  This question tests the ability to manipulate strings and iterate through arrays to find the longest common prefix among a list of words, emphasizing efficiency and edge-case handling.

  AppleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Maximum Sum of Contiguous Subarray Length kMedium

  This question evaluates skill in array manipulation and computing aggregate metrics over fixed-length intervals, along with understanding of algorithmic complexity and trade-offs between runtime and memory.

  AppleData ScientistCoding & AlgorithmsTechnical Screen
• Find Minimum Processing RateMedium

  This problem tests your ability to use binary search on a search space to find an optimal minimum processing rate that satisfies a global deadline constraint.

  AppleMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find Smallest Missing Positive Integer in O(n) TimeMedium

  This question evaluates a candidate's skill in array algorithms and in-place algorithm design, emphasizing understanding of time and space complexity and handling edge cases when identifying the smallest missing positive integer.

  AppleData ScientistCoding & AlgorithmsOnsite