Reorder List at Arista Networks
Medium64.6% acceptance
This problem has 87.5% frequency at Arista Networks.
Problem Description
You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln _Reorder the list to be on the following form:_ L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → … You may not modify the values in the list's nodes. Only nodes them...
Read full problem and hintsTopics
Also asked at 16 companies
More Arista Networks Questions
Reverse Nodes in k-GroupHardReverse Linked List IIMediumRemove Linked List ElementsEasyCopy List with Random PointerMediumRemove Duplicates from Sorted List IIMedium
View all Arista Networks questions