Coding & Algorithms interview questions

Showing 1–30 of 3276 results

• Count Squares from Points in the PlaneMedium

  This problem tests your ability to efficiently store spatial coordinates and leverage geometric properties (like midpoints or diagonals) to detect squares within a 2D plane.

  6SenseSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Largest K Elements with PartitioningMedium

  Find the largest k occurrences with partition-based selection, sort only the output, and compare quickselect pivot risks with heap and full-sort alternatives.

  AMDSoftware EngineerCoding & AlgorithmsOnsite
• Design a duplicate-file removal algorithmMedium

  Design a duplicate-file removal algorithm 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.

  Abnormal SecuritySoftware EngineerCoding & AlgorithmsTechnical Screen
• Expand a Nested Repeat-Count Encoded StringHard

  From an Abridge online assessment: decode a string in which k[text] means the bracketed text repeated k times, with multi-digit counts, nested brackets and plain letters between encoded parts. It tests parsing nested structure correctly and building the expanded output efficiently.

  AbridgeSoftware EngineerCoding & AlgorithmsOnline Assessment
• Run-Length Compress a Character List With Multi-Digit CountsHard

  From an Abridge online assessment: run-length compress a list of characters, writing each run of equal adjacent characters as the character followed by its length, with lengths of 10 or more split into separate digit characters. It tests careful run handling and the in-place, constant-space form of the problem.

  AbridgeSoftware EngineerCoding & AlgorithmsOnline Assessment
• Sum of Integers Up to n Divisible by 3, 5, or 7Hard

  From an Abridge online assessment: given a positive integer n, return the sum of all integers from 1 to n that are divisible by 3, 5 or 7, adding numbers such as 15 or 21 only once. It tests precise handling of overlapping divisibility conditions and inclusive range boundaries.

  AbridgeSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum racks for 2D bin packingMedium

  This question evaluates understanding of combinatorial optimization and multi-dimensional bin packing, assessing algorithmic design, resource-allocation reasoning, and computational complexity awareness.

  AccentureSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Transactional In-Memory TableMedium

  Design an in-memory tabular data store that supports transactional modifications (create, update, delete, find-and-replace) with commit and rollback capabilities.

  AddeparSoftware EngineerCoding & AlgorithmsTechnical Screen
• Advance Game of Life with Reduced Auxiliary StorageMedium

  This problem tests array manipulation techniques, specifically bitwise operations and modular arithmetic, to transform a grid in-place while preserving original state information for simultaneous updates.

  Additive AiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Score Difference in Reversing Array GameEasy

  This question tests the ability to manage state changes while iterating through an array based on index-dependent rules, specifically involving conditional array modifications.

  AdiaData ScientistCoding & AlgorithmsTechnical Screen
• Build a React team builder with role constraintsMedium

  This problem tests your ability to manage complex UI state in React, enforce business constraints (role limits) during data manipulation, and implement stable UI rendering based on sorted state.

  AdobeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a nested-list iteratorMedium

  This question evaluates the ability to implement an efficient iterator over nested lists, testing skills in iterator state management, lazy traversal, explicit stack usage, and algorithmic complexity reasoning.

  AdobeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine feasible task orderingMedium

  This question evaluates knowledge of graph algorithms and dependency management, emphasizing concepts such as topological ordering and cycle detection and the ability to determine feasibility and produce a valid execution sequence.

  AdobeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine if a multiple-sum subarray existsMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Determine if a multiple-sum subarray exists states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  AdobeMachine Learning EngineerCoding & AlgorithmsOnsite
• Determine task order with prerequisitesMedium

  This question evaluates a candidate's proficiency with graph-theoretic concepts like dependency modeling and cycle detection, and their ability to produce valid task orderings under constraints within the Coding & Algorithms domain.

  AdobeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Lowest Common Ancestor Only When Both Nodes ExistMedium

  Return the lowest common ancestor of two target values only when both are present in a potentially skewed binary tree. Handle absent targets, equal targets, empty input, and cases where one target is the ancestor.

  AdobeSoftware EngineerCoding & AlgorithmsOnsite
• Implement K-means clustering from scratchMedium

  This problem tests your understanding of the K-means clustering algorithm, specifically the iterative process of centroid initialization, assignment, and update steps.

  AdobeMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement file word countMedium

  This question evaluates a candidate's skills in text processing, large-scale I/O, token normalization, memory-constrained computation and algorithmic trade-offs for frequency aggregation, and it falls under the Coding & Algorithms domain because it combines parsing, data structures and external processing concerns.

  AdobeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Return a Binary Tree in Level OrderMedium

  Return a binary tree's values grouped by depth in level order while preserving left-to-right order within each level. Handle empty, repeated-value, skewed, and very large trees without changing the requested nested output shape.

  AdobeSoftware EngineerCoding & AlgorithmsOnsite
• Traverse a path and print directory treeMedium

  This problem tests your ability to recursively traverse a directory structure and format the output into a human-readable, indented tree structure while handling potential I/O errors.

  AdobeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement LRU and target-sum combinationsMedium

  Implement LRU and target-sum combinations 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.

  AdyenSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find two numbers summing to targetMedium

  This question evaluates algorithm design and complexity analysis skills, specifically the ability to identify element pairs in arrays and reason about time-space tradeoffs.

  AeoneaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a tennis score trackerMedium

  This question evaluates a candidate's ability to implement stateful scoring logic and choose appropriate data structures for tracking sequential events, specifically handling tennis scoring rules such as 0/15/30/40 progression, Deuce, Advantage, and the two-point lead requirement.

  AeoneaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Aggregate loans and match repaymentsMedium

  Implement a transaction matching engine that aggregates user loans and allocates repayments chronologically to outstanding balances using a FIFO waterfall approach.

  AffirmSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Balances and Minimize SettlementsHard

  Tests transaction aggregation into net balances and combinatorial optimization (backtracking/bitmask DP) to find the minimum number of settlement transfers needed to clear all debts.

  AffirmSoftware EngineerCoding & AlgorithmsOnsite
• Detect fraud events and extract PIIMedium

  This problem tests your ability to process nested JSON-like structures, perform deduplication, and map related entities to detect fraudulent patterns.

  AffirmSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Redeemable Promotion OffersMedium

  This problem tests your ability to manage stateful constraints by processing a stream of promotional event logs to determine if a user remains eligible for a discount based on a per-user, per-promotion usage limit.

  AffirmSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find shortest unique substring per wordMedium

  This problem tests your ability to manipulate string data structures (like Tries or Suffix Trees) to efficiently identify the shortest, lexicographically smallest substring that is unique to a given word within a provided collection.

  AffirmSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an LRU cacheEasy

  This question tests the ability to combine a hash map and a doubly linked list to achieve constant-time performance for both data retrieval and update operations in a cache.

  AffirmSoftware EngineerCoding & AlgorithmsOnsite
• Compute triangle min path and dice stopping statsMedium

  This composite question evaluates dynamic programming and algorithmic optimization via the triangle minimum path problem and probability, stopping-time analysis and Monte Carlo simulation through the two-dice experiment, testing competencies in DP, discrete probability, expected-value reasoning and empirical estimation.

  AgodaSoftware EngineerCoding & AlgorithmsTechnical Screen