Fold Linked List
Detailed guide and Python implementation for the 'Fold Linked List' problem.
Problem Statement
Write a function fold_list(arr) that represents a singly linked list as a Python list arr and returns the folded list. Folding a list L0 -> L1 -> ... -> Ln-1 -> Ln results in L0 -> Ln -> L1 -> Ln-1 -> L2 -> Ln-2 ....
- •0 <= len(arr) <= 1000
- •-1000 <= arr[i] <= 1000
Examples
arr = [1, 2, 3, 4, 5]
[1, 5, 2, 4, 3]
The nodes are reordered by interleaving the first, last, second, second-to-last nodes, etc.
arr = [1, 2, 3, 4]
[1, 4, 2, 3]
Need a Hint?
Edge Cases to Watch
- Empty input structures
- Single element inputs
- Large numerical bounds
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.
Recommended Python Resources
Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.
Python Lists
Learn everything about Python lists. Discover how to create, slice, modify, and iterate through arrays in Python natively.
How to Sort a List in Python
Learn how to sort a list in Python using the sort() method and the sorted() function. Discover custom key sorting and reverse order examples.
Python List Methods
Quick reference guide for Python list operations. Master appending, inserting, removing, sorting, and slicing elements.
Python vs JavaScript: Which Programming Language is Best?
A comprehensive comparison between Python and JavaScript. Explore syntax differences, performance, use cases (backend vs frontend), and coding examples.