Software Development Engineer 2
Reverse Linked List in K Groups
Implement a function to reverse a linked list in groups of size k. For example, given the linked list A → B → C → D → E and k = 2, the output should be B → A → D → C → E. If the remaining nodes are less than k, they should remain unchanged.
This question was asked in
Uber Software Development Engineer 2 Interview Experience
The interview experience with Uber consisted of four distinct rounds, covering various topics such as data structures and algorithms, low-level design, and high-level design. Participants faced questions like Reverse Linked List and designing a service for Uber Eats aimed at train travelers. Overall, the difficulty level was moderate, with a mix of technical challenges and design discussions that provided insights into the expectations for candidates.