TuSimple Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 152 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at TuSimple.
TuSimple
Software Engineer
Mid Difficult Neutral experience No offer 5 rounds
Interview process
Technical screen Technical screen Technical screen Technical screen
Interview formats
Coding Technical
So, we had one video interview to kick things off, then four more rounds. Three of those were coding rounds, and one was a chat with the hiring manager. Each round was about an hour long. They didn't really care what programming language you used, but expect some tough leetcode-style problems, like medium to hard difficulty.
Confirmed questions5 questions
- Can you explain concepts related to graphs?
- How would you implement Depth-First Search (DFS)?
- How would you implement Breadth-First Search (BFS)?
TuSimple
Software Engineer
Entry Average Positive experience Accept offer 7 rounds
Interview process
Take home Phone screen Onsite
Interview formats
Technical Coding Behavioral
The interview experience was pretty smooth. It began with an online assessment (OA), then two phone interview rounds, and finished with a four-round onsite. The waiting time between the OA and the first phone interview was a bit long, about a month, but after that things moved quickly. All the interviewers were friendly and seemed well-prepared. They really dug into the details of my past experience.
Confirmed questions3 questions
- Could you tell me about your experience with algorithms and data structures?
- Do you have any fundamental Computer Science knowledge?
- Can you explain how database storage works?
TuSimple
Software Engineer Intern
Intern Difficult Positive experience Accept offer 2 rounds
Interview process
Recruiter call Take home Technical screen Onsite
Interview formats
Coding Behavioral Technical
I applied online and then got invited to do a HackerRank online assessment. After I passed that, I had my first round of interviews, and then the second round happened not too long after my first round interviewer sent in their feedback. The recruiting team, Bri and Kim, made the whole process really easy to get through and were super quick to help with any questions, concerns, or accommodations. The interviewers were nice and knew their stuff, only giving help when it was really needed. I also got to chat with the hiring managers, which gave me good insights into what their teams are like and the types of problems I'd be learning and working on during my internship. All in all, the recruiting team's work, the good interview experience, learning about the team/role, and the interesting, important work at TuSimple made me accept 's offer even though I had a really good competing offer. Big thanks to Bri and Kim for everything. They really made a great first impression of TuSimple.
Confirmed questions4 questions
- Standard behavioral questions were asked.
- Questions about data structures were asked.
- Questions about algorithms were asked.
TuSimple Software Engineer Interview Questions
Quoted word for word from TuSimple interview reports.
“Given a list of sorted, duplicate-free iterators and a threshold k, implement an iterator that returns elements appearing at least k times.”
Read reports →“Can you devise a polynomial time algorithm to check if two trees are isomorphic?”
Read reports →“Given two alphabet strings, str1 and str2, determine the minimum number of operations to transform str1 into str2. In each operation, all occurrences of a specific character in str1 must be changed to another character simultaneously. You can also use a special character '*' to represent any alphabet character, meaning you can change alphabet characters to '*' or change '*' to a specific character. If the transformation is impossible, return -1. Example: str1: accs, str2: eeec -> 3 operations. str1: accs, str2: efec -> -1. str1: abb, str2: baa -> 3 operations.”
Read reports →“What are the shortest paths between several pairs of nodes in an N-ary tree?”
Read reports →“How can you construct a balanced binary search tree from a sorted linked list?”
Read report →“Can you count the number of islands with different shapes in a graph?”
Read report →“Can you determine if a given set of edges forms a valid tree in a graph?”
Read report →“Given a path of integer points, how would you divide it into k equal segments and identify the endpoints of each segment?”
Read report →“How would you construct a binary search tree from level order traversal?”
Read report →Formats, difficulty and experience
Across all 152 TuSimple interview reports.