practice a little every day, paws crossed ♡
Software Engineer 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 631–660 of 2629 results
- CitadelMediumSoftware EngineerMinimize image processing cost with discount
This question evaluates a candidate's competence in algorithm design and optimization, including interval-based cost aggregation and modular arithmetic for large-number results within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - CitadelMediumSoftware EngineerPerform an External Merge Sort with a Heap
Implement an external merge sort simulation that partitions a data stream into memory-bounded sorted runs and merges them using a min-heap.
Coding & AlgorithmsOnsiteExternal SortHeapStreaming - CitadelEasySoftware EngineerRead and Write Files with Shared Content
Design an in-memory file system that shares identical content payloads across multiple file paths to save memory, supporting reads, writes, and deduplication tracking.
Coding & AlgorithmsTechnical ScreenHash TableDesignString - CitadelMediumSoftware EngineerReturn a Valid Dependency Order for Named Tasks
Implement a deterministic topological sort for a directed acyclic graph of named tasks with cycle detection and lexicographical tie-breaking.
Coding & AlgorithmsTechnical ScreenGraphTopological SortHeap - CitadelMediumSoftware EngineerReturn nodes on a tree diameter path
This problem tests your ability to perform a two-pass Breadth-First Search (BFS) or Depth-First Search (DFS) on an undirected tree to find the longest path and reconstruct the sequence of nodes that form it.
Coding & AlgorithmsTechnical ScreenTreesGraph TheoryBFS - CitadelMediumSoftware EngineerSimulate 2048 and pack board into uint64
This question evaluates proficiency in implementing deterministic game-state logic and compact binary representations, specifically array manipulation and merge semantics for 2048 slide operations plus bit-level packing/unpacking of 4-bit exponent fields.
Coding & AlgorithmsOnsite - CitadelMediumSoftware EngineerTop-K Largest Elements in Every Sliding Window
Design an algorithm to maintain and extract the top-K largest elements in descending order for each sliding window of size W across an array.
Coding & AlgorithmsTechnical ScreenSliding WindowHeapOrdered Set - CitiMediumSoftware EngineerExplain data structure fundamentals
This question evaluates understanding of data structure fundamentals, specifically hash map internals (hashing, collision resolution strategies, load factor, and resizing), time complexity analysis for search/insert/delete, contrasts between arrays and linked lists for random access and insertion, and typical use cases and complexities for stacks versus queues. It is commonly asked in technical interviews to assess algorithmic thinking and the ability to reason about performance trade-offs and appropriate data structure selection; domain: Coding & Algorithms; level: tests both conceptual understanding and practical application.
Coding & AlgorithmsOnsite - ClickupMediumSoftware EngineerProcess document edit events
This question evaluates implementing and manipulating a line-based document through sequential event processing, emphasizing array/list operations, string handling, and state management; it belongs to the Coding & Algorithms domain and tests data-structure and input-event processing competency.
Coding & AlgorithmsOnsite - CloudKitchensMediumSoftware EngineerAnswer static and streaming Top-K queries
This question evaluates understanding of frequency counting, top-K selection, streaming and sliding-window algorithms and data-structure design in the Coding & Algorithms domain, testing both conceptual algorithmic reasoning and practical implementation skills.
Coding & AlgorithmsTechnical Screen - CloudKitchensMediumSoftware EngineerDesign a menu manager with enums
This question evaluates data modeling with enums, efficient data structure selection to meet specified time complexities, API design for CRUD operations, and practical implementation skills including a command-line interface and unit testing.
Coding & AlgorithmsTechnical Screen - CloudKitchensMediumSoftware EngineerDesign an in-memory cloud storage system
This problem tests your ability to design an efficient in-memory storage manager that handles concurrent file operations, user-based quotas, and data eviction policies.
Coding & AlgorithmsTechnical ScreenData StructuresSystem DesignOptimization - CloudKitchensMediumSoftware EngineerDesign receipt system with combo discounts
A CloudKitchens software-engineer technical screen: build a point-of-sale order that prints an itemized receipt on every item tap, then extend it to apply combo discounts. It tests cart data-structure design, receipt formatting, and the algorithm for selecting a valid set of non-overlapping combos.
Coding & AlgorithmsTechnical Screen - CloudKitchensMediumSoftware EngineerImplement concurrent order-accept/pickup simulator
This question evaluates concurrency and synchronization skills, including thread-safe design, inter-thread communication, state tracking, and correctness properties such as race-condition avoidance and deadlock freedom.
Coding & AlgorithmsTechnical Screen - CloudKitchensMediumSoftware EngineerImplement menu parser and serializer
This question evaluates proficiency in text parsing, hierarchical data modeling, tree construction and serialization, string manipulation, and algorithmic complexity (linear time/space).
Coding & AlgorithmsTechnical Screen - CloudflareMediumSoftware EngineerImplement a rule-based rate limiter
Design and implement a multi-rule rate limiter that tracks client request quotas across matching path prefixes using a sliding time window.
Coding & AlgorithmsOnsitesliding-windowdata-structuresdesign - Cockroach LabsMediumSoftware EngineerPoint-in-Time Reads from a Timestamped Key-Value Store
Build a versioned key-value store whose reads return the value a key held at a given timestamp: the latest write at or before that time, or an empty string if there is none. Tests choosing a per-key data layout that keeps point-in-time lookups fast across up to 200,000 operations.
Coding & AlgorithmsOnsite - CodeiumMediumSoftware EngineerFind the third-largest word by length
This question evaluates proficiency in string and array manipulation, ordering by key metrics (string length), and handling tie-breaking via stable ordering, situated in the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - CohereMediumSoftware EngineerDelete One '5' From a Digit String to Get the Largest Number
Given a digit string containing at least one 5, delete exactly one 5 so the remaining string has the largest possible numeric value, keeping any leading zeros. This intern online-assessment problem tests reasoning about how each digit position affects a number and careful handling of repeated digits.
Coding & AlgorithmsOnsite - CoinbaseMediumSoftware EngineerAnalyze food-delivery data
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Analyze food-delivery data states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - CoinbaseMediumSoftware EngineerCompute Total Manual Distance
This problem tests your ability to simulate a state-based movement process and calculate cumulative distance based on a non-monotonic set of instructions.
Coding & AlgorithmsOnsiteArraysSimulationMath - CoinbaseMediumSoftware EngineerCount users over n connections
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Count users over n connections states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - CoinbaseMediumSoftware EngineerDesign an in-memory database with TTL and backups
This question evaluates skills in designing and implementing in-memory data structures, TTL-based expiration, lexicographic prefix scans, and backup/restore snapshot semantics within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - CoinbaseMediumSoftware EngineerDesign crypto trading order control API
This question evaluates understanding of state management and finite-state machines, API design for lifecycle control, and implementation of in-memory data structures and transition validation in the Coding & Algorithms category.
Coding & AlgorithmsTechnical Screen - CoinbaseMediumSoftware EngineerDesign order stream with state transitions
Design order stream with state transitions 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 & AlgorithmsOnsite - CoinbaseHardSoftware EngineerGenerate NFT metadata and ensure uniqueness
This question evaluates understanding of combinatorics, deterministic pseudo-random generation, and efficient enumeration for producing unique NFT metadata, measuring competency in algorithm design, state-space management, and handling large-scale outputs.
Coding & AlgorithmsOnsite - CoinbaseMediumSoftware EngineerGenerate Weighted Random NFTs with Updates
This question evaluates understanding of weighted random sampling, efficient data structures for maintaining and updating prefix sums, probabilistic reasoning about sampling distributions, and reproducible testing of randomized algorithms within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - CoinbaseMediumSoftware EngineerGenerate constrained NFT metadata
Generate constrained NFT metadata 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 & AlgorithmsOnsite - CoinbaseMediumSoftware EngineerImplement Composable Range Iterators
This question evaluates understanding of iterator design, lazy evaluation, composable higher-order combinators (map, filter, zip, take, drop, chain), edge-case handling for forward/backward and negative-step ranges, overflow-safe termination, peekable semantics, iterator invalidation rules, and writing boundary-focused unit tests.
Coding & AlgorithmsOnsite - CoinbaseHardSoftware EngineerImplement Game Physics and Block Mining
This question evaluates implementation skills in deterministic game physics (discrete position and velocity updates with boundary and edge-case handling) alongside dependency-aware greedy selection for block construction, testing graph dependency resolution, greedy heuristics, and complexity analysis in the Coding & Algorithms domain, and is commonly asked to verify correctness under constraints, handling of boundary conditions, and trade-offs between optimality and performance. Level of abstraction spans both conceptual understanding (kinematic update rules, cycle detection, fee/size ratio reasoning) and practical application (implementing the tick update and returning a topologically ordered block while considering caching and scalability for large mempools).
Coding & AlgorithmsOnsite
Citadel
Citi
Cloudflare
Cohere
Coinbase