Coding & Algorithms interview questions

Showing 2881–2910 of 3276 results

• Solve four OA algorithm problemsHard

  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.

  TikTokSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve four algorithm design tasksMedium

  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.

  TikTokSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve intervals and distinct islandsMedium

  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.

  TikTokSoftware EngineerCoding & AlgorithmsOnsite
• Solve linked list, string filtering, and puzzleMedium

  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.

  TikTokSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve message splitting and board crushingMedium

  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.

  TikTokSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve three algorithm tasksMedium

  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.

  TikTokSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve three string/stack/backtracking problemsHard

  This problem tests your ability to use a monotonic stack to determine visibility in a 2D line and backtracking to generate valid structural sequences.

  TikTokSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve top-K and string rotation matchMedium

  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.

  TikTokSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Resizable DequeMedium

  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.

  TmlSoftware EngineerCoding & AlgorithmsTechnical Screen
• Detect cycles and break them in pod dependenciesMedium

  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.

  Together AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Historical Lookups in a Timestamped Key-Value StoreMedium

  Implement historical key-value lookups using timestamped writes, per-key ordered histories, and binary search for the latest eligible value.

  Together AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Schedule GPU Pods and Drain a NodeMedium

  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.

  Together AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Split a Chunked Text Stream into Line-Balanced PartsEasy

  Construct any balanced whole-line partition of a chunked text stream, preserving exact content and newline rules while explaining buffering and streaming limits.

  Together AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Approximate Pi from Random PointsEasy

  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.

  TomaFrontend EngineerCoding & AlgorithmsTechnical Screen
• Implement AudioStream MixerMedium

  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.

  TomaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Process Operations in a Timestamped In-Memory DatabaseMedium

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

  TradedeskSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement Trie search with wildcard matchingMedium

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

  TrexquantSoftware EngineerCoding & AlgorithmsOnsite
• Maintain median of a data streamMedium

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

  TrexquantSoftware EngineerCoding & AlgorithmsOnsite
• Streaming Median TrackerMedium

  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.

  TrexquantSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute minimum resources for overlapping intervalsMedium

  This question evaluates understanding of interval overlap reasoning, resource-allocation and scheduling concepts, and proficiency with algorithmic complexity and appropriate data structure choices.

  TripStackSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build blog UI with API data and likesMedium

  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.

  TripadvisorSoftware EngineerCoding & AlgorithmsOnline Assessment
• Query a Versioned ArrayMedium

  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.

  TruefoundrySoftware EngineerCoding & AlgorithmsOnsite
• Verify Ordering Under a Scrambled AlphabetMedium

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

  TruefoundrySoftware EngineerCoding & AlgorithmsOnsite
• Execute TTL Cache Operations with Fetch-on-MissMedium

  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.

  TubiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement K-Means and compare with GMMMedium

  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.

  TubiMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Weighted Random Sampling by IndexMedium

  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.

  TubiMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Count permutations with exactly n inversionsMedium

  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.

  TuringSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check if a word exists in a gridMedium

  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.

  TuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve four design-leaning coding problemsMedium

  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.

  TwitchSoftware EngineerCoding & AlgorithmsOnsite
• Add two integer strings using digit-adderHard

  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.

  Two SigmaData ScientistCoding & AlgorithmsTechnical Screen