SIXT

Role: Software Developer (Implied)

College: Not Specified

Interview Date: September 2025

Interview Type: Not Specified (First Interview)

Result: Not Specified

Difficulty: Medium

Rounds: 1 (First interview experience described)

Topics Asked: Projects, Data Structures, Algorithms

Experience:

This is a personal account of a first interview experience with Sixt. The candidate felt a mix of relief and motivation after the interview.

The interviewer started by asking about one of the projects listed on the candidate's resume.

Then, the Data Structures and Algorithms part began with the following questions:

• Linked List Deletion Problem: "If I have a singly linked list with a million nodes, and I'm given a pointer to the node that needs to be deleted (no head node is given, and the list has no cycle), how do you delete the node?"
  • Key Insight: Copy data from the next node into the current node and then delete the next node.
• Design O(1) Functions Without Hash Maps: "Implement insert(i), delete(i), search(i), and get(i) functions in O(1) time complexity. You cannot use a hash map, hash set, or other obvious data structures. Which data structure would you use?"
  • This was described as a challenging question that made the candidate think about alternative structures like direct addressing tables or a combination of arrays with linked lists for amortized O(1) operations.

The overall experience was eye-opening, providing clarity on current standing and areas for future preparation.