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 1501–1530 of 1706 results
- TikTokMediumSoftware EngineerSolve message splitting and board crushing
These problems evaluate string manipulation and numeric reasoning for variable-length metadata alongside grid simulation with pattern detection and gravity effects, testing skills such as careful edge-case handling, iterative state updates, and complexity analysis.
Coding & AlgorithmsTechnical Screen - TikTokMediumSoftware EngineerSolve three algorithm tasks
This multi-part question evaluates algorithmic problem-solving across string processing (text justification), handling ambiguous state in sequence validation (parentheses with wildcards), and grid graph traversal with path reconstruction, testing competencies in formatting and spacing logic, state-tracking for correctness under uncertainty, and shortest-path search and reconstruction. It is commonly asked in Coding & Algorithms interviews to assess correctness under edge cases, ability to reason about trade-offs and invariants, and the analysis of time and space complexity, requiring both conceptual understanding and practical implementation skills.
Coding & AlgorithmsTechnical Screen - TikTokHardSoftware EngineerSolve three string/stack/backtracking problems
This problem tests your ability to use a monotonic stack to determine visibility in a 2D line and backtracking to generate valid structural sequences.
Coding & AlgorithmsTechnical ScreenMonotonic StackBacktrackingRecursion - TikTokMediumSoftware EngineerSolve top-K and string rotation match
Solve top-K and string rotation match 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.
Coding & AlgorithmsTechnical Screen - TmlMediumSoftware EngineerImplement a Resizable Deque
This question evaluates proficiency in data structures and array-based implementations, specifically building a resizable double-ended queue (deque) backed by a circular array and understanding amortized O(1) operation costs.
Coding & AlgorithmsTechnical Screen - Together AIMediumSoftware EngineerDetect cycles and break them in pod dependencies
This question evaluates proficiency with directed graph concepts and dependency resolution, focusing on cycle detection and selecting a single dependency edge whose removal renders the graph acyclic.
Coding & AlgorithmsTechnical Screen - Together AIMediumSoftware EngineerHistorical Lookups in a Timestamped Key-Value Store
Implement historical key-value lookups using timestamped writes, per-key ordered histories, and binary search for the latest eligible value.
Coding & AlgorithmsTechnical Screen - Together AIMediumSoftware EngineerSchedule GPU Pods and Drain a Node
Implement a GPU cluster manager to schedule workloads using a deterministic best-fit policy and simulate draining a node to check if all its pods can be migrated without disrupting other nodes.
Coding & AlgorithmsTechnical ScreenGreedySimulationSystem Design - Together AIEasySoftware EngineerSplit a Chunked Text Stream into Line-Balanced Parts
Construct any balanced whole-line partition of a chunked text stream, preserving exact content and newline rules while explaining buffering and streaming limits.
Coding & AlgorithmsTechnical Screen - TomaEasyFrontend EngineerApproximate Pi from Random Points
This question evaluates a candidate's understanding of Monte Carlo estimation, basic Euclidean geometry, probability, and numerical reasoning when using random sampling to approximate mathematical constants.
Coding & AlgorithmsTechnical Screen - TomaMediumSoftware EngineerImplement AudioStream Mixer
This problem tests your ability to manage temporal data and stateful buffers by implementing a class that merges multiple incoming audio streams into a single output track using overwrite-based mixing logic.
Coding & AlgorithmsTechnical ScreenHashMapsData StructuresSimulation - TrexquantMediumSoftware EngineerStreaming Median Tracker
This question evaluates a candidate's ability to design a data structure that maintains a running median over a stream of numbers, testing knowledge of heaps and balanced data partitioning. It is a classic coding and algorithms interview problem used to assess understanding of amortized time complexity and efficient online statistics tracking, requiring practical implementation rather than just conceptual discussion.
Coding & AlgorithmsTechnical Screen - TripStackMediumSoftware EngineerCompute minimum resources for overlapping intervals
This question evaluates understanding of interval overlap reasoning, resource-allocation and scheduling concepts, and proficiency with algorithmic complexity and appropriate data structure choices.
Coding & AlgorithmsTechnical Screen - TubiMediumSoftware EngineerExecute TTL Cache Operations with Fetch-on-Miss
Implement a deterministic TTL cache simulator with put, get, delete, size, and fetch-on-miss operations. Preserve expired records until deletion or replacement, model loader success and failure explicitly, and validate timestamped JSON-compatible inputs.
Coding & AlgorithmsTechnical Screen - TubiMediumMachine Learning EngineerImplement K-Means and compare with GMM
This question evaluates understanding and practical implementation of clustering algorithms, specifically K-Means centroid initialization, assignment and update mechanics, convergence criteria and edge-case handling, along with comparative knowledge of Gaussian Mixture Models and the Expectation-Maximization training framework.
Coding & AlgorithmsTechnical Screen - TubiMediumMachine Learning EngineerWeighted Random Sampling by Index
This question tests a candidate's ability to implement weighted random sampling using prefix sums and binary search, evaluating practical algorithm design for probability distributions. It assesses proficiency in translating mathematical probability constraints into efficient data structures, a skill commonly probed in machine learning engineering roles where non-uniform sampling is fundamental to model training and inference pipelines.
Coding & AlgorithmsTechnical Screen - TuringMediumSoftware EngineerCount permutations with exactly n inversions
This Coding & Algorithms question evaluates combinatorial counting and algorithmic skills related to permutations and inversion counts, emphasizing dynamic programming and modular arithmetic for large-result handling.
Coding & AlgorithmsTechnical Screen - TuroMediumSoftware EngineerCheck if a word exists in a grid
This question evaluates a candidate's skills in backtracking search, grid traversal, and managing state for constrained path-finding problems. Commonly asked to assess algorithmic problem-solving, recursion and memory-management (including in-place visited marking) within the Coding & Algorithms domain, it emphasizes practical application and understanding of time and space complexity trade-offs rather than purely theoretical concepts.
Coding & AlgorithmsTechnical Screen - Two SigmaHardData ScientistAdd two integer strings using digit-adder
This problem tests string manipulation, modular arithmetic, and the ability to manage carry-over logic manually to perform addition on integers that exceed the capacity of standard numeric data types.
Coding & AlgorithmsTechnical ScreenString ManipulationTwo PointersArithmetic - Two SigmaHardData ScientistAssign 2n Workers to Two Tasks to Minimize Total Time
This question evaluates algorithmic problem-solving skills in combinatorial optimization and resource allocation, focusing on reasoning about cost differences when assigning 2n workers into two equal-sized tasks and belongs to the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - Two SigmaMediumSoftware EngineerAutoscale a Server Fleet from Throughput Readings
This question evaluates algorithmic implementation skills and numeric reasoning, focusing on stateful simulation of autoscaling behavior and capacity arithmetic under streaming throughput readings.
Coding & AlgorithmsTechnical Screen - Two SigmaHardSoftware EngineerCompute maximum currency exchange rate
Compute maximum currency exchange rate 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.
Coding & AlgorithmsTechnical Screen - Two SigmaHardData ScientistExpected Number of Good Pairs in a Randomly Weighted Complete Graph
This question evaluates probabilistic reasoning, combinatorics, and order-statistics intuition by asking for the expected count of mutual maximum-edge neighbors (good pairs) in an edge-weighted complete graph with i.i.d. continuous weights.
Coding & AlgorithmsTechnical Screen - Two SigmaMediumSoftware EngineerImplement Price-Time Order Matching
Design and implement an in-memory limit order book matching engine supporting buy and sell orders with price-time priority (FIFO) and order cancellation.
Coding & AlgorithmsTechnical Screenheapdesignhash-table - Two SigmaMediumSoftware EngineerImplement a Hash Map with Separate Chaining and Resizing
This question evaluates understanding of hash table fundamentals, including hashing, separate chaining collision resolution, linked-list bucket management, dynamic resizing, and rehashing to maintain load factor and amortized performance.
Coding & AlgorithmsTechnical Screen - Two SigmaHardSoftware EngineerImplement an In-Memory Database
This question evaluates competence in implementing in-memory relational data structures, parsing tokenized database-like commands, and evaluating compound predicates with comparison operators.
Coding & AlgorithmsTechnical Screen - Two SigmaHardSoftware EngineerImplement binary encode/decode with frequency tree
This question evaluates understanding of frequency-based binary encoding and decoding, including deterministic tree construction, tie-breaking rules, and traversal, and tests knowledge of trees, priority queues, greedy algorithms, and bit-level string manipulation in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - Two SigmaMediumData ScientistImplement merge sort and largest 1-rectangle
This question evaluates proficiency in implementing and analyzing classic algorithms, specifically merge sort for array sorting and techniques for computing the largest all-ones rectangular submatrix in a binary matrix, testing algorithmic thinking, data structure manipulation, and time/space complexity reasoning.
Coding & AlgorithmsTechnical Screen - Two SigmaMediumQuantitative ResearcherLinear Interpolator with Extrapolation
This question evaluates understanding of piecewise linear interpolation and extrapolation, numerical robustness with floating-point values, and algorithmic competencies such as sorting and efficient query location for large datasets.
Coding & AlgorithmsTechnical Screen - Two SigmaMediumSoftware EngineerMatch Limit Orders with Price-Time Priority
Implement a limit order matching engine adhering to price-time priority (FIFO), resting-order execution pricing, and partial fill mechanics.
Coding & AlgorithmsTechnical ScreenHeapData StructuresSimulation
TikTok
Together AI
Trexquant
Tubi
Turo
Two Sigma