practice a little every day, paws crossed ♡
Coding & Algorithms Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 3121–3150 of 3276 results
- VmwareMediumSoftware EngineerCompute iterative sliding-window sum reduction
This question tests the ability to implement a sliding window algorithm to compute dynamic reductions, focusing on efficient array traversal and state maintenance.
Coding & AlgorithmsTechnical ScreenSliding WindowAlgorithmsArray - VoleonMediumSoftware EngineerAdvance Cyclic Ball Flips Efficiently
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.
Coding & AlgorithmsTechnical ScreenPrefix SumArraysMath - VoleonMediumSoftware EngineerCount queen attacks on points with blockers
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.
Coding & AlgorithmsTechnical Screen - VoleonMediumSoftware EngineerDesign circular sliding-window ratio tracker
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.
Coding & AlgorithmsTechnical Screen - VoleonHardSoftware EngineerImplement Kac ring with O(1) color and kstep
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.
Coding & AlgorithmsOnsite - VoleonMediumSoftware EngineerImplement sparse matrix addition and multiplication
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.
Coding & AlgorithmsTechnical Screen - VoleonHardSoftware EngineerProcess exchange prints, volume checks, and client orders
This problem tests your ability to manage high-frequency time-series data using sliding windows and stateful order tracking to enforce trading constraints.
Coding & AlgorithmsOnsiteSliding WindowStream ProcessingTime-Series - VoleonMediumQuantitative ResearcherReturn Words in Repeated Anagram Groups
Return all input occurrences belonging to repeated anagram groups, preserving order and duplicates with multiplicity-aware letter-count signatures.
Coding & AlgorithmsTechnical Screen - VoleonMediumSoftware EngineerSimulate an exchange and participation-rate trading
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.
Coding & AlgorithmsTechnical Screen - VoleonHardSoftware EngineerSolve classic coding interview problems
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.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingBinary SearchCombinatorics - VoleonMediumSoftware EngineerValidate whether a binary string is good
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.
Coding & AlgorithmsTechnical Screen - Walmart LabsMediumSoftware EngineerCheck whether brackets are balanced
This problem tests your ability to handle nested structures using a stack data structure to track opening symbols and verify matching closing symbols.
Coding & AlgorithmsTechnical ScreenStackString ManipulationData Structures - Walmart LabsMediumSoftware EngineerCompute days until plants stop dying
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.
Coding & AlgorithmsTechnical Screen - Walmart LabsMediumSoftware EngineerCompute the Minimum Number of Meeting Rooms
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.
Coding & AlgorithmsTechnical Screenintervalssortingheap - Walmart LabsMediumSoftware EngineerCount ways to make change (DP)
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.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingCombinatoricsOptimization - Walmart LabsMediumData ScientistFind Index Pairs of Matching Elements in Arrays
This question evaluates the ability to work with sorted arrays, index mapping, duplicate handling, and reasoning about correctness and algorithmic complexity.
Coding & AlgorithmsOnsite - Walmart LabsEasyMachine Learning EngineerFind first non-repeating character
This problem tests your ability to use hash maps or frequency arrays to achieve optimal time complexity when processing character streams or strings.
Coding & AlgorithmsOnsiteStringsHash MapFrequency Array - Walmart LabsMediumSoftware EngineerFind shared courses between student pairs
This problem tests your ability to efficiently map relationships and compute intersections between multiple sets to identify commonalities across pairs.
Coding & AlgorithmsTechnical ScreenHash MapSetData Structures - Walmart LabsEasySoftware EngineerFind the Longest Even-Length Word
Tests string tokenization, linear scanning, tie-breaking logic, and handling of edge cases such as absent matches or irregular whitespace.
Coding & AlgorithmsTechnical ScreenStringsAlgorithmsWalmart - Walmart LabsHardSoftware EngineerFind the Single Repeated Value Among n + 1 Integers Drawn from 1 to n
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.
Coding & AlgorithmsOnsite - Walmart LabsHardSoftware EngineerImplement a Range Module with Add, Query, and Remove
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.
Coding & AlgorithmsTechnical Screenbinary-searchdesignintervals - Walmart LabsMediumSoftware EngineerImplement lexicographically smallest Two Sum
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.
Coding & AlgorithmsTechnical Screen - Walmart LabsMediumSoftware EngineerMaximum Sum of Non-Adjacent Values in a Row
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.
Coding & AlgorithmsOnline Assessment - Walmart LabsMediumSoftware EngineerMinimize Cost for Feature-Capable Models
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.
Coding & AlgorithmsOnline AssessmentGreedyOptimizationCombinatorics - Walmart LabsMediumSoftware EngineerMinimize the Maximum Edge on a Path
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.
Coding & AlgorithmsOnline Assessment - Walmart LabsHardSoftware EngineerProduct of All Other Elements for Each Index Without Division
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.
Coding & AlgorithmsOnsite - Walmart LabsHardSoftware EngineerShortest Talent-Covering Team Starting At Each Index
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.
Coding & AlgorithmsTechnical Screen - Warner Bros DiscoveryMediumSoftware EngineerImplement array rotations and CSV keyword search
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.
Coding & AlgorithmsTechnical Screen - WarpMediumSoftware EngineerImplement Terminal Tabs and Split Panels
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.
Coding & AlgorithmsTechnical Screen - WayfairHardSoftware EngineerMaximize the Product of Pair Distance and Minimum Value
Tests optimal two-pointer and greedy reasoning to maximize a distance-weighted minimum value pair in linear time.
Coding & AlgorithmsTechnical ScreenTwo PointersGreedyArrays
Voleon
Walmart Labs
Wayfair