Question 1

Number of 1 Bits — Box Interview Question

Accepted Answer

"Number of 1 Bits" is a easy difficulty problem asked at Box interviews. It covers the following topics: Divide and Conquer, Bit Manipulation. You can practice it on LeetCode: https://leetcode.com/problems/number-of-1-bits

Question 2

Top K Frequent Words — Box Interview Question

Accepted Answer

"Top K Frequent Words" is a medium difficulty problem asked at Box interviews. It covers the following topics: Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting. You can practice it on LeetCode: https://leetcode.com/problems/top-k-frequent-words

Question 3

Word Ladder — Box Interview Question

Accepted Answer

"Word Ladder" is a hard difficulty problem asked at Box interviews. It covers the following topics: Hash Table, String, Breadth-First Search. You can practice it on LeetCode: https://leetcode.com/problems/word-ladder

Question 4

Kth Largest Element in a Stream — Box Interview Question

Accepted Answer

"Kth Largest Element in a Stream" is a easy difficulty problem asked at Box interviews. It covers the following topics: Tree, Design, Binary Search Tree, Heap (Priority Queue), Binary Tree, Data Stream. You can practice it on LeetCode: https://leetcode.com/problems/kth-largest-element-in-a-stream

Question 5

Event Emitter — Box Interview Question

Accepted Answer

"Event Emitter" is a medium difficulty problem asked at Box interviews. It covers the following topics: . You can practice it on LeetCode: https://leetcode.com/problems/event-emitter

Question 6

Redundant Connection — Box Interview Question

Accepted Answer

"Redundant Connection" is a medium difficulty problem asked at Box interviews. It covers the following topics: Depth-First Search, Breadth-First Search, Union Find, Graph. You can practice it on LeetCode: https://leetcode.com/problems/redundant-connection

#	Question Title	Difficulty	Frequency	Topics
1	Number of 1 Bits	EASY	100.0	Divide and ConquerBit Manipulation
2	Top K Frequent Words	MEDIUM	92.6	ArrayHash TableString+5
3	Word Ladder	HARD	77.0	Hash TableStringBreadth-First Search
4	Kth Largest Element in a Stream	EASY	66.8	TreeDesignBinary Search Tree+3
5	Event Emitter	MEDIUM	58.8	N/A
6	Redundant Connection	MEDIUM	58.8	Depth-First SearchBreadth-First SearchUnion Find+1

Explore 450+ Companies

Companies

Box

Box Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Box

Box Interview Questions

Ai Assistant Kas