Problem-02: Reverse a Linked List in groups of given size. Given a singly linked list, reverse the linked list in groups of size k. For example, if the given linked list is: 10→20→30→40→50→60→NULL and k = 3 then the output list should be 30→20→10→60→50→40→NULL. Or if the given linked list is: 10→20→30→40→50–→60→70 →80→ NULL and k = 3 then the output list should be 30→20→10→60→50→40→80→70→NULL. [It should be workable if user change the length of the Linked list]

If a Stack is most optimally derived from a Singly Linked List, which node of the Linked List should be pointed to or will be referred to as the Top of the stack and why?

Given two (singly) linked lists, determine if the two lists intersect. Return the intersecting node. Note that the intersection is defined based on reference, not value. That is, if the kthnode of the first linked list is the exact same node (by reference) as the jth node of the secondlinked list, then they are intersecting.