Snowflake Interview Guide

Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

You're given a list of jobs with start times, end times, and profits. Find the maximum profit you can obtain by scheduling a subset of jobs that don't overlap.

You are given k sorted lists. Combine all of their elements into a single sorted list and return it.

You're given courses with prerequisites and time to complete each. Find the minimum time to finish all courses, taking dependencies and parallel study into account.

You are given a list of events with start times, end times, and values. Determine the maximum total value you can obtain by attending at most 'k' events, without any overlapping events.

Implement an in-memory file system with basic operations like creating directories, adding files, and listing contents. The file system should support path-based navigation.

You're given a list of courses and their prerequisites. Determine a valid order in which you can take all the courses, respecting the dependencies. If it's impossible to finish all courses, indicate that.

You are given a board of characters and a list of words. Find all the words from the list that can be formed by traversing adjacent cells on the board.

Find the smallest substring within a larger string that contains all the characters of a target string. You need to locate the minimum window that satisfies this condition.

Find all starting indices of substrings in a string `s` that are anagrams of a given string `p`. An anagram has the same letters, rearranged.

Determine if one string can be transformed into another by repeatedly moving a character to the beginning of the string. Return the minimum number of moves required, or -1 if it's impossible.

You're given a person's income and tax brackets with corresponding rates. Calculate the total amount of tax they need to pay based on their income and the tax brackets.

Imagine navigating a binary tree. Find the shortest path, represented as a sequence of directions ('U', 'L', 'R'), from one specific node to another.

You're given servers with varying CPU requirements and a limited budget to upgrade them. Determine the maximum number of servers you can upgrade within the budget, considering different upgrade tiers.

Given an array representing the height of bars, calculate how much water can be trapped between them after rain. Think about finding the maximum height to the left and right of each bar.

You are given a sequence of numbers. Find the longest subsequence that satisfies a specific 'good' condition related to divisibility.

You need to paint several walls. You can either pay a painter or use your free painting skills, each having different costs and time. Determine the minimum cost to paint all the walls.

You're given an array of numbers. Find the minimum possible length of the array after repeatedly removing pairs of equal numbers.

You're given a sequence of numbers and need to find the longest subsequence that satisfies a specific 'good' condition defined by its elements. The definition of a 'good' sequence is provided in the detailed problem description.

You're given a dictionary of words and a target string. Find the number of ways to construct the target string by picking characters from the words in the dictionary at each position.