#Linked List

Explain how to flatten a linked list, which is a list of linked lists, into a single linked list. Discuss your approach, challenges faced, and how you would implement this in your code.

Explain your approach to solving problems related to linked lists. What are the common operations you can perform on a linked list and their time complexities?

Implement an algorithm to detect a cycle in a linked list. You can use Floyd’s Tortoise and Hare algorithm for this purpose. If a cycle exists, return true; otherwise, return false.

Write a function to reverse a singly linked list. The function should take the head of the list as input and return the new head after reversal. For example, given the list 1 -> 2 -> 3 -> NULL, it should return 3 -> 2 -> 1 -> NULL.

Outline the steps needed to merge two linked lists that are sorted in ascending order.