Given a singly linked list node, reorder it such that we take: the last node, and then the first node, and then the second last node, and then the second node, etc.
Can you do it in \(\mathcal{O}(1)\) space?
Constraints
0 ≤ n ≤ 100,000 where n is the number of nodes in nodehttps://binarysearch.com/problems/Back-to-Front-Linked-List
Input
Output
You are given a singly linked list node and an integer k. Order the linked list so that all nodes whose values are less than k come first, all nodes whose va...
Given a singly linked list node, and integers i and j, reverse the linked list from i to jth nodes, 0 indexed and inclusive.
Given a singly linked list node, and an integer k, reverse every k contiguous group of nodes.
Given a singly linked list node, and an integer target, delete the last occurrence of target in node.
Leave a comment