OA (Auto)
Final
1-3 rounds
team dependent
Decision
OA (Auto)
Final
1-3 rounds
team dependent
Decision
We don't have information about this company's recruiting timeline yet. Check back later or contribute if you have insights.
Find the kth largest element in an array and in a binary tree.
Solve a dynamic programming problem of medium to hard difficulty.
Describe a dynamic programming question related to TikTok's algorithm typically found on LeetCode.
Solve a complex graph-based problem involving nodes and connections with specific constraints, followed by a list- or array-based problem requiring the use of queues and sets.
Given a set of digits and an integer N, create the largest number less than N using those digits.
I was asked to solve several tree problems, possibly medium difficulty from LeetCode.
Describe a technical question similar to the asteroid collision problem.
Solve a medium-level algorithm problem commonly found on HackerRank or LeetCode.
Solve a hard LeetCode problem and answer a follow-up question about it.
Invert a linked list as presented in the LeetCode question.