Placement Preparationan HCL GUVI product
21. Merge K Sorted Linked Lists
Required Input:
1 4 5
1 3 4
2 6
Expected Output:
1 1 2 3 4 4 5 6 Code In Python
import heapq
class Node:
def __init__(self, data):
self.data = data
self.next = None
def merge_k_lists(lists):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
22. Intersection of Two Sorted Circular Linked Lists
Required Input:
1 2 3 4
2 4 6
Expected Output:
{2, 4}
Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def find_common(head1, head2):
# write your logic here
Run Code?
Click Run Button to view compiled output
23. Detect and Remove a Cycle in a Linked List
Required Input:
1 2 3 4 5 (cycle at node 3)
Expected Output:
1 2 3 4 5 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def detect_and_remove_cycle(head):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
24. Segregate Even and Odd Nodes
Required Input:
1 2 3 4 5 6
Expected Output:
1 3 5 2 4 6 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def segregate_even_odd(head):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
25. Move Last Node to Front
Required Input:
1 2 3 4 5
Expected Output:
5 1 2 3 4 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def move_last_to_front(head):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
