Linkedlist

You are given the head of a singly linked-list.

list.

Write a function to **delete a node** in a singly-linked list.

which the two lists intersect.

Given the `head` of a linked list, return the list after sorting it in **ascending order**.

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

Given `head`, the head of a linked list, determine if the linked list has a cycle in it.

random pointer, which could point to any node in the list, or `null`.

You are given an array of `k` linked-lists `lists`, each linked-list is sorted in ascending order.

Given the head of a linked list, remove the nth node from the end of the list and return its head.