Find the k most frequently occurring words in a given list of words. Return the top k words sorted by frequency, and then alphabetically for words with the same frequency.

ArraysStrings

Somewhat likely

If you have a Box interview, you might get this question

Medium

#2. Top K Frequent Words

Medium

Find the k most frequently occurring words in a given list of words. Return the top k words sorted by frequency, and then alphabetically for words with the same frequency.

ArraysStrings

This question is somewhat likely to be asked in your Box interview

Word Ladder

Transform one word into another, one letter at a time, using only words from a given dictionary. Find the shortest sequence of words to reach the target.

StringsGraphs

Somewhat likely

If you have a Box interview, you might get this question

Hard

#3. Word Ladder

Hard

Transform one word into another, one letter at a time, using only words from a given dictionary. Find the shortest sequence of words to reach the target.

StringsGraphs

This question is somewhat likely to be asked in your Box interview

Univalued Binary Tree

Determine if a binary tree is univalued, meaning every node has the same value. You need to check if all nodes in the tree contain the same value.

TreesRecursion

Not likely

If you have a Box interview, it's unlikely that you will get this question. Box does ask it, but it's rare

Easy

#4. Univalued Binary Tree

Easy

Determine if a binary tree is univalued, meaning every node has the same value. You need to check if all nodes in the tree contain the same value.

TreesRecursion

This question is not likely to be asked in your Box interview

Event Emitter

Implement an event emitter class that allows subscribing to and emitting events. The class should handle multiple subscribers for the same event and allow unsubscribing.

Not likely

If you have a Box interview, it's unlikely that you will get this question. Box does ask it, but it's rare

Medium

#5. Event Emitter

Medium

Implement an event emitter class that allows subscribing to and emitting events. The class should handle multiple subscribers for the same event and allow unsubscribing.

This question is not likely to be asked in your Box interview

Rotate Array

Given an array, rotate the elements to the right by a specified number of steps. The goal is to modify the original array in-place with the rotated elements.

ArraysTwo Pointers

Not likely

If you have a Box interview, it's unlikely that you will get this question. Box does ask it, but it's rare

Medium

#6. Rotate Array

Medium

Given an array, rotate the elements to the right by a specified number of steps. The goal is to modify the original array in-place with the rotated elements.

ArraysTwo Pointers

This question is not likely to be asked in your Box interview

Redundant Connection

You're given a graph represented by a list of edges. Find and return the edge that, when removed, makes the graph a tree (removes the cycle).

TreesGraphs

Not likely

If you have a Box interview, it's unlikely that you will get this question. Box does ask it, but it's rare

Medium

#7. Redundant Connection

Medium

You're given a graph represented by a list of edges. Find and return the edge that, when removed, makes the graph a tree (removes the cycle).

TreesGraphs

This question is not likely to be asked in your Box interview