#Linked List

How do you detect a cycle in a linked list using Floyd's Algorithm?

You are given the head of a linked list and an integer array nums. Return the number of connected components formed by nodes whose values appear in nums. Example: Input: head = [0,1,2,3], nums = [0,1,3] → Output: 2

Explain how to convert a sorted linked list into a height-balanced binary search tree (BST). Discuss your approach and the time complexity involved.

Given a linked list `1 → 2 → 3 → 4 → 5`, reverse the nodes in pairs to obtain `2 → 1 → 4 → 3 → 5`.

Reverse a linked list in pairs. For example, given the input 1 → 2 → 3 → 4 → 5, the output should be 2 → 1 → 4 → 3 → 5.