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 7951–7980 of 9403 results
- SnowflakeHardData ScientistImplement DFS with cycle detection and topo order
This question evaluates mastery of graph algorithms—specifically depth-first search (both recursive and iterative), directed cycle detection, topological ordering, and discovery/finish timestamping—and falls under the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerImplement a JSON Parser
This problem tests your ability to implement a recursive-descent parser for a subset of the JSON format, focusing on string manipulation, state management, and hierarchical data structure construction.
Coding & AlgorithmsTechnical ScreenParsingRecursionString Processing - SnowflakeMediumFrontend EngineerImplement an event emitter
This problem tests your understanding of the observer pattern, internal state management using maps, and the ability to handle edge cases in listener lifecycle management.
Coding & AlgorithmsTechnical ScreenJavaScriptDesign PatternsEvent-Driven - SnowflakeMediumSoftware EngineerImplement and Test a Sliding-Window Rate Limiter
This problem tests your ability to implement an efficient sliding-window algorithm and design a robust testing strategy for a stateful component.
Software Engineering FundamentalsOnsiteAlgorithmsRate LimitingData Structures - SnowflakeHardSoftware EngineerImplement course scheduling and rate limiter analysis
This combined question evaluates proficiency in graph-based dependency reasoning (cycle detection and course scheduling) and time-series request processing (rate-limiter behavior and sliding-window request counting) within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerImplement crawler and bracket validator
This question evaluates competencies in web crawling and string validation, covering graph traversal and cycle avoidance with domain filtering for crawl discovery, and delimiter matching with error indexing for multi-type bracket validation.
Coding & AlgorithmsOnsite - SnowflakeMediumSoftware EngineerImplement topological sort and tree boundary traversal
These tasks evaluate core competencies in directed graph algorithms (topological ordering and cycle detection) and binary tree traversals (boundary identification and leaf enumeration), testing understanding of dependency modeling and traversal patterns.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerIn-Memory Key-Value Store with Constant-Time Nested Transactions
Build an in-memory key-value store with get, set and delete plus nested begin, commit and rollback, aiming for constant-time operations. Follow-ups extend it to concurrent threads, keys with a time to live, and reads of a key's value at an earlier point in time.
Software Engineering FundamentalsTechnical Screen - SnowflakeMediumData ScientistLead innovation and automate a critical process
This question evaluates leadership and technical program management competencies for a Data Scientist, including end-to-end innovation, cross-functional stakeholder alignment, risk identification and mitigation, trade-off rationale, measurable impact assessment, and process automation architecture and maintainability.
Behavioral & LeadershipTechnical Screen - SnowflakeMediumSoftware EngineerList the Nodes on the Path Between Two Nodes of a Binary Tree
Given a binary tree stored as child-index arrays and two node indices, return the nodes on the unique path between them, from the first node to the second. It tests parent tracking, ancestor reasoning and handling cases where one node lies above the other.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerMaximize revenue by choosing one query type
This problem tests greedy optimization and modular arithmetic skills to determine the most profitable query strategy given a limited time window.
Coding & AlgorithmsTechnical ScreenGreedyMathOptimization - SnowflakeHardSoftware EngineerMinimize coins with overpay and change
This problem tests your ability to optimize combinatorial decisions under constraints by identifying a greedy approach with a fallback to search or dynamic programming.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingOptimizationAlgorithms - SnowflakeMediumSoftware EngineerMinimum Months to Finish All Courses with Durations and Unlimited Parallelism
Courses take different numbers of months, some must finish before others start, and any number can run in parallel; return the minimum time to finish them all. It tests longest-path reasoning on a directed acyclic graph processed in topological order.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerMinimum Node Deletions to Bring an N-ary Tree's Height Within k
Given an N-ary tree as a parent array and a limit k, find the fewest non-root nodes to delete, promoting each deleted node's children to its nearest surviving ancestor, so that the tree's height is at most k. It tests reasoning about root-to-leaf paths and choosing deletions that shorten many paths at once.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerMinimum Prunes to Bring a Filesystem Tree's Depth Under a Limit
Given a directory tree where deleting a node reattaches its children to its own parent, find the minimum number of deletions needed to bring the deepest root-to-leaf path down to a given limit. Tests a budget-passing tree DP where deleting a node changes how much depth its children inherit.
Coding & AlgorithmsTechnical Screentreesdynamic-programmingrecursion - 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 EngineerMultiset with O(1) Insert, Remove, and Count-Weighted Random Pick
Design a collection of integers that allows duplicates and supports insert, remove and a random pick weighted by occurrence count, each in average constant time. Tests array and hash map bookkeeping, careful handling of moved elements during removal, and how to test randomized behavior.
Software Engineering FundamentalsOnsite - 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 - SnowflakeMediumDevOps EngineerPresent Your Infrastructure and Platform Experience
Assesses your ability to articulate end-to-end platform engineering achievements, architectural trade-offs, and operational ownership in a structured, impactful manner.
Behavioral & LeadershipHR ScreenDevOpsPlatform EngineeringCloud Architecture - SnowflakeMediumSoftware EngineerPrint an Org Chart as a Depth-Ordered List from Supervisor Pairs
Given a flat list of (person, supervisor) ID pairs, reconstruct the organization as a forest rooted at whoever has no supervisor, then emit a deterministic preorder listing of (id, depth). Tests root detection, building ordered adjacency lists, and careful DFS ordering.
Coding & AlgorithmsOnsitetreesgraphsdfs - 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 - SnowflakeEasySoftware EngineerSchedule prerequisite classes with retakes
This problem tests your ability to model dependencies using a Directed Acyclic Graph (DAG) and perform a topological sort while accounting for re-take conditions.
Coding & AlgorithmsOnsiteGraphTopological SortDependency Resolution
Snowflake