LeetCode - Blind 75 - Reorder List

The Problem 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 in the following form: L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → … You may not modify the values in the list’s nodes. Only the nodes themselves may be changed. ...

December 23, 2024 · 3 min · Dmytro Chumakov