Coding & Algorithms interview questions

Showing 3061–3090 of 3276 results

• Design Algorithm for Longest Substring with K Distinct CharactersMedium

  This question evaluates proficiency in string-processing and sliding-window algorithm patterns, assessing competency in designing efficient solutions and managing data structures to track distinct elements and reason about time and space complexity.

  UpstartData ScientistCoding & AlgorithmsOnsite
• Find Maximum Eastbound City Visits and Parse CSVMedium

  Tests string parsing for CSV records with quoted fields and escaped delimiters, followed by finding the longest valid subsequence of eastbound city visits with lexicographical tie-breaking.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find max word letter spanMedium

  This question evaluates proficiency in string processing, character mapping, and algorithmic analysis by requiring computation of per-word letter spans while accounting for case normalization, punctuation handling, ties, duplicates, and edge-case word forms.

  UpstartSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Minimum Absolute DifferenceMedium

  This problem tests your ability to efficiently find the minimum absolute difference between any two elements in an array, requiring an understanding of sorting and linear scans.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement Byte Formatting and Cafeteria BillingMedium

  This problem tests your ability to implement custom string formatting logic for file sizes and a stateful simulation of a billing system with capacity limits.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement factorial and count trailing zerosEasy

  This question evaluates understanding of factorial computation and algorithmic techniques, including iterative versus recursive approaches, handling large integers and recursion constraints, and efficient counting of trailing zeros via number-theoretic reasoning.

  UpstartData ScientistCoding & AlgorithmsOnsite
• Remove Duplicate Integers While Preserving OrderEasy

  This problem tests your ability to filter elements from an array while maintaining the original sequence and ensuring optimal time complexity using auxiliary data structures.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Remove Duplicates While Preserving First-Appearance OrderMedium

  Return each array value once in its original first-appearance order, using membership tracking without sorting the result.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Report Where a Value AppearsEasy

  Check whether a target value appears at an even index, an odd index, the first half, and the second half of an even-length list in a single scan.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Scale Ingredient QuantitiesEasy

  This problem tests string parsing and manipulation, specifically isolating numeric prefixes from measurement units and descriptive text while maintaining the relative structure of ingredient lists.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Scale Recipe Quantities Without Changing Product DescriptionsMedium

  Multiply only the leading quantity in each ingredient line, preserving recipe order, product wording, and numbers inside descriptions.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve Reported OA Coding ProblemsMedium

  This prompt evaluates algorithmic problem-solving skills across grid-based ordering constraints, array pair-sum identification, and minimum-difference computation, testing knowledge of data structures, time/space complexity, and correctness conditions.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve remembered OA coding tasksMedium

  This set of problems evaluates skills in data aggregation and ordering (identifying top averages), computational geometry and extrema calculation (axis-aligned bounding rectangle), and grid constraint validation and consistency checking (partially filled 9x9 number board).

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Sum Multiples of Three, Five, or SevenMedium

  Calculate the sum of all unique positive integers strictly less than a given limit that are divisible by 3, 5, or 7. The problem requires using the Principle of Inclusion-Exclusion to achieve an O(1) time complexity capable of handling inputs up to 10^18.

  UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Design an In-Memory DatabaseMedium

  This question evaluates a candidate's skills in data modeling, in-memory data structures, index design, and query/filter semantics for a flexible schema-less record store.

  ValonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an In-Memory Query EngineHard

  Design and implement an in-memory query engine capable of ingesting records and executing structured queries with comparison, membership, and logical operators.

  ValonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an in-memory SQL-like tableHard

  This problem tests your ability to design a flexible, in-memory table structure that supports dynamic schema definition, data storage, and basic relational query operations.

  ValonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design streaming test logger and queriesMedium

  This question evaluates a candidate's ability to design streaming data structures and time-series algorithms to track state transitions and compute interval queries, covering competencies in online/event-processing algorithms, interval overlap aggregation, and algorithmic complexity analysis within the Coding & Algorithms domain.

  VantaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design test-run logging and query functionsMedium

  This question evaluates proficiency in time-series logging, event-driven state transitions, interval and sliding-window algorithms, and efficient data-structure design for streaming updates.

  VantaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Adjacent-Line UniqMedium

  Implement a Unix-style adjacent-line deduplication function that groups consecutive identical lines, supports case-insensitive matching, and filters output based on run counts in linear time.

  VantaSoftware EngineerCoding & AlgorithmsOnsite
• Implement a Unique Lines CommandEasy

  Implement a streaming generator that mimics the Unix `uniq` command by collapsing consecutive duplicate lines with options for counting and case-insensitivity.

  VantaSoftware EngineerCoding & AlgorithmsOnsite
• Order Classes by Prerequisites with Recursive DFSMedium

  Build a deterministic prerequisite ordering with recursive depth-first search. Handle disconnected classes and detect dependency cycles by tracking both active and completed nodes.

  VantaSoftware EngineerCoding & AlgorithmsOnsite
• Compute build order from dependenciesMedium

  Compute build order from dependencies 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.

  Veeva SystemsSoftware EngineerCoding & AlgorithmsOnsite
• Count Hits in the Past Five MinutesMedium

  Implement a five-minute hit counter with ordered timestamped operations, repeated hits, and an explicit 300-second expiration boundary.

  VercelSoftware EngineerCoding & AlgorithmsTechnical Screen
• Group Tree Nodes into Layers from the Leaves Up to the RootEasy

  Given a rooted tree described as an undirected edge list, return its nodes in layers from the leaves up to the root, where each node sits one layer above its highest child and each layer is sorted. It tests rooting a tree from a graph, bottom-up ordering, and handling very deep, path-shaped trees.

  VercelSoftware EngineerCoding & AlgorithmsOnsite
• Search Recorded Metrics by Name, Tags, and RecencyMedium

  Design an in-memory metric storage and querying system that allows recording time-series metrics with key-value tags and retrieving the most recent matches filtered by name and tags.

  VercelSoftware EngineerCoding & AlgorithmsOnsite
• Find and Merge Camera Alert IntervalsHard

  This question evaluates understanding of time-series processing, interval detection, and interval-merging algorithms, including handling thresholds, touching intervals, and open-ended alerts.

  VerkadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find motion intervals above thresholdMedium

  This question evaluates understanding of time-series data processing and interval detection, focusing on grouping timestamped motion readings that exceed a numeric threshold and managing contiguous active segments.

  VerkadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Super Admin User Who Can Access Every Camera Through Nested GroupsMedium

  Given permission triples linking users, groups and cameras, find the user who can access every camera through direct ownership or through nested, possibly cyclic group memberships. It tests modeling permissions as a directed graph, reachability that tolerates membership cycles, and edge cases such as an input with no cameras or a group that covers everything.

  VerkadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find user who can access every cameraMedium

  This problem tests your ability to model hierarchical access control systems as a directed graph and determine reachability using graph traversal techniques like BFS or DFS.

  VerkadaSoftware EngineerCoding & AlgorithmsOnsite