practice a little every day, paws crossed ♡
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 3811–3840 of 4616 results
- SnowflakeMediumSoftware EngineerMost Frequent k Words or Bestselling Titles with Alphabetical Tie-Breaks
Given a list of items such as trending words or bestselling book titles and a number k, return the k most frequent items ordered by count, with ties broken alphabetically. It tests frequency counting, sorting with a compound key and heap-based selection.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerMost Meetings You Can Attend When Each Takes One Day Within Its Range
Each meeting can be attended on any single day within its range, and only one meeting fits on each day; return the largest number of meetings you can attend. It tests interval scheduling reasoning and an exchange argument for why a local choice stays optimal.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerMultithreaded Web Crawler with Retries for a Failing Fetch API
Write a web crawler that visits every page reachable from a start URL through a slow link-fetching API, first with BFS or DFS, then with multiple threads, then with retries when the API fails. It tests visited-set safety, termination detection, backoff and failure reporting.
Software Engineering FundamentalsTechnical Screen - SnowflakeMediumSoftware EngineerN-ary Tree Height After Deleting Nodes and Reattaching Their Children
Given an N-ary tree as a parent array and a set of nodes to delete, move each deleted node's children up to its nearest surviving ancestor and report the height of the resulting tree. Tests building a tree from parent links, reasoning about cascading deletions, and computing depths on a tree that can be a path of 100,000 nodes.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerPropagate Permission Letters Through a DAG Using Each Node's Final State
Given a directed acyclic graph in which each node grants and revokes letter permissions, compute every node's final set of letters when each node passes only its final state to its children. Tests topological processing, set propagation over multiple parents, and letters that descendants grant again after an ancestor revokes them.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerQuery Unique and Most-Frequent Keys in a Recent Event Window
Design an in-memory event tracker that maintains the most recent m arrivals from a timestamped stream and efficiently queries distinct key counts and top-frequency keys above a cutoff timestamp.
Coding & AlgorithmsTechnical Screensliding-windowbinary-searchhash-table - SnowflakeMediumData ScientistQuery seven-day conversion with windows and dedupe
This question evaluates proficiency in time-windowed aggregations, event deduplication, and window-function–based user-level analytics across SQL and Pandas workflows.
Data Manipulation (SQL/Python)Technical Screen - SnowflakeMediumSoftware EngineerRate Limiter with Tiers, Runtime Config Changes and Multiple Rules
Implement a rate limiter using a token bucket or sliding window, then support client tiers whose limits change while the service runs, several rules checked on one request, and deterministic tests with a mock clock. It tests algorithm choice, safe configuration swaps and thread-safe all-or-nothing checks.
Software Engineering FundamentalsTechnical Screen - SnowflakeMediumSoftware EngineerReplay Ops on a Freezer-Probe Stack That Tracks Its Minimum in O(1)
Replay a sequence of push/pop/peek/min-read operations on a stack of freezer temperature readings and return what each read produces, where reading the current minimum must be as fast as pushing or popping. Tests pairing a stack with running-minimum bookkeeping that stays correct through duplicate minimums and repeated pops.
Coding & AlgorithmsTechnical Screenstackdata-structuressimulation - SnowflakeMediumSoftware EngineerReturn the Prerequisite Route for a Target Course
Find a deterministic, lexicographically smallest topological order of all direct and indirect prerequisites for a specific target course while ignoring cycles outside the target's dependency subgraph.
Coding & AlgorithmsTechnical ScreenGraphTopological SortHeap - SnowflakeMediumSoftware EngineerReverse a Character Array In Place with Constant Extra Memory
Reverse a string given as an array of characters in place, using only constant extra memory, and return the same list. A short coding warm-up that tests index handling, swapping elements and odd and even lengths without building a copy.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerSolve Matrix and Array Distance Problems
Implement a multi-source breadth-first search to find the shortest path from every compute node to its nearest data warehouse in a grid with obstacles.
Coding & AlgorithmsTechnical ScreenGraphBFSMatrix - SnowflakeMediumSoftware EngineerSolve build ordering and expression evaluation
This question evaluates competency in graph algorithms (topological ordering and cycle detection) and in parsing/evaluating arithmetic expressions with correct operator precedence, associativity, unary operators, and 64-bit integer semantics.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerSolve scheduling and tree path problems
This problem tests your ability to optimize path calculations in a tree by combining depth-first traversal with a greedy or dynamic programming approach to select paths that satisfy specific constraints.
Coding & AlgorithmsTechnical ScreenTreesDynamic ProgrammingRecursion - SnowflakeMediumSoftware EngineerSort an RGB Record Collection In Place
This question tests the ability to partition an array into three distinct groups (Red, Green, Blue) in a single pass using constant extra space, which is a classic application of the Dutch National Flag algorithm.
Coding & AlgorithmsTechnical ScreenSortingTwo PointersIn-place - SnowflakeMediumSoftware EngineerStack with Constant-Time Minimum over a Sequence of Operations
Design a stack that supports push, pop, top and reading its current minimum in constant time, then run it over a sequence of operations and return what the reads produce. Tests data structure design, duplicate minimum values and keeping auxiliary state consistent on every pop.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerTime-Versioned Key-Value Store and Time-Window Event Counter
Build a key-value store that keeps every timestamped value of a key and returns the value in effect at a given time, then a counter that answers how many events occurred in a time window. It tests binary search over histories, window semantics and memory bounds.
Software Engineering FundamentalsTechnical Screen - SnowflakeMediumSoftware EngineerTransform tree using counterpart subtree sums
This question evaluates proficiency with binary tree algorithms and in-place subtree aggregation, emphasizing traversal strategies, shape verification, and handling subtree sums under linear-time and O(h) space constraints.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerTransform tree with subtree sum mapping
Transform tree with subtree sum mapping 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 - SnowflakeMediumSoftware EngineerTraverse All Reachable Pages With Parallel BFS
Implement a concurrent breadth-first web crawler that discovers all reachable pages from a start URL. The crawler must fetch pages concurrently while maintaining deterministic level-order output and safely handling cycles and fetch errors.
Coding & AlgorithmsTechnical ScreenBreadth-First SearchConcurrencyGraph - SoFiMediumData ScientistAlign with PM on ranking goals
This question evaluates stakeholder alignment, risk management, product-ranking trade-offs, regulatory and compliance awareness, metric definition, and communication and negotiation skills relevant to delivering an MVP while planning a future ML iteration.
Behavioral & LeadershipTechnical Screen - SoFiMediumSoftware EngineerAnswer Leadership Scenario Questions
This question assesses a candidate's ability to navigate conflicting priorities, advocate for technical excellence, and handle stakeholder management when product roadmaps shift unexpectedly.
Behavioral & LeadershipTechnical ScreenLeadershipStakeholder ManagementConflict Resolution - SoFiEasySoftware EngineerCount completed car journeys from sensor logs
This question evaluates stateful event-stream processing and per-entity state management, testing the ability to track and reconcile time-ordered sensor events while handling edge cases like unmatched or spurious events.
Coding & AlgorithmsTechnical Screen - SoFiMediumSoftware EngineerDemonstrate project impact and teach something
This question evaluates a candidate's ability to articulate project impact, demonstrate technical leadership, reason about design trade-offs, present measurable outcomes, and teach a technical concept clearly and contextually.
Behavioral & LeadershipTechnical Screen - SoFiMediumSoftware EngineerDesign a key-value store with getLast
Design a key-value store with getLast 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 - SoFiMediumSoftware EngineerExplain GC, singleton, and OOP principles
This question evaluates understanding of Java runtime memory management (generational garbage collection, marking, compaction), software design patterns (Singleton), and object-oriented design and SOLID principles, testing competencies in performance reasoning, concurrency and thread-safety considerations, design trade-offs, and maintainability.
Software Engineering FundamentalsTechnical Screen - SoFiEasySoftware EngineerFind Smallest Common Row Value
This question evaluates algorithmic problem-solving skills focused on array processing, intersection across multiple sorted sequences, and time/space complexity analysis.
Coding & AlgorithmsTechnical Screen - SoFiMediumSoftware EngineerFind the second most frequent tag
This question evaluates a candidate's ability to perform frequency analysis and stable tie-breaking on a linear sequence, exercising skills in hashing, counting, and handling edge cases such as equal frequencies.
Coding & AlgorithmsTechnical Screen - SoFiMediumSoftware EngineerFormat words into wrapped/justified lines
This problem tests your ability to implement a greedy word-wrapping algorithm that packs words into lines of a fixed width while managing spacing constraints.
Coding & AlgorithmsTechnical ScreenStringsGreedyArray - SoFiMediumSoftware EngineerImplement a multithreaded task executor with semaphores
This question evaluates understanding of concurrent programming, thread-safety, semaphore-style resource management, exception-safe permit release, and extensible API design, and it falls under the Coding & Algorithms category testing concurrency/multithreading, synchronization primitives, and resource management.
Coding & AlgorithmsTechnical Screen
Snowflake
SoFi