Coding & Algorithms interview questions

Showing 871–900 of 3276 results

• Fewest Expenses to Defer to Year End So the Running Balance Never Goes NegativeEasy

  Given a year's transactions in order, with income as positive values, expenses as negative values and a non-negative total, find the fewest expenses to move to the end of the year so the running balance never drops below zero. It tests reasoning over prefix sums for inputs of up to 100,000 transactions.

  DRWSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Nested Transactions in an In-Memory DatabaseEasy

  This problem tests your ability to manage state and scope using stacks and dictionaries to implement transaction isolation in a key-value store.

  DRWData EngineerCoding & AlgorithmsOnline Assessment
• Largest Number From a 1-and-2 Digit String With Even Counts of Each DigitMedium

  Given a string of 1s and 2s that represents a positive integer, delete characters so the remaining counts of both digits are even, keeping the original order, and return the largest number that can remain. The problem tests careful case analysis of which digit occurrences to remove and efficient string handling for inputs up to 200,000 characters.

  DRWSoftware EngineerCoding & AlgorithmsHR Screen
• Longest Substring in Which Every Present Letter Occurs Equally OftenEasy

  Given a string of lowercase letters, find the length of the longest substring in which every letter that appears occurs the same number of times. It tests substring enumeration with incremental frequency tracking and a precise definition of what counts as balanced.

  DRWSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize a Digit Subsequence with Even Counts of Ones and TwosHard

  Find the lexicographically/numerically largest subsequence of a string of '1's and '2's containing an even number of both digits in linear time.

  DRWSoftware EngineerCoding & AlgorithmsHR Screen
• Minimize the Max-Min Gap of an Array After Changing Up to Three ElementsEasy

  Given an integer array, you may change up to three elements to any values; return the smallest possible difference between the largest and smallest values afterward. It tests reasoning about which extreme values are worth changing and careful handling of short arrays.

  DRWSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve movie ratings, array, release schedulerMedium

  This question tests algorithmic problem-solving across three domains: greedy array optimization, tree-based data structure design, and efficient sequence merging. It evaluates practical coding ability and complexity analysis, commonly used in quantitative and data science interviews to assess how candidates identify inefficiencies and select the right data structure to improve performance.

  DRWData ScientistCoding & AlgorithmsOnsite
• Solve odd-string, digit swap, patient slot assignmentMedium

  This multi-part problem evaluates string manipulation and parity/combinatorics for constructing odd-occurrence strings, greedy optimization and minimal-change reasoning for digit-swap distance minimization, and bipartite matching/assignment skills for patient slot allocation.

  DRWSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve three algorithmic OA problemsMedium

  This set evaluates algorithmic problem-solving skills including array manipulation and simulation for knockout tournament dynamics, graph traversal and constructive movement-sequence design on grids, and broader competencies in handling permutations, connectivity, and constraint-driven constructions.

  DRWSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve three algorithmic OA tasksMedium

  Solve three algorithmic OA tasks 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.

  DRWSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve three algorithmic tasks in PythonMedium

  This question evaluates proficiency in dynamic programming, range-query data structures (Fenwick/segment tree), sorting and two-pointer techniques, and algorithmic complexity analysis within the Coding & Algorithms domain for Python-based implementation.

  DRWData ScientistCoding & AlgorithmsOnsite
• Validate a Password Against Explicit Security RulesEasy

  This problem tests string manipulation, character set validation, and the ability to apply a sequence of conditional checks efficiently.

  DRWData EngineerCoding & AlgorithmsOnline Assessment
• Minimize Total Assignment DistanceMedium

  This question evaluates competency in combinatorial optimization, assignment/matching problems, and reasoning about Manhattan distance cost metrics. Commonly asked to assess algorithmic reasoning about constrained assignments, search and complexity trade-offs, it belongs to the Coding & Algorithms domain and emphasizes practical application of algorithm design and implementation rather than purely conceptual theory.

  Dark Alpha CapitalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a Constant-Time Snapshot Set IteratorHard

  Design a mutable ordered integer set that supports constant-time snapshot iterator creation without copying the live dataset, preserving insertion order and handling elements that are removed and re-added.

  DatabricksSoftware EngineerCoding & AlgorithmsOnsite
• Check if CIDR is fully canceled by rulesMedium

  This question evaluates understanding of IPv4 CIDR arithmetic, set operations on IP ranges (overlap detection and subtraction), and ordered rule semantics for allow/deny processing.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Choose fastest transportation mode on city gridMedium

  This problem tests your ability to model a grid-based transportation network as a graph and apply Dijkstra's algorithm to find the optimal path under multiple constraints.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute 5-minute rolling average loadMedium

  This problem tests your ability to maintain a rolling window average over a high-throughput stream of events using an efficient data structure that balances memory usage and query time complexity.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute last-5-minute QPS in memoryMedium

  This question evaluates design of in-memory data structures and sliding-window time-series aggregation for real-time metrics, testing understanding of space/time trade-offs, streaming algorithms, and handling monotonic timestamps.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Convert an IP range to minimal CIDRsHard

  This problem tests your ability to manipulate IP address representations and implement a greedy strategy to decompose an arbitrary range of IPv4 addresses into the minimum number of CIDR blocks.

  DatabricksSoftware EngineerCoding & AlgorithmsOnsite
• Delete a Character From CoverMedium

  This problem tests your ability to manage dynamic string indices by maintaining a set of active intervals and adjusting them efficiently after a character deletion.

  DatabricksMachine Learning EngineerCoding & AlgorithmsOnsite
• Design BFS to detect forced win in Tic-Tac-ToeMedium

  This question evaluates algorithm design and search-space reasoning, focusing on BFS-based game-tree exploration, state representation, symmetry reduction and hashing, win/draw detection, pruning and move-ordering heuristics, and time/space complexity analysis in terms of n, k, t, and the branching factor within the Coding & Algorithms domain.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design IP/CIDR rule matcherMedium

  This question evaluates understanding of IPv4 addressing, CIDR and numeric range representations, plus competency in designing efficient data structures and algorithms for low-latency rule matching with dynamic updates.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design In-Memory QPS CounterMedium

  This question evaluates the ability to design and implement an in-memory time-series counter and sliding-window aggregation, emphasizing efficient data structures, handling high-frequency events, and memory-time trade-offs.

  DatabricksMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Design Tic-Tac-Toe and QPS data structuresMedium

  This question evaluates data-structure and API design skills, covering state management and efficient update/query algorithms for a generalized Tic-Tac-Toe with uniform-random move selection, as well as time-series aggregation and streaming-log techniques for computing QPS from non-decreasing timestamps.

  DatabricksSoftware EngineerCoding & AlgorithmsOnsite
• Design a rolling event tracker with rangesMedium

  This question evaluates understanding of time-series data structures and streaming counters, testing algorithm design, space/time complexity analysis, correctness across edge cases, and handling of large-scale event tracking.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design an IP filter using CIDR rulesMedium

  This question evaluates understanding of IP addressing and CIDR notation, bit-level conversion between prefixes and integer ranges, and the design of scalable data structures and algorithms for prefix/range queries, rule priority handling, and rule-set operations (allow/deny semantics).

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design an efficient Tic-Tac-Toe engineMedium

  This question evaluates a candidate's understanding of efficient algorithm design and minimal state management for a Tic-Tac-Toe engine on an n x n board, including constraints such as O(1) time per move and O(n) space.

  DatabricksSoftware EngineerCoding & AlgorithmsOnsite
• Design an n x n Tic-Tac-Toe GameMedium

  This problem tests your ability to design an efficient class to manage game state, focusing on constant-time win condition checking using auxiliary data structures.

  DatabricksSoftware EngineerCoding & AlgorithmsOnsite
• Detect a K-in-a-Row Win on a Rectangular BoardMedium

  Implement an efficient win-detection function that checks whether a newly placed token forms at least k consecutive matching tokens along any linear axis on a rectangular grid.

  DatabricksSoftware EngineerCoding & AlgorithmsOnsite
• Determine allow/deny for an IP via CIDR rulesHard

  This problem tests your ability to efficiently manage and query hierarchical IP address ranges, requiring knowledge of bitwise operations and data structures for range matching.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen