Coding & Algorithms interview questions

Showing 1291–1320 of 3276 results

• Solve three coding interview problemsMedium

  This set tests proficiency in recursive string decoding, dynamic programming for sequential decision-making, and graph-based traversal algorithms for grid analysis.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Solve three coding problemsEasy

  This set of problems evaluates algorithmic problem-solving across combinatorics and enumeration (finding the N-th lexicographic license plate), constrained geometric and graph traversal reasoning (counting Android-style 3x3 unlock patterns), and interval-processing algorithms (computing intersections of sorted, non-overlapping intervals) within the domain of algorithms and data structures. These questions are commonly asked because they reveal ability to reason about discrete enumeration, constraint handling, and efficient time/space implementations for edge-case-heavy inputs, and the level of abstraction spans both conceptual understanding (combinatorial and geometric constraints) and practical application (efficient algorithm and data-structure implementation).

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Streaming Points: Remove Any Pair Within a DistanceMedium

  This problem tests the ability to maintain and query a dynamic sorted collection of points to perform efficient proximity-based removals.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Track Island Counts as Land Is AddedMedium

  Report the initial number of grid islands and update that count after each requested water-to-land addition. The problem probes incremental connectivity, duplicate additions, local merge effects, scalability to large grids, and alternatives to recomputing the entire map.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Troubleshoot CPU, latency, and DNS issuesMedium

  This question evaluates system troubleshooting and diagnostic competencies, including Linux CPU and IO performance analysis, network latency and packet-level investigation, and DNS resolution and query tooling knowledge.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• User Activity Analytics: Unique Users per Activity and Average Time on SiteMedium

  This question evaluates a candidate's ability to process semi-structured event data using grouping, deduplication, and timestamp arithmetic in Python. It falls under coding and algorithms, commonly asked to assess practical data-wrangling skills such as aggregating per-key counts and computing time-based metrics while handling edge cases like unordered records and single-event users.

  GoogleData EngineerCoding & AlgorithmsTechnical Screen
• Validate course catalog dependenciesMedium

  This question evaluates understanding of graph algorithms and data validation, specifically dependency analysis, cycle detection, and topological ordering.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Write SQL and merge linked listsMedium

  Solve a SQL customer order aggregation task and merge two sorted linked lists. The solution uses CTEs, window functions, LEFT JOINs, COALESCE, latest-order tie handling, optional returned-order filtering, and an O(m+n) dummy-head linked-list merge.

  GoogleData EngineerCoding & AlgorithmsTechnical Screen
• Implement a Transactional Key-Value StoreMedium

  This question evaluates understanding of transactional state management, data structure design, and consistency/visibility semantics in an in-memory key-value store that supports nested transactions.

  GrammarlySoftware EngineerCoding & AlgorithmsOnsite
• Merge overlapping correctionsMedium

  This question evaluates a candidate's ability to manage and manipulate overlapping intervals with multi-criteria tie-breaking, preserve original metadata across splits, and design efficient data structures and algorithms for producing non-overlapping correction spans.

  GrammarlySoftware EngineerCoding & AlgorithmsOnsite
• Recover a Rooted Tree from Depth-Annotated PreorderEasy

  Reconstruct a general ordered tree from its depth-annotated preorder traversal string and return it as a nested tuple.

  GrammarlySoftware EngineerCoding & AlgorithmsTechnical Screen
• Reverse a Singly Linked ListMedium

  This problem tests your understanding of pointer manipulation and iterative/recursive techniques for modifying linked structures in-place.

  GrammarlySoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a debounced function (with leading option)Easy

  This problem tests your understanding of higher-order functions, closure scope, and asynchronous execution control by requiring the implementation of a flexible debounce utility.

  Grayswan AiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Optimize Matrix-Chain MultiplicationHard

  This problem tests your ability to solve a classic dynamic programming challenge, focusing on finding the optimal order of matrix multiplications to minimize the total number of scalar operations.

  GsaData ScientistCoding & AlgorithmsTechnical Screen
• Fairly Distribute Money With LimitsMedium

  This problem tests your ability to implement a greedy allocation algorithm while respecting individual upper bounds and handling iterative redistribution of remaining resources.

  GustoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a timestamped mapMedium

  This problem tests your ability to design a time-indexed key-value store that supports efficient lookups of historical values using binary search.

  GustoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Good Subsequences With Equal Character FrequenciesMedium

  Practice a combinatorics coding problem that counts good subsequences where every selected character has the same frequency. The prompt targets frequency counting, combinations, modular arithmetic, and grouping subsequences by common selected count.

  HackerRankMachine Learning EngineerCoding & AlgorithmsOnline Assessment
• Find Final Ball HolderMedium

  This problem tests your ability to optimize repeated state transitions by identifying cycles in a functional graph or using modular arithmetic to jump through large steps.

  HackerRankSoftware EngineerCoding & AlgorithmsTechnical Screen
• Work Order Lead Time: Critical Path Through an Operations DAG to ShippingHard

  A manufacturing work order is modeled as a directed acyclic graph of operations with durations in days, and every path ends at one shipping node. Compute the total lead time as the critical path length from any starting operation to shipping. It tests graph modeling, dependency ordering and longest-path reasoning.

  HadrianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build an In-Memory File Vault with Duplicate-Name HandlingHard

  Design an in-memory hierarchical file vault supporting automatic directory creation, lexicographical directory listings, and duplicate-name resolution using the smallest available numeric suffix.

  HarveySoftware EngineerCoding & AlgorithmsOnsite
• Design Spreadsheet Formula CellsMedium

  This question evaluates ability to design and implement data structures and algorithms for expression parsing, dependency tracking, incremental evaluation, and cycle detection in an in-memory spreadsheet.

  HarveySoftware EngineerCoding & AlgorithmsOnsite
• Design a constrained in-memory file systemMedium

  This question evaluates design and implementation skills for hierarchical in-memory data structures, string parsing and file-name collision handling under constraints, and the ability to reason about time and space complexity.

  HarveySoftware EngineerCoding & AlgorithmsTechnical Screen
• Design an In-Memory Spreadsheet EngineHard

  Design an in-memory spreadsheet engine that supports cell updates, formula evaluations, cycle detection, and O(1) value lookups via proactive cache propagation.

  HarveySoftware EngineerCoding & AlgorithmsTechnical Screen
• Design an in-memory file system with limitsMedium

  This question evaluates the ability to design and implement hierarchical in-memory data structures, manage capacity constraints and OS-style duplicate naming, and reason about edge cases and time/space complexity.

  HarveySoftware EngineerCoding & AlgorithmsTechnical Screen
• Eager Spreadsheet Formulas with Constant-Time ReadsMedium

  Implement eager spreadsheet formulas with constant-time cached reads, transitive dependency updates, cycle rejection, and atomic definition replacement.

  HarveySoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate Symbol ExpressionsMedium

  Implement an expression evaluator for a dictionary of symbolic definitions with arithmetic operations, resolving dependencies, and detecting cycles and undefined references.

  HarveySoftware EngineerCoding & AlgorithmsOnsite
• Handle multi-source string matching and taggingMedium

  This question evaluates skills in string matching, pattern recognition, overlap handling, text annotation, and counting occurrences across multiple source strings.

  HarveySoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Spreadsheet Cell UpdatesHard

  This problem tests your ability to manage a directed graph of dependencies and implement a topological update mechanism to recompute spreadsheet cell values efficiently.

  HarveySoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Cursor-Based Text EditorMedium

  Design an in-memory cursor-based text editor supporting character insertion, deletion, and cursor navigation with efficient time complexity.

  HarveySoftware EngineerCoding & AlgorithmsOnsite
• Implement a Database Connection PoolMedium

  Tests your ability to implement a thread-safe connection pool that manages connection lifecycles, blocking acquisition with timeouts, and resource reuse under concurrent access.

  HarveySoftware EngineerCoding & AlgorithmsOnsite