Coding & Algorithms interview questions

Showing 3121–3150 of 3276 results

• Compute iterative sliding-window sum reductionMedium

  This question tests the ability to implement a sliding window algorithm to compute dynamic reductions, focusing on efficient array traversal and state maintenance.

  VmwareSoftware EngineerCoding & AlgorithmsTechnical Screen
• Advance Cyclic Ball Flips EfficientlyMedium

  Calculate the final binary states of cyclic nodes visited by multiple advancing markers in O(n + m) time using interval difference arrays and modular arithmetic.

  VoleonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count queen attacks on points with blockersMedium

  This question evaluates spatial reasoning on an integer 2D grid, geometric line relationships for queens' attack paths, and the use of efficient data structures to count interactions and handle occlusion, in the Coding & Algorithms domain.

  VoleonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design circular sliding-window ratio trackerMedium

  This question evaluates proficiency with sliding-window techniques, handling of circular arrays and modular indexing, design of constant-time update mechanisms, and rigorous algorithmic time/space complexity analysis.

  VoleonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Kac ring with O(1) color and kstepHard

  This question evaluates understanding of algorithmic state representation, modular arithmetic, and efficient update/query design by requiring a Kac ring implementation that supports constant-time k-step advancement and O(1) aggregate color reporting.

  VoleonSoftware EngineerCoding & AlgorithmsOnsite
• Implement sparse matrix addition and multiplicationMedium

  This question evaluates implementation skills for sparse matrix addition and multiplication, focusing on data structure selection, algorithmic complexity, memory efficiency, and explicit error handling within the Coding & Algorithms domain and the linear algebra/data-structures crossover.

  VoleonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Process exchange prints, volume checks, and client ordersHard

  This problem tests your ability to manage high-frequency time-series data using sliding windows and stateful order tracking to enforce trading constraints.

  VoleonSoftware EngineerCoding & AlgorithmsOnsite
• Return Words in Repeated Anagram GroupsMedium

  Return all input occurrences belonging to repeated anagram groups, preserving order and duplicates with multiplicity-aware letter-count signatures.

  VoleonQuantitative ResearcherCoding & AlgorithmsTechnical Screen
• Simulate an exchange and participation-rate tradingMedium

  This question evaluates competency in designing and implementing event-driven simulators, priority-based matching algorithms, and quota-constrained allocation for a limit order book, participation-rate execution, and multi-client fair-share distribution in the Coding & Algorithms domain.

  VoleonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve classic coding interview problemsHard

  Determine the minimum number of trials needed to find the highest safe floor in an n-story building using at most k eggs in the worst case.

  VoleonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate whether a binary string is goodMedium

  This question evaluates understanding of recursive grammars and string parsing, focusing on designing linear-time algorithms and managing space constraints for validity checks on binary strings.

  VoleonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check whether brackets are balancedMedium

  This problem tests your ability to handle nested structures using a stack data structure to track opening symbols and verify matching closing symbols.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute days until plants stop dyingMedium

  This question evaluates a candidate's ability to reason about array-based state transitions and algorithmic complexity, testing competency in analyzing iterative dependencies among elements and handling large input sizes.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute the Minimum Number of Meeting RoomsMedium

  Determine the minimum number of meeting rooms required to accommodate a set of schedule intervals where intervals are half-open and meetings can start at the exact moment another ends.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count ways to make change (DP)Medium

  This problem tests the ability to solve the classic 'Coin Change II' problem using dynamic programming to count the number of unique combinations that sum up to a target amount.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Index Pairs of Matching Elements in ArraysMedium

  This question evaluates the ability to work with sorted arrays, index mapping, duplicate handling, and reasoning about correctness and algorithmic complexity.

  Walmart LabsData ScientistCoding & AlgorithmsOnsite
• Find first non-repeating characterEasy

  This problem tests your ability to use hash maps or frequency arrays to achieve optimal time complexity when processing character streams or strings.

  Walmart LabsMachine Learning EngineerCoding & AlgorithmsOnsite
• Find shared courses between student pairsMedium

  This problem tests your ability to efficiently map relationships and compute intersections between multiple sets to identify commonalities across pairs.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Longest Even-Length WordEasy

  Tests string tokenization, linear scanning, tie-breaking logic, and handling of edge cases such as absent matches or irregular whitespace.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Single Repeated Value Among n + 1 Integers Drawn from 1 to nHard

  Given an array of n + 1 integers whose values all lie between 1 and n, return the one value that repeats, possibly several times. The challenge is solving it without modifying the array and with constant extra memory, which rules out sorting, hash sets and counting arrays.

  Walmart LabsSoftware EngineerCoding & AlgorithmsOnsite
• Implement a Range Module with Add, Query, and RemoveHard

  Design a data structure that tracks coverage of real numbers using half-open intervals, supporting dynamic additions, removals, and continuous coverage queries. This tests ordered data structure manipulation, interval merging/splitting invariants, and binary search.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement lexicographically smallest Two SumMedium

  This question evaluates array manipulation, index-level reasoning, and algorithmic efficiency for locating pair sums under lexicographic tie-breaking, testing attention to ordering constraints and correct index selection.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximum Sum of Non-Adjacent Values in a RowMedium

  A coding problem that asks for the largest total obtainable from a row of non-negative values when no two chosen positions may be adjacent. It tests reasoning about take-or-skip choices, edge cases such as empty and single-element rows, and a solution fast enough for rows of up to 100,000 values.

  Walmart LabsSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimize Cost for Feature-Capable ModelsMedium

  This problem tests your ability to use greedy strategies or dynamic programming to satisfy coverage constraints while minimizing total costs from a set of available items.

  Walmart LabsSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimize the Maximum Edge on a PathMedium

  Find a path in a weighted undirected graph that minimizes its largest edge rather than the sum of weights. Handle parallel edges, disconnected vertices, and the start-equals-target case efficiently at large graph scale.

  Walmart LabsSoftware EngineerCoding & AlgorithmsOnline Assessment
• Product of All Other Elements for Each Index Without DivisionHard

  For each position of an integer array, compute the product of all the other elements in linear time and without using division. It tests careful handling of zeros, negative values and repeated values, and planning a single efficient pass when the obvious division shortcut is not allowed.

  Walmart LabsSoftware EngineerCoding & AlgorithmsOnsite
• Shortest Talent-Covering Team Starting At Each IndexHard

  Practice a sliding-window coding question where each start index needs the shortest contiguous team containing every talent type. This prompt targets hash map counts, two-pointer window management, and O(n) reasoning for large arrays.

  Walmart LabsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement array rotations and CSV keyword searchMedium

  This question evaluates array manipulation and string parsing competencies, focusing on rotating arrays via modular index arithmetic and locating substring occurrences within a simple CSV while mapping each match to row, column, and character position.

  Warner Bros DiscoverySoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Terminal Tabs and Split PanelsMedium

  This question evaluates the ability to design and implement hierarchical data structures, model tree-based panel layouts, and perform precise serialization/deserialization of nested UI state.

  WarpSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize the Product of Pair Distance and Minimum ValueHard

  Tests optimal two-pointer and greedy reasoning to maximize a distance-weighted minimum value pair in linear time.

  WayfairSoftware EngineerCoding & AlgorithmsTechnical Screen