Katkat

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 2881–2910 of 3276 results

  • TikTokHardSoftware Engineer
    Solve four OA algorithm problems

    This problem tests your ability to optimize string manipulation using greedy approaches and Fenwick trees to count minimum adjacent swaps required to transform a string into a palindrome.

    Coding & AlgorithmsTechnical ScreenGreedyStringsTwo Pointers
  • TikTokMediumSoftware Engineer
    Solve four algorithm design tasks

    This multi-part question evaluates algorithm design and data-structure competencies including wildcard string pattern matching and trade-offs between dynamic programming and greedy strategies, dynamic pair-sum maintenance under frequent updates, O(1) LRU cache design, and scheduling/ordering for time-constrained threat neutralization.

    Coding & AlgorithmsOnline Assessment
  • TikTokMediumSoftware Engineer
    Solve intervals and distinct islands

    This question evaluates skills in interval manipulation and identification of distinct connected components in grids, testing competencies in data structure usage, algorithmic reasoning, and spatial pattern recognition within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • TikTokMediumSoftware Engineer
    Solve linked list, string filtering, and puzzle

    This problem tests your ability to manipulate linked list pointers in-place, apply conditional string filtering with index tracking, and solve a greedy resource partitioning puzzle.

    Coding & AlgorithmsTechnical ScreenLinked ListStringsGreedy
  • TikTokMediumSoftware Engineer
    Solve 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 Engineer
    Solve 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 Engineer
    Solve 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 Engineer
    Solve 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 Engineer
    Implement 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 Engineer
    Detect 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 Engineer
    Historical 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 Engineer
    Schedule 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 Engineer
    Split 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 Engineer
    Approximate 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 Engineer
    Implement 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
  • TradedeskMediumSoftware Engineer
    Process Operations in a Timestamped In-Memory Database

    This problem tests your ability to design an in-memory data store with complex querying and expiration requirements using efficient nested data structures.

    Coding & AlgorithmsOnline AssessmentHash MapSortingData Structures
  • TrexquantMediumSoftware Engineer
    Implement Trie search with wildcard matching

    This question evaluates understanding of trie data structures, string pattern matching with wildcard characters, and efficient algorithm design for large-scale add/search operations.

    Coding & AlgorithmsOnsite
  • TrexquantMediumSoftware Engineer
    Maintain median of a data stream

    This question evaluates proficiency in streaming data aggregation, dynamic order-statistics maintenance, and algorithmic complexity analysis for insertion and query operations.

    Coding & AlgorithmsOnsite
  • TrexquantMediumSoftware Engineer
    Streaming 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 Engineer
    Compute 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
  • TripadvisorMediumSoftware Engineer
    Build blog UI with API data and likes

    This question evaluates front-end JavaScript competencies including UI rendering, client-side state management, asynchronous REST API integration, loading and error handling, and resolving author identity relative to the current user.

    Coding & AlgorithmsOnline Assessment
  • TruefoundryMediumSoftware Engineer
    Query a Versioned Array

    This problem tests your ability to design a data structure that supports efficient state snapshots and point queries, specifically focusing on space-time trade-offs.

    Coding & AlgorithmsOnsiteData StructuresBinary SearchArrays
  • TruefoundryMediumSoftware Engineer
    Verify Ordering Under a Scrambled Alphabet

    This problem tests string manipulation, hash map usage for indexing, and the ability to compare two strings based on custom character priority.

    Coding & AlgorithmsOnsiteStringsSortingHash Map
  • TubiMediumSoftware Engineer
    Execute 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 Engineer
    Implement 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 Engineer
    Weighted 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 Engineer
    Count 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 Engineer
    Check 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
  • TwitchMediumSoftware Engineer
    Solve four design-leaning coding problems

    This multi-part question evaluates algorithmic problem-solving, data structure design and manipulation (such as LRU cache semantics), stateful simulation and scoring logic, chronological quota accounting for billing, and set/map operations for detecting overlaps.

    Coding & AlgorithmsOnsite
  • Two SigmaHardData Scientist
    Add 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