Refreshed monthly, last refreshed on June 13, 2026
| Problem | Patterns | Difficulty | |
|---|---|---|---|
| 64. Minimum Path Sum | Medium | ||
| 3164. Find the Number of Good Pairs II | Medium | ||
| 2202. Maximize the Topmost Element After K Moves | Medium | ||
| 913. Cat and Mouse | Hard | ||
| 107. Binary Tree Level Order Traversal II | Medium | ||
| 827. Making A Large Island | Hard | ||
| 863. All Nodes Distance K in Binary Tree | Medium | ||
| 487. Max Consecutive Ones II | Medium | ||
| 2021. Brightest Position on Street | Medium | ||
| 311. Sparse Matrix Multiplication | Medium | ||
| ๐ | 588. Design In-Memory File System | Adv. Data StructureBasic DSA | Hard |
| ๐ | 358. Rearrange String k Distance Apart | Misc.Basic DSA | Hard |
| ๐ | 2263. Make Array Non-decreasing or Non-increasing | Misc.Dynamic Programming | Hard |
| ๐ | 465. Optimal Account Balancing | Dynamic ProgrammingBacktracking | Hard |
| ๐ | 2791. Count Paths That Can Form a Palindrome in a Tree | Depth-First SearchDynamic Programming | Hard |
| ๐ | 666. Path Sum IV | Depth-First Search | Medium |
| ๐ | 694. Number of Distinct Islands | Depth-First SearchBreadth-First SearchAdv. Data Structure | Medium |
| ๐ | 1530. Number of Good Leaf Nodes Pairs | Depth-First Search | Medium |
| ๐ | 403. Frog Jump | Dynamic Programming | Hard |
| ๐ | 1507. Reformat Date | Basic DSA | Easy |
| ๐ | 856. Score of Parentheses | Basic DSA | Medium |
| ๐ | 259. 3Sum Smaller | Two PointersBinary SearchBasic DSA | Medium |
| ๐ | 928. Minimize Malware Spread II | Depth-First SearchBreadth-First SearchAdv. Data StructureGraph | Hard |
| ๐ | 926. Flip String to Monotone Increasing | Dynamic Programming | Medium |
| ๐ | 924. Minimize Malware Spread | Depth-First SearchBreadth-First SearchAdv. Data StructureGraph | Hard |
| ๐ | 2290. Minimum Obstacle Removal to Reach Corner | Breadth-First SearchGraph | Hard |
| ๐ | 1062. Longest Repeating Substring | Binary SearchDynamic ProgrammingAdv. Data Structure | Medium |
| ๐ | 159. Longest Substring with At Most Two Distinct Characters | Two Pointers | Medium |
| ๐ | 1010. Pairs of Songs With Total Durations Divisible by 60 | Basic DSA | Medium |
| ๐ | 395. Longest Substring with At Least K Repeating Characters | Misc.Two Pointers | Medium |
| ๐ | 93. Restore IP Addresses | Backtracking | Medium |
| ๐ | 1293. Shortest Path in a Grid with Obstacles Elimination | Breadth-First Search | Hard |
| ๐ | 815. Bus Routes | Breadth-First Search | Hard |
| ๐ | 2217. Find Palindrome With Fixed Length | Basic DSA | Medium |
| ๐ | 772. Basic Calculator III | Backtracking | Hard |
| ๐ | 935. Knight Dialer | Dynamic Programming | Medium |
| ๐ | 767. Reorganize String | Misc.Basic DSA | Medium |
| ๐ | 1405. Longest Happy String | Misc. | Medium |
| ๐ | 886. Possible Bipartition | Depth-First SearchBreadth-First SearchAdv. Data StructureGraph | Medium |
| ๐ | 1345. Jump Game IV | Breadth-First Search | Hard |
| ๐ | 1541. Minimum Insertions to Balance a Parentheses String | Misc. | Medium |
| ๐ | 468. Validate IP Address | Basic DSA | Medium |
| ๐ | 2050. Parallel Courses III | GraphDynamic Programming | Hard |
| ๐ | 2506. Count Pairs Of Similar Strings | Basic DSA | Easy |
| ๐ | 200. Number of Islands | Depth-First SearchBreadth-First SearchAdv. Data Structure | Medium |
| ๐ | 642. Design Search Autocomplete System | Depth-First SearchAdv. Data StructureBasic DSA | Hard |
| ๐ | 895. Maximum Frequency Stack | Adv. Data Structure | Hard |
| ๐ | 146. LRU Cache | Basic DSA | Medium |
| ๐ | 1011. Capacity To Ship Packages Within D Days | Binary Search | Medium |
| ๐ | 1382. Balance a Binary Search Tree | Misc.Depth-First Search | Medium |
| ๐ | 787. Cheapest Flights Within K Stops | Depth-First SearchBreadth-First SearchGraphDynamic Programming | Medium |
| ๐ | 556. Next Greater Element III | Two Pointers | Medium |
| ๐ | 456. 132 Pattern | Binary SearchAdv. Data StructureMisc. | Medium |
| ๐ | 947. Most Stones Removed with Same Row or Column | Depth-First SearchAdv. Data StructureGraph | Medium |
| ๐ | 2115. Find All Possible Recipes from Given Supplies | Graph | Medium |
| ๐ | 993. Cousins in Binary Tree | Depth-First SearchBreadth-First Search | Easy |
| ๐ | 68. Text Justification | Simulation | Hard |
| ๐ | 528. Random Pick with Weight | Binary SearchTwo Pointers | Medium |
| ๐ | 210. Course Schedule II | Depth-First SearchBreadth-First SearchGraph | Medium |
| ๐ | 378. Kth Smallest Element in a Sorted Matrix | Binary SearchBasic DSA | Medium |
| ๐ | 381. Insert Delete GetRandom O(1) - Duplicates allowed | Basic DSA | Hard |
Sign up for free to track your progress, then upgrade to Pro for all 61 questions with detailed solutions.
Sign Up FreeAt TikTok, the interview process begins with resume screening to evaluate candidates' backgrounds and key skills relevant to the role. Following this, applicants might need to complete Online Assessments (OAs) which primarily focus on coding abilities and problem-solving skills.
Candidates who successfully pass these initial stages typically move on to one or two phone screens, and if these are successful, are invited to onsite rounds. The onsite typically consists of multiple technical interviews that assess coding expertise, algorithm knowledge, and system design skills. The difficulty level is considered to be high, aiming to ensure candidates can handle the fast-paced and innovative environment at TikTok.
TikTok's initial screening involves a meticulous review of resumes, focusing on relevant skills and experience in mobile and platform engineering. Around 20% of applicants advance to the next stage.
Successful candidates are then invited to complete an Online Assessment (OA), which tests coding proficiency and problem-solving skills. About 10% of those taking the OA move forward to preliminary screening calls.
At TikTok, the interview process usually begins with a phone screen. Typically, there is one phone screening stage, aimed at gauging the candidate's technical skills and suitability for the role. This conversation often involves coding challenges and problem-solving questions.
The phone screen also serves as an opportunity for candidates to demonstrate their understanding of TikTok's technology stack and how they can contribute to ongoing projects. Itโs a crucial step to make a strong first impression and set the stage for subsequent interviews.
At TikTok's onsite rounds, candidates typically undergo four to five interviews, encompassing a mix of coding, system design, and behavioral assessments. Each segment meticulously evaluates both technical proficiency and cultural fit, ensuring a holistic view of the applicant's capabilities.
The interviews are conducted back-to-back over the course of a single day. This rigorous schedule includes coding challenges on whiteboards, discussions on system architecture, and conversations aimed at discerning the candidateโs problem-solving approach and teamwork skills.
At TikTok, once interviews are completed, successful candidates may meet with senior executives before receiving an offer. The final stage includes negotiations for compensation and team matching, depending on the role and department.

When gearing up for a software engineering interview at TikTok, it's beneficial to concentrate on mastering Breadth-First Search and Depth-First Search, as these problem patterns are particularly prevalent. Additionally, proficient understanding of Advanced Data Structures can set candidates apart, showcasing their ability to handle more complex scenarios. Expect a comprehensive set of algorithmic questions, as TikTok is a competitive tech giant.
Describe a project where you had to use both your coding skills and your creativity.
Tell me about a time when you had to learn a new tool or technology quickly to complete a project.
Can you give an example of how you have handled a conflict within your development team?
Describe a time when you had to collaborate on a project with multiple teams. What was the role you played, and how did you ensure the project's success?
Can you give an example of how you have handled a disagreement within a software development team?
TikTok prides itself on innovation and user engagement. Tell us about a time when you found a creative solution to enhance user experience in a collaborative project.
Describe a project where you had to implement machine learning algorithms. How did you ensure the accuracy and efficiency of your model?
How do you keep yourself updated with the latest trends and technologies in software engineering and how have you applied this knowledge in your previous roles?
TikTok values innovation in creating engaging user experiences. Can you share an experience where you developed or contributed to a project that significantly improved user engagement?