ByteDance TikTok 2026 Internship Online Test Experience and Solutions

This post was last edited by vul3su4 on 2025-10-02 17:47 VIP is about to expire, please add points Just a little short to see interview experiences Codesignal exam 1 hour 10 minutes, 4 questions, webc

This post was last edited by vul3su4 on 2025-10-02 17:47 VIP is about to expire, please add points Just a little short to see interview experiences Codesignal exam 1 hour 10 minutes, 4 questions, webcam access, screen sharing 4 questions, 300 points per question while writing Total 1200 points, converted to 600 after submission Please add points, please add points, thank you The following content requires points higher than 180. You can already view it Q1: Very simple, I forgot a bit. Bruce Force, finished in 5 minutes Q2: Reverse prefix/suffix, find the lexicographically smallest string ex: For w = "dbaca" The output should be solution(w) = "abdca" For example: Reversing the first 1 character → "dbaca" Reversing the first 2 characters → "bdaca" Reversing the first 3 characters → "adbca" Copy code … Finally, the smallest "abdca" is obtained Copy code Q3: m x n Matrix Maze Given a maze of size n x m, starting at the top left corner (0,0) and ending at the bottom right corner [-1][-1]. There are also obstacles (inaccessible cells) and teleports (in the form [start_row, start_col, end_row, end_col]). Movement rules: You start at (0,0) and always move right to (row, col+1). If the cell you land on is the starting point of a teleport, you are immediately teleported to the corresponding ending cell. If the cell you land on is an obstacle or is outside the boundary, stop and return -1 (indicating that you are blocked and cannot reach the destination). If you cannot reach the destination due to the teleport loop,

return -2 (indicating that you are trapped in an infinite teleport loop). If you successfully reach (n-1, m-1),

return the number of all cells visited (including the starting point, ending point, and the starting and ending points of all portals). Q4: Count Prefixes For t = ["abc","a","a","b","ab","ac"] The output should be solution(t) = 8 Explanation: Possible prefix pairs are: "abc" and "a" "abc" and another "a" "abc" and "ab" and "a" and another "a" and "ab" and "ac" another "a" and "ab" ...A total of 8 pairs.