Linked List

Determine whether a singly-linked list loops back on itself instead of ending in null.

Splice two sorted singly-linked lists together into a single sorted list.

Find the value stored in the middle node of a singly-linked list in a single pass.

Given an array nums, you can perform the following operation any number of times: Return the minimum number of operations needed to make the array non-decreasing.

Check whether the values in a singly-linked list read the same forwards and backwards.

Collapse consecutive duplicate values in a sorted singly-linked list so each value appears once.

Delete every node in a singly-linked list whose value matches a given target.

Reverse a singly-linked list in place and return the reversed list.

Add two non-negative integers stored as reverse-order digit linked lists and return the sum in the same format.

Regroup a singly-linked list so all odd-positioned nodes come before all even-positioned nodes.

Stably rearrange a linked list so every node less than a pivot value comes before every node greater than or equal to it.

Remove the node that sits n positions from the end of a singly-linked list, then return the list.

Rearrange a singly-linked list by alternating nodes from the front and the back until they meet in the middle.

Rotate a singly-linked list to the right by k places, wrapping around as needed.

You are given a 0-indexed integer array nums.

Swap every two adjacent nodes in a singly-linked list and return the new head.

Merge k independently sorted linked lists into a single sorted linked list.

Given an array nums, you can perform the following operation any number of times: Return the minimum number of operations needed to make the array non-decreasing.