Envié una solicitud electrónica. El proceso duró 1 día. Acudí a una entrevista en Travelfusion (Shanghái, Shanghai) en jun 2025
Entrevista
First take part in paper test for java and then do the exam on the computer and then interview with technology interviewer for the paper test and computer test and then interview with the hr interviewer and finally chat with the director to take up a comprehensive interview and then over the full interview.
Envié una solicitud electrónica. El proceso duró 5 días. Acudí a una entrevista en Travelfusion en jun 2025
Entrevista
The HR reaches out via an email asking you questions about your location & your coding level. Afterwards, they give you an online coding test and they ask you to complete it. Overall, if you haven't studied data structures & leet code it is going to hard.
Envié una solicitud electrónica. El proceso duró 5 días. Acudí a una entrevista en Travelfusion en jul 2024
Entrevista
Online programming test with 2 questions testing algorithmic knowledge. The test was performed through an automated system called testdome, which monitors you during the test (screensharing and camera), generally a positive experience. Each question has a time limit of 30 minutes to complete, and it also has an embedded solution tester to verify the correct answer.
Preguntas de entrevista [2]
Pregunta 1
The first question was about a given number of items, and 2 types of packages, first one could carry 5 items and the second only 1 and the question was: What is the minimal number of packages required to carry all the items with given number of packages? So you actually had 3 parameters, the number of items, the number of large packages and small packages and you should have returned the minimal packages that could carry the items. If the packages were not enough to carry the items the function should return -1. There was a static function ready to populate.
The second question was about the height of a binary tree. There was a Node class given with 2 Node children left and right, and a simple binary tree with 4 members including the root.
