TikTok
High-volume loops with several algorithm rounds, often back to back, then a design round and a hiring-manager conversation.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Second technical phone screen
- 4Onsite: two to three algorithm rounds
- 5Hiring-manager and HR round
Questions
Callback's practice questions and the LeetCode questions TikTok has been asking, filtered together.
Asked on LeetCode
348 questions · all time
- 3Sum SmallermediumArrayTwo PointersBinary SearchSortingfrequency 24.6
- Add Two IntegerseasyMathfrequency 24.6
- Add Two NumbersmediumLinked ListMathRecursionfrequency 24.6
- Add Two Numbers IImediumLinked ListMathStackfrequency 24.6
- Arithmetic SlicesmediumArrayDynamic ProgrammingSliding Windowfrequency 24.6
- As Far from Land as PossiblemediumArrayDynamic ProgrammingBreadth-First SearchMatrixfrequency 24.6
- Candy CrushmediumArrayTwo PointersMatrixSimulationfrequency 24.6
- Combination Sum IVmediumArrayDynamic Programmingfrequency 24.6
- Concatenated WordshardArrayStringDynamic ProgrammingDepth-First Search+2frequency 24.6
- Consecutive Numbers SumhardMathEnumerationfrequency 24.6
- Construct Binary Tree from Inorder and Postorder TraversalmediumArrayHash TableDivide and ConquerTree+1frequency 24.6
- Convert Sorted Array to Binary Search TreeeasyArrayDivide and ConquerTreeBinary Search Tree+1frequency 24.6
- Copy List with Random PointermediumHash TableLinked Listfrequency 24.6
- Count Binary SubstringseasyTwo PointersStringfrequency 24.6
- Count Pairs Of Similar StringseasyArrayHash TableStringBit Manipulation+1frequency 24.6
- Count the Number of Good SubarraysmediumArrayHash TableSliding Windowfrequency 24.6
- Department Top Three SalarieshardDatabasefrequency 24.6
- Diagonal TraversemediumArrayMatrixSimulationfrequency 24.6
- Dot Product of Two Sparse VectorsmediumArrayHash TableTwo PointersDesign+1frequency 24.6
- Employee Free TimehardArraySweep LineSortingHeap (Priority Queue)frequency 24.6
- Encode and Decode StringsmediumArrayStringDesignfrequency 24.6
- Event Emittermediumfrequency 24.6
- Expression Add OperatorshardMathStringBacktrackingfrequency 24.6
- Find K Closest ElementsmediumArrayTwo PointersBinary SearchSliding Window+2frequency 24.6
- Find Maximum Non-decreasing Array LengthhardArrayBinary SearchDynamic ProgrammingStack+4frequency 24.6
- Find Positive Integer Solution for a Given EquationmediumMathTwo PointersBinary SearchInteractivefrequency 24.6
- Find the CelebritymediumTwo PointersGraph TheoryInteractivefrequency 24.6
- Flip Game IImediumMathDynamic ProgrammingBacktrackingMemoization+4frequency 24.6
- Furthest Building You Can ReachmediumArrayGreedyHeap (Priority Queue)frequency 24.6
- Graph Valid TreemediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 24.6
- Happy NumbereasyHash TableMathTwo PointersFloyd's Cycle Finding Algorithmfrequency 24.6
- HeatersmediumArrayTwo PointersBinary SearchSortingfrequency 24.6
- Human Traffic of StadiumhardDatabasefrequency 24.6
- Implement Queue using StackseasyStackDesignQueuefrequency 24.6
- Implement Rand10() Using Rand7()mediumMathRejection SamplingRandomizedProbability and Statisticsfrequency 24.6
- Implement Trie (Prefix Tree)mediumHash TableStringDesignTriefrequency 24.6
- Insert IntervalmediumArrayfrequency 24.6
- Insert into a Sorted Circular Linked ListmediumLinked Listfrequency 24.6
- Integer to RomanmediumHash TableMathStringfrequency 24.6
- K-th Smallest in Lexicographical OrderhardTriefrequency 24.6
- Kth Smallest Element in a BSTmediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 24.6
- Length of Longest Subarray With at Most K FrequencymediumArrayHash TableSliding Windowfrequency 24.6
- Lowest Common Ancestor of a Binary Tree IIImediumHash TableTwo PointersTreeBinary Tree+2frequency 24.6
- Lowest Common Ancestor of a Binary Tree IVmediumHash TableTreeDepth-First SearchBinary Tree+2frequency 24.6
- Maximal Score After Applying K OperationsmediumArrayGreedyHeap (Priority Queue)frequency 24.6
- Maximum Number of Events That Can Be AttendedmediumArrayGreedySortingHeap (Priority Queue)frequency 24.6
- Maximum Performance of a TeamhardArrayGreedySortingHeap (Priority Queue)frequency 24.6
- Maximum Profit in Job SchedulinghardArrayBinary SearchDynamic ProgrammingSortingfrequency 24.6
- Maximum Size Subarray Sum Equals kmediumArrayHash TablePrefix Sumfrequency 24.6
- Maximum Spending After Buying ItemshardArrayGreedySortingHeap (Priority Queue)+1frequency 24.6