EmbeddedInterviewLab
Topics
Interview
Coding
Toggle menu
Start Learning
All Problems
Reorder List
Medium
•
linked-list
•
Expected: O(n) time, O(1) space
•
Interview Context
linked-list
Problem
Given a singly linked list L0→L1→...→Ln, reorder it to L0→Ln→L1→Ln-1→... in-place.
Show Reference Solution
Language:
C++
C
Submit
Loading...