Katkat

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 1891–1920 of 2629 results

  • PinterestMediumSoftware Engineer
    Fewest Buses to Ride Between Two Stops on Looping Bus Lines

    A coding problem about bus lines that loop through fixed lists of stops: find the fewest buses a rider must board to travel from a source stop to a target stop, or report that the target cannot be reached. It tests modeling transfers between lines as a graph and keeping the search efficient when many lines share stops.

    Coding & AlgorithmsOnsite
  • PinterestMediumSoftware Engineer
    Find First Prefix-Matching Word

    This problem tests your ability to efficiently search through a collection of strings to find the first element that satisfies a specific prefix condition, emphasizing clean iteration and edge case management.

    Coding & AlgorithmsTechnical ScreenStringsArraysIteration
  • PinterestMediumSoftware Engineer
    Find minimum shuttle transfers

    Find minimum shuttle transfers 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 & AlgorithmsOnline Assessment
  • PinterestMediumSoftware Engineer
    Find the Minimum Number of Coins for an Amount

    Tests dynamic programming and breadth-first search techniques to find the minimum number of coin denominations required to reach a target value, including edge cases like zero and unreachable sums.

    Coding & AlgorithmsOnsitedynamic-programmingbfsarrays
  • PinterestMediumSoftware Engineer
    Implement a min-heap column allocator

    This question evaluates a candidate's competency in data structures (priority queues/min-heaps), online algorithm design for stream processing, and complexity and memory analysis.

    Coding & AlgorithmsTechnical Screen
  • PinterestMediumSoftware Engineer
    Implement sparse matrix storage, addition, and multiplication

    This problem tests your ability to design a memory-efficient representation for sparse matrices and implement arithmetic operations while leveraging the sparsity of the data.

    Coding & AlgorithmsOnsiteArraysHash MapsLinear Algebra
  • PinterestMediumSoftware Engineer
    Implement stream line reader and settle balances

    This question evaluates streaming I/O and buffered string-processing competency for Part 1 and transaction netting with balance computation for Part 2, covering skills in memory-bounded parsing, data-structure bookkeeping, and algorithmic flow reasoning.

    Coding & AlgorithmsOnsite
  • PinterestMediumSoftware Engineer
    Implement string-based big integer multiplication

    Implement multiplyStrings(a, b) to multiply two non-negative integers given as decimal strings, returning the product as a string without any big-integer or arbitrary-precision library. The solution covers grade-school O(n*m) long multiplication with linear memory, the Karatsuba and FFT/NTT scaling alternatives, correct carry and leading/trailing-zero handling, and a full edge-case test plan.

    Coding & AlgorithmsOnsite
  • PinterestMediumSoftware Engineer
    Insert Operators to Reach a Target

    Tests backtracking with operator precedence handling and operand formatting to construct all valid arithmetic expressions evaluating to a target value.

    Coding & AlgorithmsOnsitebacktrackingrecursionstring
  • PinterestHardSoftware Engineer
    List All Plus/Times Expressions Reaching a Target Under Operator Precedence

    Tests backtracking and state tracking with operator precedence to evaluate and enumerate arithmetic expressions using addition and multiplication.

    Coding & AlgorithmsOnsiteBacktrackingRecursionMath
  • PinterestMediumSoftware Engineer
    List Unallocated Experiment Buckets

    Determine all unassigned experiment bucket IDs in the range [0, total_buckets - 1] given lists of control and treatment bucket allocations.

    Coding & AlgorithmsTechnical Screenarrayhash-tablebit-manipulation
  • PinterestMediumSoftware Engineer
    Mark and Compact a Heap-Indexed Subtree

    This problem tests array manipulation, heap-based tree traversal, and stable partitioning techniques while requiring memory efficiency without modifying the original input.

    Coding & AlgorithmsOnline AssessmentArraysTreesHeap
  • PinterestMediumSoftware Engineer
    Minimum Transfers Between Pin Boards

    Tests breadth-first search and graph modeling skills by finding the shortest path across overlapping collections without constructing a dense graph between every pair.

    Coding & AlgorithmsOnsiteBFSGraphHash Map
  • PinterestMediumSoftware Engineer
    Rebalance Experiment Buckets with Minimal Reassignment

    Implement a deterministic rebalancing algorithm that redistributes entities among experiment buckets to meet exact target counts while minimizing reassignments and applying canonical tie-breaking.

    Coding & AlgorithmsTechnical Screengreedysortinghash-map
  • PinterestMediumSoftware Engineer
    Reconstruct an Itinerary from Flight Tickets

    Tests graph modeling, depth-first search (DFS), and Hierholzer's algorithm to construct an Eulerian path with lexicographical tie-breaking.

    Coding & AlgorithmsOnsiteGraphDFSEulerian Path
  • PinterestMediumSoftware Engineer
    Reconstruct itinerary with lexicographic ties

    This question evaluates a candidate's ability to model and traverse directed graphs with repeated edges, enforce lexicographic ordering among possible paths, and analyze time and space complexity for an algorithmic solution.

    Coding & AlgorithmsTechnical Screen
  • PinterestMediumSoftware Engineer
    Reconstruct route from unordered travel tickets

    This problem tests your ability to model a graph where each edge represents a transition, requiring you to find a valid linear sequence that visits every node exactly once.

    Coding & AlgorithmsOnsiteGraphsHash MapLinked List
  • PinterestMediumSoftware Engineer
    Remove and Compact a Parent-Index Forest

    Tests tree traversal to find subtrees, array compaction, and index remapping on a parent-pointer forest representation without mutating input data.

    Coding & AlgorithmsTechnical Screentreearraybfs
  • PinterestMediumSoftware Engineer
    Round numeric string values

    This question evaluates parsing and numeric manipulation skills, specifically implementing rounding rules for numeric strings and handling decimals, significant digits, and precision edge cases.

    Coding & AlgorithmsTechnical Screen
  • PinterestMediumSoftware Engineer
    Select the Nearest Eligible Elevator

    Implement an elevator dispatch selection algorithm that finds the nearest eligible elevator for a passenger request based on floor, direction, and tie-breaking rules.

    Coding & AlgorithmsTechnical Screenarrayssimulationgreedy
  • PinterestMediumSoftware Engineer
    Settle Group Expenses with Transfers

    This question evaluates the ability to compute and reconcile per-person financial balances from transactional data and to translate net liabilities into direct transfers, exercising skills in numeric bookkeeping and data aggregation.

    Coding & AlgorithmsTechnical Screen
  • PinterestMediumSoftware Engineer
    Settle debts with minimal transactions

    Pinterest software-engineer onsite coding question: given a list of debts as (debtor, creditor, amount) triples, return settlement transfers that clear every net balance using the minimum number of transactions. It tests reducing to net balances, recognizing the problem is NP-hard, backtracking with pruning to find the optimum for small N, and a heap-based greedy heuristic plus correctness and time/space complexity analysis for large, skewed debt graphs.

    Coding & AlgorithmsOnsite
  • PinterestMediumSoftware Engineer
    Solve Four Interview Coding Problems

    This set tests proficiency in graph algorithms, binary search on sorted data, grid simulations, and custom data structure design for real-time leaderboards.

    Coding & AlgorithmsOnsiteGraphsBinary SearchSimulation
  • PinterestMediumSoftware Engineer
    Solve Multiple Coding Interview Problems

    Tests breadth-first search and bipartite/dual-graph modeling to find the minimum number of transit lines needed to travel between two stops.

    Coding & AlgorithmsTechnical ScreenGraphBFSHash Table
  • PinterestMediumSoftware Engineer
    Solve Two Grid Search Problems

    This problem tests your ability to navigate 2D grids and apply graph traversal algorithms to identify connected components and calculate propagation distances.

    Coding & AlgorithmsTechnical ScreenGraph TheoryBFSDFS
  • PinterestMediumSoftware Engineer
    Solve set equality and ad log top‑K

    This multi-part question evaluates set and multiset operations, frequency counting, top-K computation over time windows, sliding-window and streaming data structures, and character-multiset matching for string construction within the coding & algorithms domain.

    Coding & AlgorithmsOnsite
  • PitchbookEasySoftware Engineer
    Implement Euclidean distance and k-nearest neighbors

    This question evaluates understanding of Euclidean distance metrics, vector arithmetic, and nearest-neighbor retrieval, testing implementation skills for computing distances and selecting the k closest points.

    Coding & AlgorithmsOnsite
  • PlaidMediumSoftware Engineer
    Calculate Ordered Job Makespan Across Parallel Workers

    Calculate the total makespan required to process a queue of ordered jobs across a fixed pool of identical parallel workers.

    Coding & AlgorithmsTechnical ScreenHeapGreedySimulation
  • PlaidMediumSoftware Engineer
    Compute discounted prices in a queue

    This question evaluates proficiency in array processing, algorithm design, use of auxiliary data structures such as monotonic stacks, and formal complexity and correctness reasoning.

    Coding & AlgorithmsTechnical Screen
  • PlaidMediumSoftware Engineer
    Count Completed Jobs in a Serial Multi-Worker Pipeline

    Calculate the total number of jobs completed by a given deadline across a multi-stage pipelined system with worker pools. The solution requires simulating stage-by-stage batch execution, tracking wave durations, and enforcing barrier synchronization between stages.

    Coding & AlgorithmsTechnical ScreenSimulationDynamic ProgrammingQueue