Coding & Algorithms interview questions

Showing 1471–1500 of 3276 results

• Snake Game: Minimum Moves to Reach the AppleHard

  This question evaluates proficiency in state-space modeling, constrained grid pathfinding, and dynamic collision handling, testing skills in shortest-path reasoning and movement legality within the Coding & Algorithms domain; the level of abstraction is practical application of algorithmic techniques to simulate evolving game states rather than purely theoretical analysis. It is commonly asked in technical interviews because it requires reasoning about evolving constraints and reachable states, demonstrating an applicant's ability to model complex movement rules and perform effective search under limited grid and body-size constraints.

  Jane StreetSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve queue switch and coin change puzzlesMedium

  This two-part question evaluates probabilistic reasoning about expected waiting times with random queue switching and combinatorial/algorithmic counting for coin-change combinations, testing skills in probability, expectation and order statistics as well as combinatorics and dynamic programming within the Coding & Algorithms domain.

  Jane StreetQuantitative TraderCoding & AlgorithmsOnline Assessment
• Sort trade executions into a canonical orderEasy

  This question evaluates a candidate's ability to enforce deterministic ordering and data normalization of time-series trade execution records, testing competencies in multi-key sorting, tie-breaking logic, and performance with large inputs.

  Jane StreetSoftware EngineerCoding & AlgorithmsOnsite
• Stack Machine Interpreter with Typed Int and String ValuesEasy

  This question evaluates understanding of stack-machine semantics, runtime type representation and preservation of distinct integer versus string values, plus handling mixed-type ADD behavior and output semantics.

  Jane StreetSoftware EngineerCoding & AlgorithmsTechnical Screen
• Two Opaque Boxes: Place or Take for Maximum Expected PayoffMedium

  This question evaluates probabilistic reasoning, expected-value analysis, and sequential decision-making under uncertainty, testing competency in stochastic modeling, combinatorics, and optimization.

  Jane StreetQuantitative TraderCoding & AlgorithmsOnsite
• Expand a Serial and Parallel Task Composition SpecificationEasy

  Tests parsing structured workflow specifications with nested delimiters and quoted literals, then generating all concrete serial execution paths via Cartesian expansion.

  Jump TradingSoftware EngineerCoding & AlgorithmsOnline Assessment
• Explain C++ vector, unordered_map, and virtual functionsMedium

  Explain C++ vector, unordered_map, and virtual functions 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.

  Jump TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Identify Files That Need SynchronizationEasy

  Determine which files from a source system need to be synchronized to a destination system based on permissions, presence, size, and modification timestamps.

  Jump TradingSoftware EngineerCoding & AlgorithmsOnline Assessment
• Identify read-only files from permission recordsMedium

  This problem tests your ability to parse Unix-style permission strings and implement filtering logic based on bitmask-like constraints.

  Jump TradingSoftware EngineerCoding & AlgorithmsOnline Assessment
• Largest Subset With Positive Bitwise ANDEasy

  This problem tests your understanding of bitwise operations and greedy array partitioning to maximize the size of a subset that results in a non-zero bitwise AND.

  Jump TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maintain a Fixed-Window Rolling Mean in Constant TimeMedium

  Implement an efficient sliding-window mean calculation over a stream or sequence of signed integers. Tests sliding window mechanics, constant-time updates, handling integer overflow, and edge cases.

  Jump TradingQuantitative ResearcherCoding & AlgorithmsOnsite
• Solve stock trading with pattern rulesMedium

  This set of problems evaluates algorithmic skills in pattern recognition, state management, and sequence processing, specifically testing pattern-based decision rules on time-series stock data and iterative substring elimination in string processing within the Coding & Algorithms domain.

  Jump TradingMachine Learning EngineerCoding & AlgorithmsOnline Assessment
• Solve stock-pattern trading and substring eliminationMedium

  This question evaluates algorithmic skills in array pattern recognition and string processing, specifically detecting day-to-day sign patterns for simulated trading and repeated elimination of fixed two-character substrings; it belongs to the Coding & Algorithms domain for a Machine Learning Engineer position and targets practical application of linear-time, constant-extra-space techniques. It is commonly asked to evaluate efficient O(n) algorithm design, handling of stateful streaming simulations and in-place string reduction under tight time/space constraints, and correctness reasoning for edge cases.

  Jump TradingMachine Learning EngineerCoding & AlgorithmsOnline Assessment
• Join tables to map userId to nameMedium

  This question evaluates a candidate's skills in relational data joining, data integration, and numeric reconciliation for mapping userId to customerName across multiple tables.

  KaratSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate password and list rule violationsMedium

  This question evaluates string-processing and input-validation skills, including case-insensitive substring detection, character class checks, pattern matching for special symbols, and handling edge cases like consecutive character limits.

  KaratSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute sum of minima with removalsMedium

  Compute sum of minima with removals 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.

  KneronSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement Stock Price Query APIsMedium

  This question evaluates skills in time-series data modeling, API and data-structure design, transactional (atomic) batch updates, concurrency control, and date/time parsing for stock price records.

  Lead BankSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a versioned hash map with snapshotMedium

  This question evaluates understanding of versioned hash maps, time-travel key-value stores, temporal retrieval semantics, and snapshot creation, testing algorithms and data-structure design in the Coding & Algorithms domain and emphasizing practical implementation with conceptual reasoning about correctness and timestamp semantics.

  Lead BankSoftware EngineerCoding & AlgorithmsTechnical Screen
• Process Calendar Events with Deletion, Pagination, and Overlap QueriesMedium

  This problem tests your ability to manage a dynamic set of time-interval events using a data structure that allows for logarithmic insertions, deletions, and efficient range-based queries.

  Lead BankSoftware EngineerCoding & AlgorithmsOnsite
• Process a Mutable Stock-Price LogMedium

  Design an in-memory mutable stock price log that supports recording prices, tracking update history, calculating percentage changes across dates, and comparing performance between tickers.

  Lead BankSoftware EngineerCoding & AlgorithmsOnsite
• Solve friend recommendations and time-versioned mapsMedium

  This problem tests your ability to model a time-versioned key-value store and leverage graph adjacency structures to perform multi-hop relationship recommendations.

  Lead BankSoftware EngineerCoding & AlgorithmsOnsite
• Determine If Two Numbers Sum to TargetMedium

  This question evaluates a candidate's basic algorithmic fluency in array processing and the ability to reason about pairwise sums using auxiliary data structures.

  LendingClubData ScientistCoding & AlgorithmsTechnical Screen
• Compute the Eddington number from ride distancesMedium

  This question evaluates a candidate's competence in array manipulation, ordering/selection techniques, counting thresholds, and algorithmic complexity analysis required to compute the Eddington number.

  LiftoffSoftware EngineerCoding & AlgorithmsOnsite
• Find degrees of connection in a LinkedIn graphMedium

  This question evaluates understanding of graph traversal, reachability and shortest-path concepts along with the ability to manage performance constraints on large sparse graphs.

  LiftoffSoftware EngineerCoding & AlgorithmsOnsite
• Implement minimal RLE encode/decode with max run KMedium

  This question evaluates proficiency in string parsing and compression techniques, specifically run-length encoding/decoding, pattern detection, and algorithmic optimization for producing minimal-length encodings under a maximum pattern length constraint.

  LiftoffSoftware EngineerCoding & AlgorithmsTechnical Screen
• Parse and expand an IPv6 addressMedium

  This question evaluates proficiency in IPv6 address parsing, string validation, and canonicalization, testing understanding of hexadecimal hextets and the zero-compression (::) rule within the Coding & Algorithms domain.

  LiftoffSoftware EngineerCoding & AlgorithmsOnsite
• Combine Overlapping Closed Intervals Into a Sorted Disjoint ListEasy

  Given an unordered list of closed integer intervals, possibly with duplicates, nested intervals and touching endpoints, combine every chain of overlapping intervals and return the disjoint result ordered by start. It tests interval reasoning, precise overlap rules at shared endpoints, and careful handling of edge cases.

  LimeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Answer Repeated Shortest Word Distance QueriesEasy

  Design a data structure that preprocesses a list of words to efficiently answer repeated queries for the shortest index distance between two distinct words.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Arrange Nonnegative Integers to Form the Largest NumberEasy

  Tests custom sorting logic and string manipulation to arrange a list of nonnegative integers into the lexicographically largest combined numerical string.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Can You Place N Objects?Medium

  This problem tests your ability to handle greedy array traversal while maintaining specific adjacency constraints, requiring careful management of boundary indices.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen