SIXT

Role: SDE-1

College: Not Specified

Interview Date: July 2025

Interview Type: Not Specified (Full-Time)

Result: Rejected

Difficulty: Not Specified

Rounds: 5 rounds

Topics Asked: OS, DSA, Projects, Graphs, OOPs (Polymorphism), DBMS (Full Outer Join), OS (Deadlock)

Experience:

This candidate interviewed for an SDE-1 position at Sixt. The experience describes 5 rounds, but the candidate did not qualify for the HR round.

Round 1: Coding Round

• Technical questions on topics like OS, DSA.
• Coding questions asked:
  1. Queries problem (easy): Given two arrays, Array1 (multidimensional) and Queries array (contains an array of L, R of many queries: Eg: [...]), the problem was to do a certain operation from L(left index) to R (right index) in a given array (multi-dimensional) and return the array of answers for all the queries.
  2. Multiverse (medium-hard): Given an array of elements, the problem was to find the next Multiverse-greater element of every element in the array. However, the Multiverse-greater is a number that has the sum of digits greater than the sum of digits of another number.
  3. Romans standing in a circle, the first person kills the 2nd person and gives the knife to the 3rd, the 3rd kills the 4th and gives it to the 5th, the 5th kills the 6th and gives it to the 1st and so on. The candidate was asked to write the mathematical equation to calculate the last person alive given N (number of people standing circularly).

Round 2: Technical Interview

• Questions were asked on the candidate's final year project.

Rounds 3 and 4: Technical and Managerial

• Asked coding questions on graphs and projects.
• Questions on Polymorphism, Full Outer Join, and Deadlock were also asked.

Round 5: HR Round

• Candidate could not qualify for this round.