Placement Preparationan HCL GUVI product
11. Delete a Node at a Given Position
Required Input:
1 2 3 4 5
2
Expected Output:
1 2 4 5 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def delete_at_position(head, pos):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
12. Reverse Nodes in k-Groups
Required Input:
1 2 3 4 5
3
Expected Output:
3 2 1 5 4 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def reverse_k_group(head, k):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
13. Flatten a Multi-Level Linked List
Required Input:
1 2 3
2->4 5
Expected Output:
1 2 4 5 3 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def flatten(head):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
14. Rotate a Linked List by K Places
Required Input:
1 2 3 4 5
2
Expected Output:
4 5 1 2 3 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def rotate_right(head, k):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
15. Swap Nodes in Pairs
Required Input:
1 2 3 4
Expected Output:
2 1 4 3 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def swap_pairs(head):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
16. Add Two Numbers Represented as Linked Lists
Required Input:
2 4 3
5 6 4
Expected Output:
7 0 8 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def add_two_numbers(l1, l2):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
17. Sort a Linked List (Merge Sort Approach)
Required Input:
4 2 1 3
Expected Output:
1 2 3 4 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def sort_list(head):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
18. Clone a Linked List with Random Pointers
Required Input:
1 2 3
3 1 2
Expected Output:
Node: 1, Random: 3
Node: 2, Random: 1
Node: 3, Random: 2
Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def clone_random_list(head):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
19. Reverse a Linked List in Groups of Alternating Sizes
Required Input:
1 2 3 4 5 6 7 8 9
2 3
Expected Output:
2 1 5 4 3 6 7 8 9 Code In Python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def reverse_alternate_groups(head, groups):
# Write your logic here
pass
Run Code?
Click Run Button to view compiled output
20. LRU Cache Implementation Using Linked List
Required Input:
put(1,1)
put(2,2)
get(1)
put(3,3)
get(2)
Expected Output:
1
-1
Code In Python
class Node:
def __init__(self, key, val):
self.key = key
self.val = val
self.prev = self.next = None
class LRUCache:
def __init__(self, capacity):
pass
def get(self, key):
pass
def put(self, key, value):
pass
Run Code?
Click Run Button to view compiled output