Coding & Algorithms interview questions

Showing 481–510 of 3276 results

• Parse a protobuf-like schema and answer queriesMedium

  This problem tests your ability to parse a hierarchical schema definition, resolve nested type references using a symbol table, and implement an efficient lookup function for type paths.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Resolve Dependent Addition EquationsHard

  Implement an equation evaluator that computes the integer values of variables defined in terms of literals and other variables while detecting cycles and undefined references.

  Applied IntuitionBackend EngineerCoding & AlgorithmsTechnical Screen
• Scale Game of Life to huge matricesMedium

  This question tests the ability to optimize grid-based simulations that exceed local memory capacity, focusing on sliding windows, buffer management, and efficient disk I/O.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Track simulations and report timeoutsHard

  This question evaluates competency in algorithms and data-structure design for real-time stream processing, including maintaining per-simulation state, handling time-based expirations, and reasoning about performance and correctness.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate JSON against a protobuf-like schemaMedium

  This problem tests your ability to recursively validate a JSON object against a structured schema definition and handle field presence constraints.

  Applied IntuitionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate Nested Configuration ObjectsHard

  This question evaluates schema validation skills including recursive data structures, primitive and composite type checking, and structured error reporting for configuration objects, categorized under Coding & Algorithms for a Machine Learning Engineer role and focused on practical implementation.

  Applied IntuitionMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Count invalid nodes in a BSTHard

  This question evaluates understanding of binary search tree invariants and the ability to identify nodes that violate ancestor-imposed value ranges, testing competency with tree data structures and constraint propagation in the coding & algorithms domain.

  ApplovinSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find missing value in sorted consecutive arrayEasy

  This question evaluates understanding of array properties and algorithmic complexity, specifically detecting a single missing element in a sorted consecutive sequence within the Coding & Algorithms category.

  AristaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Remove Target Values from a Linked ListEasy

  This question evaluates proficiency with singly linked list manipulation, specifically in-place node removal and correct pointer/reference management. It is commonly asked to assess practical coding ability with data structures, handling of edge cases and resource implications; category: Coding & Algorithms (Data Structures), level of abstraction: practical implementation-focused.

  AristaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve palindrome and missing-number variantsEasy

  This question evaluates competencies in string processing, array manipulation, binary search, and algorithmic complexity analysis by asking a palindrome check and a missing-number problem that requires both O(n) and O(log n) reasoning, emphasizing edge-case handling and time/space complexity discussion.

  AristaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fetch paginated data from two APIsMedium

  This question evaluates a candidate's competency in robust API retrieval, pagination handling, defensive data validation, and joining records across endpoints while preserving the order of source records and safely handling missing or malformed fields.

  ArmadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve common array/graph interview problemsMedium

  This problem tests your ability to manipulate matrices for grid traversal, apply BFS for shortest-path discovery in string transformations, and optimize sorting or counting logic for metric calculations.

  Art AdvisorsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Products Excluding Each IndexMedium

  This question evaluates array manipulation skills, arithmetic reasoning with cumulative products, edge-case handling for zeros and negative numbers, and time/space complexity optimization for in-place or constant-extra-space algorithms.

  AsanaSoftware EngineerCoding & AlgorithmsOnsite
• Find the K Closest Points to the OriginMedium

  This problem tests proficiency with heap-based priority queues and custom sorting logic for spatial coordinates.

  AsanaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an ASCII Art PrinterMedium

  This question evaluates the ability to implement text rendering and string/array manipulation concepts, including glyph concatenation with inter-character spacing, newline-preserved blocks, blank glyph rendering for spaces, and handling of unsupported characters.

  AsanaSoftware EngineerCoding & AlgorithmsOnsite
• Implement core puzzle/array/grid routinesMedium

  This question set evaluates algorithmic problem-solving competencies including backtracking and constraint satisfaction for jigsaw assembly, simulation and state manipulation for ASCII canvas and 2048 move logic, and linear-time in-place array transformation for the product-of-array problem.

  AsanaSoftware EngineerCoding & AlgorithmsOnsite
• Pick the K Values Nearest a Target in a Sorted Integer ArrayMedium

  A coding exercise on a sorted integer array: return the k elements nearest a target value in ascending order, where equal distances favor the smaller value. It tests exploiting sorted order, handling targets outside the array's range, and treating duplicate values correctly.

  AsanaSoftware EngineerCoding & AlgorithmsOther
• Return the K Closest Points with Deterministic TiesMedium

  This problem tests the ability to efficiently find the nearest neighbors to a target coordinate while maintaining a deterministic ordering for ties, ensuring reproducible results.

  AsanaSoftware EngineerCoding & AlgorithmsOnsite
• Solve a Jigsaw PuzzleMedium

  This question evaluates algorithmic problem-solving, constraint satisfaction, search and pruning strategies, and handling combinatorial state such as piece rotation and placement.

  AsanaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build Lab and Consultation Appointment MatchesMedium

  Process raw 10-minute provider availability records into 30-minute appointment options and match consecutive lab and consultation appointments within a 60-minute wait window.

  Assort HealthSoftware EngineerCoding & AlgorithmsTechnical Screen
• Assign bookings to minimum tennis courtsMedium

  This problem tests your ability to manage overlapping time intervals using a greedy approach, specifically requiring the calculation of the maximum number of concurrent bookings to determine the minimum resource count.

  AtlassianMachine Learning EngineerCoding & AlgorithmsOnsite
• Assign tennis bookings to minimum courtsMedium

  Design an algorithm to assign a schedule of tennis court bookings to the minimum number of courts required, resolving resource contention efficiently.

  AtlassianSoftware EngineerCoding & AlgorithmsOnsite
• Compute a moving average on a streamHard

  This problem tests your ability to maintain a running average over a sliding window of size K in a high-throughput streaming environment while managing numerical precision and memory efficiency.

  AtlassianMachine Learning EngineerCoding & AlgorithmsOnsite
• Compute inverse-depth weighted sum of a nested listMedium

  This problem tests your ability to traverse nested list structures using recursion or iterative stacks and compute a value based on the nesting depth of individual elements.

  AtlassianMachine Learning EngineerCoding & AlgorithmsOnsite
• Compute moving average over last N streamMedium

  This question evaluates understanding of streaming algorithms and sliding-window aggregation within the Coding & Algorithms domain, focusing on incremental computation, state management, and numerical stability when computing moving averages.

  AtlassianMachine Learning EngineerCoding & AlgorithmsOnsite
• Design O(1) cache and moving averageMedium

  This problem tests your ability to maintain constant-time complexity for both cache management and sliding-window statistics by using a combination of a doubly-linked list and hash maps.

  AtlassianMachine Learning EngineerCoding & AlgorithmsOnsite
• Design a trie-based URL router with wildcardsMedium

  Design a trie-based URL router with wildcards 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.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine whether a word exists in a letter gridMedium

  Implement a backtracking search to determine if a target word can be formed by sequentially adjacent cells in a 2D character grid without reusing any cell.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Filter Invalid Data EventsEasy

  Tests your ability to implement a multi-condition event filtering and deduplication pipeline while preserving input order, along with complexity analysis for batch and stream processing.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find LCA in a tree and extend to a DAGMedium

  This problem tests your understanding of tree traversal, graph theory, and how to generalize path-finding algorithms from trees to directed acyclic graphs (DAGs).

  AtlassianMachine Learning EngineerCoding & AlgorithmsOnsite