Given a pointer to the head node of a linked list, reverse the linked list and print reversed list

example:

Input: Head of following linked list 1->2->3-null

Output: Linked list should be changed to, 3->2->1->null

Google

Software Engineer

Microsoft

Nagarro

Backend Developer

MakyMyTrip

Amazon

Full Stack Developer

Reverse a Linked List

Checks whether a given Linked List contains a loop and if the loop is present then remove the loop and return true. if no loop present return false

Senior Software Engineer

Samsung

How to Detect and Remove Loop in a Linked List

Given a linked list consisting of L nodes and given a number N. The task is to find the Nth node from the end of the linked list.

Input:
n = 3
LinkedList: 1->2->3->4->5->6->7->8->9
Output: 7

Find nth node from end of linked list

Given a singly linked list L, delete middle of the linked list. 

Example:
Linked list 1->2->3->4->5 then linked list should be modified to 1->2->4->5.

Linked list 1->2->3->4->5->6 then linked list should be modified to 1->2->3->5->6.

Delete Middle of Linked List

Given a singly linked list, The task is to rotate the linked list counter-clockwise by k nodes.

Input: linked list = 10->20->30->40->50->60, k = 4

Output: 50->60->10->20->30->40. 

Rotate a Linked List

Given a singly linked list of characters, write a function that returns true if the given list is a palindrome, else false.

Input: S->U->D->U->S->NULL
Output: Yes

Input: B->I->G->O->NULL
Output: No

Top Linked List Interview Questions

1. Reverse a Linked List

2. How to Detect and Remove Loop in a Linked List

3. Find nth node from end of linked list

4. Delete Middle of Linked List

5. Rotate a Linked List

6. Check if a singly linked list is palindrome