Coding & Algorithms interview questions

Showing 2431–2460 of 3276 results

• Find path between two nodes in a binary treeHard

  This question evaluates understanding of tree data structures, traversal and path reconstruction techniques, including reasoning about lowest common ancestors, ancestor–descendant relationships, duplicate identification, and handling absent targets.

  RippleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Aggregate expenses by person, trip, and categoryMedium

  This question evaluates a candidate's ability to perform efficient data aggregation, use associative data structures (maps/dictionaries), and reason about time and space complexity when processing large collections of records.

  RipplingSoftware EngineerCoding & AlgorithmsOnsite
• Bill Deliveries with Historical Rates and Deferred RoundingHard

  Bill deliveries with start-time historical rates, duplicate suppression, overlapping jobs, exact sub-cent accumulation, and configurable final half-up or half-even rounding.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build an Expense Policy Rule EngineEasy

  This question tests your ability to design a rule evaluation engine that processes structured expense data against a set of logical conditions, including support for basic operators.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compare Complete and Partial Poker HandsMedium

  Implement a poker hand evaluator that determines whether an incomplete poker hand can be completed from the remaining deck to beat an opponent's complete five-card hand.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compare Complete or Partial HandsMedium

  This question evaluates implementation of card-hand evaluation logic, combinatorial reasoning about incomplete information, and deterministic tie-breaking rules for comparing complete and partial poker-like hands.

  RipplingSoftware EngineerCoding & AlgorithmsOnsite
• Compare Two Five-Card Numeric HandsMedium

  Compare two five-digit numeric hands under a nonstandard multiplicity ranking and original-position right-to-left tie-break, using extensible category evaluators rather than standard poker rules.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute concurrent online driversMedium

  This question evaluates proficiency in algorithms and temporal data handling, including the use of efficient search techniques and complexity reasoning to count distinct active drivers over a sliding 24-hour window.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute max simultaneous drivers last 24 hoursMedium

  This question evaluates proficiency in reasoning about time-interval overlap, event aggregation, and online data structures for streaming interval queries, testing skills in algorithm design and temporal data handling within the Coding & Algorithms domain.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute maximum simultaneous driversMedium

  This English summary evaluates the candidate's proficiency in algorithm design and complexity analysis within the Coding & Algorithms domain, specifically for aggregating interval data and computing concurrent counts.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute median of two sorted arraysMedium

  This question evaluates algorithmic problem-solving with sorted arrays, focusing on concepts like binary search, partitioning strategies, complexity analysis, and careful handling of edge cases when computing order statistics.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute peak busy dashers with overlapsMedium

  This question evaluates skills in interval-overlap reasoning, sweep-line algorithm design, event creation and deduplication, comparator and tie-breaking subtleties, and asymptotic time/space complexity analysis within the Coding & Algorithms domain.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Convert amounts between multiple currenciesMedium

  This question evaluates understanding of graph modeling and path-optimization in directed weighted graphs, specifically reasoning about chained conversions and maximizing multiplicative path weights.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Courier Delivery Cost TrackerMedium

  Design a stateful tracker class to record courier delivery intervals and earnings, query running courier payouts, and calculate peak concurrent active deliveries within a specific time window.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a Driver Payroll SystemMedium

  Design an in-memory driver payroll system that records time-stamped earnings and supports efficient range queries for both individual drivers and company-wide aggregates.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a music player with favorites capMedium

  This question evaluates a candidate's ability to design and implement in-memory data structures, stateful APIs, concurrency handling, deterministic policy enforcement for a fixed-capacity favorites feature, and reasoning about edge cases like removing the currently playing track or handling invalid IDs.

  RipplingSoftware EngineerCoding & AlgorithmsOnsite
• Evaluate Configurable Rideshare Payout Audit Rules as DataHard

  Implement a generic rule-evaluation engine for a rideshare payout audit tool, where per-fare and per-driver-total rules, each with its own AND-combined conditions, are supplied entirely as data rather than hard-coded branches, using exact integer-cent arithmetic.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate Expense and Trip-Level Rules as DataHard

  Evaluate configurable expense and trip-sum rules using exact cents, reusable typed predicates, strict thresholds, multiple flags, and deterministic result ordering.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find bounding boxes of connected housesMedium

  This problem tests your ability to perform graph traversal (BFS/DFS) on a 2D grid to identify distinct connected components and compute their spatial extent.

  RipplingSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find median of two sorted arraysMedium

  This question evaluates algorithmic problem-solving skills related to sorted arrays and median computation, testing competency in handling numeric order properties and complexity analysis within the Coding & Algorithms domain.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Best and Worst Completion of a Partial Numeric HandMedium

  Find the strongest and weakest five-card completions of a partial numeric hand under custom category and right-to-left tie-break rules while sharing one extensible comparison engine.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Article Vote TrackingMedium

  Design an in-memory article vote tracking system that manages user upvotes/downvotes, detects vote flips to maintain an LRU-style flip history per user, and provides top-k article rankings by net score.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Courier Delivery Cost TrackingMedium

  Design an in-memory billing system that tracks courier pay rates over time and calculates prorated delivery costs across half-open time intervals.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Food Delivery BillingMedium

  This problem tests your ability to implement complex billing logic involving conditional fee structures, time-based surcharges, and data aggregation.

  RipplingSoftware EngineerCoding & AlgorithmsOnsite
• Implement an In-Memory File SystemMedium

  Design and implement an in-memory file system supporting directory creation, file appending, reading, and lexicographically sorted path listings.

  RipplingSoftware EngineerCoding & AlgorithmsOnsite
• Implement an article voting trackerEasy

  This question evaluates a candidate's ability to design efficient stateful data structures and algorithms for tracking user votes, including correct handling of idempotent repeated votes, vote changes, deduplication, and retrieval of the most recent events.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement stack and interval algorithms with testsMedium

  This question evaluates implementation-level competencies with fundamental data structures and algorithms—stack-based bracket validation, interval merging with open/closed endpoint semantics, and arithmetic expression evaluation using stacks—while also measuring the ability to design comprehensive unit tests; category: Coding & Algorithms for a Machine Learning Engineer role. It is commonly asked to gauge practical coding ability, correctness under tricky edge cases and input semantics, and test-coverage awareness, representing a practical application-level assessment that also requires conceptual reasoning about invariants and boundary behavior.

  RipplingMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve listed algorithm problemsHard

  This problem tests your ability to model exchange rates as a graph and use path-finding algorithms to detect profitable arbitrage opportunities.

  RipplingSoftware EngineerCoding & AlgorithmsHR Screen
• Studio Session Billing with Rate Schedules and Exact RoundingHard

  Build a command-driven billing ledger where technicians' hourly rates change over time, bookings are deduplicated, and fractional cents are kept exactly until an invoice is printed with a configurable rounding mode. Tests rate lookup by time, idempotency rules, and integer-exact money handling.

  RipplingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Track article votes and last three flipsMedium

  This question evaluates a developer's ability to design in-memory data structures that support constant-time vote updates, score aggregation, and recent flip-event tracking while handling vote-change semantics.

  RipplingSoftware EngineerCoding & AlgorithmsOnsite