Coding & Algorithms interview questions

Showing 721–750 of 3276 results

• Sort Every Concentric Matrix Border ClockwiseMedium

  This problem tests array traversal, boundary management, and sorting logic by requiring you to isolate concentric layers of a matrix and sort their contents independently.

  Capital OneSoftware EngineerCoding & AlgorithmsOnline Assessment
• Sort Matrix Diagonals By Their ValuesMedium

  Tests matrix traversal along anti-diagonals, string formation, and custom multi-key sorting with deterministic tie-breaking.

  Capital OneSoftware EngineerCoding & AlgorithmsTechnical Screen
• Sorted Sums of Absolute Differences Over All Cyclic Shifts of an ArrayMedium

  Given two integer arrays of equal length, compute the sum of absolute differences between the second array and every cyclic rotation of the first, then return all of these sums in non-descending order. It tests rotation index arithmetic, accumulation over every shift, and exact output ordering.

  Capital OneSoftware EngineerCoding & AlgorithmsOnline Assessment
• Sum of Distinct Values on the Borders of All Maximum-Sum Square FramesHard

  Among all square frames of a given size inside an integer matrix, find those with the largest border sum, then add up the distinct values that appear on the borders of every such frame. Tests careful border enumeration that excludes interior cells, tie handling across several frames, and de-duplication by value.

  Capital OneSoftware EngineerCoding & AlgorithmsOnline Assessment
• Support updates and count target-sum pairsHard

  This problem tests the ability to maintain frequency counts of elements in a dynamic dataset and perform efficient range-sum queries for pairs that satisfy a target condition.

  Capital OneMachine Learning EngineerCoding & AlgorithmsOnline Assessment
• Top Two Teams by Points, Then Goal Difference, Then Goals ScoredMedium

  Given parallel arrays of wins, draws, goals scored and goals conceded for each team, compute points as three per win plus one per draw and return the indices of the top two teams. Ties are broken by goal difference, then goals scored, then index, testing multi-key comparison and careful tie handling.

  Capital OneSoftware EngineerCoding & AlgorithmsHR Screen
• Validate Unit-Test Coverage and Identify Missing ScenariosMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Validate Unit-Test Coverage and Identify Missing Scenarios states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  Capital OneData ScientistCoding & AlgorithmsOnsite
• Reverse a Character Array In PlaceMedium

  This problem tests the ability to manipulate array elements in-place using two-pointer logic while adhering to strict space complexity constraints.

  CargurusData ScientistCoding & AlgorithmsTechnical Screen
• Spell Out a Nonnegative IntegerEasy

  This question evaluates a candidate's ability to decompose integers and implement precise string-formatting logic, including mapping numeric values to their English word equivalents and managing scale units and boundary conditions.

  CarvanaSoftware EngineerCoding & AlgorithmsOnsite
• Implement Binary Search in C++Medium

  This question evaluates proficiency in implementing binary search in C++, focusing on iterative control flow, correct handling of not-found cases, boundary conditions, and understanding of algorithmic correctness.

  CerebrasSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement and Optimize Vector MultiplicationMedium

  This question evaluates a candidate's ability to implement vector–vector multiplication and to reason about performance optimizations and sparse data structures, assessing competencies in algorithm design, parallel computing, memory hierarchy, and numerical operations.

  CerebrasSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute rainwater accumulation on a height gridMedium

  Tests the ability to simulate 2D fluid accumulation using priority-queue-based graph traversal (similar to Dijkstra's algorithm) to track spilling boundaries.

  ChalkSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Shortest Covering SubstringMedium

  This problem tests your ability to use the sliding window technique and hash maps to find the smallest window in a string that contains all characters of a target pattern.

  Character.AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Explore an HTTP MazeMedium

  This question evaluates the ability to integrate HTTP-based APIs with graph traversal and state management, covering concepts such as breadth-first exploration for shallow-first search, cycle avoidance, transient error handling, and key-lock resource constraints.

  ChariotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build an Ordered Latest-Quote ContainerMedium

  Build an insertion-ordered container that stores only the latest quote for each stock symbol. Support expected O(1) push, pop, and size operations while updating bid and ask values without changing a symbol's original position and safely rejecting malformed commands.

  Chicago Trading CompanySoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Constant-Time Simple Moving AverageMedium

  Implement a fixed-window simple moving average with O(1) processing for every valid add and query. Maintain a rolling sum and bounded queue, average the samples available before the window fills, and return deterministic results for empty, malformed, or unknown operations.

  Chicago Trading CompanySoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Nested Dictionaries IterativelyEasy

  This question evaluates a candidate's skill in iterative data structure manipulation and handling of nested dictionary merging semantics, including conflict resolution and value overriding.

  Chicago Trading CompanySoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement single-tab browser history navigationMedium

  This question evaluates understanding of data structures, stateful API behavior, amortized time complexity, set membership tracking, and edge-case handling for implementing browser-like history navigation in the coding & algorithms domain.

  ChimeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Simulate toppling board game outcomeMedium

  This question evaluates a candidate's ability to implement a discrete board-game simulation, including state management, turn-based ownership semantics, stack-based piece handling, capture mechanics, and game termination detection.

  ChimeSoftware EngineerCoding & AlgorithmsOnsite
• Solve classic backend coding problemsMedium

  This problem tests your ability to handle string manipulation, recursion with backtracking, and mapping logic by generating all valid word combinations from a numeric keypad sequence.

  ChimeBackend EngineerCoding & AlgorithmsTechnical Screen
• Implement Recipe Storage CRUDHard

  This question evaluates the ability to design and implement in-memory data structures and APIs for CRUD operations, covering skills such as ID generation and parsing, string handling for case-insensitive uniqueness constraints, data modeling, and preserving original value casing.

  CircleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a simplified multi-level banking systemMedium

  Implement a simplified multi-level banking system 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.

  CircleSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement cheapest itinerary with date filtersMedium

  This question evaluates proficiency in graph algorithms and constrained pathfinding, including handling date filters for initial departures, time-ordered connections, cycle avoidance, and quantitative complexity analysis.

  CircleSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement an LFU CacheHard

  This problem tests your ability to design a data structure that supports O(1) insertions and lookups while managing cache eviction based on access frequency and recency.

  CiscoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Longest Substring Without Repeated CharactersEasy

  This problem tests string manipulation, hash map usage, and the sliding window technique to find a specific substring based on unique character constraints.

  CiscoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve max-subarray, min-unique, and grid-jumpMedium

  This question evaluates array algorithms and algorithmic problem-solving skills, specifically contiguous-sum optimization (greedy/DP reasoning), frequency counting and memory-constrained selection for unique minima, and grid traversal simulation with boundary and visit-state management.

  CiscoSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute BBO and NBBO from order dataMedium

  This question evaluates a candidate's skill in designing efficient data structures and algorithms for aggregating and querying order-book data, including computing best bid/ask prices and summing quantities at those prices.

  CitadelSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Every Fixed-Size Submatrix SumMedium

  Compute every contiguous fixed-size submatrix sum without mutating the input, using a padded two-dimensional prefix grid to answer each window in constant time.

  CitadelSoftware EngineerCoding & AlgorithmsOnsite
• Compute max team size with a core intervalMedium

  This question evaluates algorithmic problem-solving around interval overlap and time-complexity optimization, measuring the ability to determine the maximum team size given a core interval while reasoning about interval intersections and scalability; it is commonly asked to assess correctness and subquadratic runtime thinking, categorized under Coding & Algorithms and emphasizing practical algorithmic implementation. The follow-up evaluates combinatorics and counting under adjacency constraints with modular arithmetic and efficient handling of large parameters, commonly posed to test recurrence reasoning and scalable counting approaches, falling under combinatorics/dynamic programming and emphasizing conceptual understanding linked to practical algorithmic efficiency.

  CitadelSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute maximum later-earlier differenceMedium

  This problem tests your ability to optimize an O(n^2) brute-force search into an O(n) linear-time solution using a single-pass scan while maintaining state variables.

  CitadelSoftware EngineerCoding & AlgorithmsOnline Assessment