Skip to content

Tag Archives: Linked Lists

Write a function detectAndCountLoop() that checks whether a given Linked List contains loop and if loop is present then returns count of nodes in loop.… Read More
Write a function detectAndCountLoop() that checks whether a given Linked List contains loop and if loop is present then returns count of nodes in loop.… Read More
Write a function detectAndCountLoop() that checks whether a given Linked List contains loop and if loop is present then returns count of nodes in loop.… Read More
Given a linked list A[] of N integers, the task is to reverse the order of all integers at an even position. Examples: Input: A[]… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL Output: 2->1->4->3->5->NULL Input: 1->NULL Output: 1->NULL  For example, if the… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL Output: 2->1->4->3->5->NULL Input: 1->NULL Output: 1->NULL For example, if the… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL For… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL  For… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL Output: 2->1->4->3->5->NULL Input: 1->NULL Output: 1->NULL For example, if the… Read More
Given a singly linked list, write a function to swap elements pairwise. Input: 1->2->3->4->5->6->NULL  Output: 2->1->4->3->6->5->NULL Input: 1->2->3->4->5->NULL  Output: 2->1->4->3->5->NULL Input: 1->NULL  Output: 1->NULL For… Read More
Write a function that searches a given key ‘x’ in a given singly linked list. The function should return true if x is present in… Read More

Start Your Coding Journey Now!