Blog

To insert a new node after a given node value in a linked list, you can follow these steps: Here’s an example Kotlin code to insert a new node after a given node value in a linked list: The Node class represents a single node in the linked list, and has two properties: The LinkedList … Read more

Approach for inserting a new node before a given node value in a linked list: To insert a new node before a given node value in a linked list, Here’s an example Kotlin code: Here’s a step-by-step explanation of the insertBefore method in the Kotlin code I provided earlier, which inserts a new node before … Read more

To find the first and last index of the same element in a sorted array, we can use a modified binary search algorithm. Here are the steps: The time complexity of this algorithm is O(log n), where n is the number of elements in the array, since we are performing a binary search twice. The … Read more

To reverse a linked list in groups, you can follow these steps: here’s Kotlin code to reverse a linked list in groups : In the main function, we create a linked list with six nodes and call the reverseInGroups function to reverse the nodes in groups of size 2. The newHead variable is assigned the … Read more

What is Loop in Linked List ? In a linked list, a loop occurs when there is a cycle in the nodes that creates an infinite loop. A loop can occur if a node points to a previous node in the list or if multiple nodes point to the same node in the list. Here’s … Read more

To move the last element of a linked list to the front, you can follow these steps: Here’s an implementation of this algorithm in Kotlin: Step-by-step explanation of the moveLastToFront function: The time complexity of the moveLastToFront function is O(n), where n is the number of nodes in the linked list. This is because we … Read more

To add 1 to a number represented as a linked list, we can traverse the linked list from the end (i.e., the least significant digit) to the beginning (i.e., the most significant digit), and perform the following steps: If we reach the beginning of the list and we still need to carry over 1, we … Read more

To add two numbers represented by linked lists, you can follow these steps: Lets assume the Linked List representation in opposite order : l1 : 342 and l2 : 465 and we get : 807 In the main function, we create two input linked lists and pass them to addTwoNumbers, then print out the values … Read more

To find the intersection of two sorted linked lists, you can use a two-pointer approach where you traverse both linked lists simultaneously and compare the values at each node. Here’s a step-by-step guide: Kotlin code for finding the intersection of two sorted linked lists: Time complexity: Space complexity:

To create a doubly linked list from a binary tree, we can use a modified depth-first search (DFS) algorithm to traverse the binary tree and create a doubly linked list. Here are the steps to create a doubly linked list from a binary tree: Traversing the binary tree in-order using DFS yields the sequence 4, … Read more