Print nodes of linked list at given indexes
Last Updated :
26 Aug, 2024
Given head of two singly linked lists, first one is sorted and the other one is unsorted. The task is to print the elements of the second linked list according to the position pointed out by the data in the first linked list. For example, if the first linked list is 1->2->5, then you have to print the second linked list’s 1st, 2nd and 5th node’s data.
Note: All the position (represented by each node of sorted linked list) will be exist in the unsorted linked list.
Examples:
Input: head1 = 1->2->5, head2 = 1->8->7->6->2->9->10
Output : 1->8->2
Explanation: Elements in head1 are 1, 2 and 5. Therefore, print 1st, 2nd and 5th elements of l2,Which are 1, 8 and 2.
Input: head1 = 2->5, head2 = 7->5->3->2->8
Output: 5->8
[Naive Approach]: Using Nested Loops – O(n2) Time and O(1) Space:
The idea is to use two nested loops to traverse two linked lists. The outer loop traverses the first list, while the inner loop traverses the second list until a specific position is reached, printing the data at that position.
Step-by-step approach:
- Initialize two pointers, current1 (for the first list) and current2 (for the second list).
- Loop through current1 until it is nullptr.
- For each node in the first list, use a nested loop to traverse the second list until reaching the position indicated by current1->data.
- Print the data of the node at the current position in the second list.
- Reset current2 to the head of the second list after each outer loop iteration.
Below is the implementation of the above approach:
C++
// C++ program to print second linked list
// according to data in the first linked list
#include <iostream>
using namespace std;
class Node {
public:
int data;
Node* next;
Node(int x) {
data = x;
next = nullptr;
}
};
// Function to print the second list according
// to the positions referred by the 1st list
void printSecondList(Node* head1, Node* head2) {
Node* current1 = head1;
Node* current2 = head2;
// While first linked list is not null
while (current1 != nullptr) {
int i = 1;
// While second linked list is not equal
// to the data in the node of the first linked list
while (i < current1->data) {
// Keep incrementing second list
current2 = current2->next;
i++;
}
// Print the node at position in second list
// pointed by current element of first list
cout << current2->data << " ";
// Increment first linked list
current1 = current1->next;
// Set temp1 to the start of the second linked list
current2 = head2;
}
}
int main() {
// create 1st list: 2 -> 5
Node* head1 = new Node(2);
head1->next = new Node(5);
// create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
Node* head2 = new Node(4);
head2->next = new Node(5);
head2->next->next = new Node(6);
head2->next->next->next = new Node(7);
head2->next->next->next->next = new Node(8);
printSecondList(head1, head2);
return 0;
}
// C program to print second linked list
// according to data in the first linked list
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
// Function to print the second list according
// to the positions referred by the 1st list
void printSecondList(struct Node* head1, struct Node* head2) {
struct Node* current1 = head1;
struct Node* current2 = head2;
// While first linked list is not null
while (current1 != NULL) {
int i = 1;
// While second linked list is not equal
// to the data in the node of the first linked list
while (i < current1->data) {
// Keep incrementing second list
current2 = current2->next;
i++;
}
// Print the node at position in second list
// pointed by current element of first list
printf("%d ", current2->data);
// Increment first linked list
current1 = current1->next;
// Set temp1 to the start of the second linked list
current2 = head2;
}
}
struct Node *createNode(int data)
{
struct Node *newNode =
(struct Node *)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
int main() {
// create 1st list: 2 -> 5
struct Node* head1 = createNode(2);
head1->next = createNode(5);
// create 2nd list
// 4 -> 5 -> 6 -> 7 -> 8
struct Node* head2 = createNode(4);
head2->next = createNode(5);
head2->next->next = createNode(6);
head2->next->next->next = createNode(7);
head2->next->next->next->next = createNode(8);
printSecondList(head1, head2);
return 0;
}
// Java program to print second linked list
// according to data in the first linked list
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
this.next = null;
}
}
class GfG {
// Function to print the second list according
// to the positions referred by the 1st list
static void printSecondList(Node head1, Node head2) {
Node current1 = head1;
Node current2 = head2;
// While first linked list is not null
while (current1 != null) {
int i = 1;
// While second linked list is not equal
// to the data in the node of the first linked list
while (i < current1.data) {
// Keep incrementing second list
current2 = current2.next;
i++;
}
// Print the node at position in second list
// pointed by current element of first list
System.out.print(current2.data + " ");
// Increment first linked list
current1 = current1.next;
// Set temp1 to the start of the second linked list
current2 = head2;
}
}
public static void main(String[] args) {
// create 1st list: 2 -> 5
Node head1 = new Node(2);
head1.next = new Node(5);
// create 2nd list
// 4 -> 5 -> 6 -> 7 -> 8
Node head2 = new Node(4);
head2.next = new Node(5);
head2.next.next = new Node(6);
head2.next.next.next = new Node(7);
head2.next.next.next.next = new Node(8);
printSecondList(head1, head2);
}
}
# Python3 program to prsecond linked list
# according to data in the first linked list
class Node:
def __init__(self, data):
self.data = data
self.next = None
# Function to print the second list according
# to the positions referred by the 1st list
def print_second_list(head1, head2):
current1 = head1
current2 = head2
# While first linked list is not null
while current1 is not None:
i = 1
# While second linked list is not equal
# to the data in the node of the first linked list
while i < current1.data:
# Keep incrementing second list
current2 = current2.next
i += 1
# Print the node at position in second list
# pointed by current element of first list
print(current2.data, end=" ")
# Increment first linked list
current1 = current1.next
# Set temp1 to the start of the second linked list
current2 = head2
# create 1st list: 2 -> 5
head1 = Node(2)
head1.next = Node(5)
# create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
head2 = Node(4)
head2.next = Node(5)
head2.next.next = Node(6)
head2.next.next.next = Node(7)
head2.next.next.next.next = Node(8)
print_second_list(head1, head2)
// C# program to print second linked list
// according to data in the first linked list
using System;
class Node {
public int data;
public Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class GfG {
// Function to print the second list according
// to the positions referred by the 1st list
public static void PrintSecondList(Node head1, Node head2) {
Node current1 = head1;
Node current2 = head2;
// While first linked list is not null
while (current1 != null) {
int i = 1;
// While second linked list is not equal
// to the data in the node of the first linked list
while (i < current1.data) {
// Keep incrementing second list
current2 = current2.next;
i++;
}
// Print the node at position in second list
// pointed by current element of first list
Console.Write(current2.data + " ");
// Increment first linked list
current1 = current1.next;
// Set temp1 to the start of the second linked list
current2 = head2;
}
}
public static void Main(string[] args) {
// create 1st list: 2 -> 5
Node head1 = new Node(2);
head1.next = new Node(5);
// create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
Node head2 = new Node(4);
head2.next = new Node(5);
head2.next.next = new Node(6);
head2.next.next.next = new Node(7);
head2.next.next.next.next = new Node(8);
PrintSecondList(head1, head2);
}
}
// JavaScript program to print second linked list
// according to data in the first linked list
class Node {
constructor(data) {
this.data = data;
this.next = null;
}
}
// Function to print the second list according
// to the positions referred by the 1st list
function printSecondList(head1, head2) {
let current1 = head1;
let current2 = head2;
// While first linked list is not null
while (current1 !== null) {
let i = 1;
// While second linked list is not equal
// to the data in the node of the first linked list
while (i < current1.data) {
// Keep incrementing second list
current2 = current2.next;
i++;
}
// Print the node at position in second list
// pointed by current element of first list
console.log(current2.data);
// Increment first linked list
current1 = current1.next;
// Set temp1 to the start of the second linked list
current2 = head2;
}
}
// create 1st list: 2 -> 5
let head1 = new Node(2);
head1.next = new Node(5);
// create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
let head2 = new Node(4);
head2.next = new Node(5);
head2.next.next = new Node(6);
head2.next.next.next = new Node(7);
head2.next.next.next.next = new Node(8);
printSecondList(head1, head2);
Time Complexity: O(n), To traverse the second linked list completely.
Auxiliary Space: O(1)
[Expected Approach]: Single-Pass List Traversal – O(m+n) Time and O(1) Space
The idea is to utilize the sorted order of the first list to traverse the second list more efficiently, reducing unnecessary comparisons by skipping irrelevant nodes.
Step-by-step approach:
- Initialize two pointers: current1 for the first list and current2 for the second list.
- For each node in the first list, retrieve its data as targetPos.
- Traverse the second list to the position indicated by targetPos.
- Print the data at that position if it exists.
Below is the implementation of the above approach:
C++
// C++ program to print second linked list
// according to data in the first linked list
#include <bits/stdc++.h>
using namespace std;
class Node{
public:
int data;
Node *next;
Node(int x){
data = x;
next = nullptr;
}
};
// Function to print the second list according
// to the positions referred by the 1st list
void printSecondList(Node *head1, Node *head2){
// Step 1: Traverse the second list with a pointer
Node *current2 = head2;
// Position index starts at 1
int currentPos = 1;
// Traverse the first linked list to get positions
Node *current1 = head1;
while (current1 != nullptr)
{
int targetPos = current1->data;
// Move the pointer in the second list to the target position
while (current2 != nullptr && currentPos < targetPos)
{
current2 = current2->next;
currentPos++;
}
// Print the node data if it matches the target position
if (current2 != nullptr && currentPos == targetPos)
cout << current2->data << " ";
// Move to the next node in the first list
current1 = current1->next;
}
cout << endl;
}
int main()
{
// create 1st list: 2 -> 5
Node *head1 = new Node(2);
head1->next = new Node(5);
// create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
Node *head2 = new Node(4);
head2->next = new Node(5);
head2->next->next = new Node(6);
head2->next->next->next = new Node(7);
head2->next->next->next->next = new Node(8);
printSecondList(head1, head2);
return 0;
}
// C program to print second linked list
// according to data in the first linked list
#include <stdio.h>
#include <stdlib.h>
struct Node
{
int data;
struct Node *next;
};
// Function to print elements of the second list based on positions
// from the first list
void printSecondList(struct Node *head1, struct Node *head2)
{
// Pointer to traverse the second list
struct Node *current2 = head2;
// Start position index at 1
int currentPos = 1;
// Pointer to traverse the first list
struct Node *current1 = head1;
while (current1 != NULL)
{
// Get the target position from the first list
int targetPos = current1->data;
// Move the pointer in the second list to the target position
while (current2 != NULL && currentPos < targetPos)
{
current2 = current2->next;
currentPos++;
}
// Print the node data if it matches the target position
if (current2 != NULL && currentPos == targetPos)
printf("%d ", current2->data);
// Move to the next node in the first list
current1 = current1->next;
}
printf("\n");
}
struct Node *createNode(int data)
{
struct Node *newNode = (struct Node *)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
int main()
{
// Create 1st list: 2 -> 5
struct Node *head1 = createNode(2);
head1->next = createNode(5);
// Create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
struct Node *head2 = createNode(4);
head2->next = createNode(5);
head2->next->next = createNode(6);
head2->next->next->next = createNode(7);
head2->next->next->next->next = createNode(8);
printSecondList(head1, head2);
return 0;
}
// Java program to print second linked list
// according to data in the first linked list
class Node {
int data;
Node next;
Node(int x){
data = x;
next = null;
}
}
class GfG {
// Function to print elements of the second list based
// on positions from the first list
static void printSecondList(Node head1, Node head2)
{
// Pointer to traverse the second list
Node current2 = head2;
// Start position index at 1
int currentPos = 1;
// Pointer to traverse the first list
Node current1 = head1;
while (current1 != null) {
// Get the target position from the first list
int targetPos = current1.data;
// Move the pointer in the second list to the
// target position
while (current2 != null
&& currentPos < targetPos) {
current2 = current2.next;
currentPos++;
}
// Print the node data if it matches the target
// position
if (current2 != null
&& currentPos == targetPos) {
System.out.print(current2.data + " ");
}
// Move to the next node in the first list
current1 = current1.next;
}
System.out.println();
}
public static void main(String[] args)
{
// Create 1st list: 2 -> 5
Node head1 = new Node(2);
head1.next = new Node(5);
// Create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
Node head2 = new Node(4);
head2.next = new Node(5);
head2.next.next = new Node(6);
head2.next.next.next = new Node(7);
head2.next.next.next.next = new Node(8);
printSecondList(head1, head2);
}
}
# Python program to print second linked list
# according to data in the first linked list
class Node:
def __init__(self, x):
self.data = x
self.next = None
def print_second_list(head1, head2):
# Pointer to traverse the second list
current2 = head2
# Start position index at 1
current_pos = 1
# Pointer to traverse the first list
current1 = head1
while current1:
# Get the target position from the first list
target_pos = current1.data
# Move the pointer in the second list to the target position
while current2 and current_pos < target_pos:
current2 = current2.next
current_pos += 1
# Print the node data if it matches the target position
if current2 and current_pos == target_pos:
print(current2.data, end=" ")
# Move to the next node in the first list
current1 = current1.next
print()
# Create 1st list: 2 -> 5
head1 = Node(2)
head1.next = Node(5)
# Create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
head2 = Node(4)
head2.next = Node(5)
head2.next.next = Node(6)
head2.next.next.next = Node(7)
head2.next.next.next.next = Node(8)
print_second_list(head1, head2)
using System;
class Node {
public int data;
public Node next;
public Node(int x){
data = x;
next = null;
}
}
class GfG{
// Function to print elements of the second list based
// on positions from the first list
static void PrintSecondList(Node head1, Node head2)
{
// Pointer to traverse the second list
Node current2 = head2;
// Start position index at 1
int currentPos = 1;
// Pointer to traverse the first list
Node current1 = head1;
while (current1 != null) {
// Get the target position from the first list
int targetPos = current1.data;
// Move the pointer in the second list to the
// target position
while (current2 != null
&& currentPos < targetPos) {
current2 = current2.next;
currentPos++;
}
// Print the node data if it matches the target
// position
if (current2 != null
&& currentPos == targetPos) {
Console.Write(current2.data + " ");
}
// Move to the next node in the first list
current1 = current1.next;
}
Console.WriteLine();
}
static void Main()
{
// Create 1st list: 2 -> 5
Node head1 = new Node(2);
head1.next = new Node(5);
// Create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
Node head2 = new Node(4);
head2.next = new Node(5);
head2.next.next = new Node(6);
head2.next.next.next = new Node(7);
head2.next.next.next.next = new Node(8);
PrintSecondList(head1, head2);
}
}
class Node {
constructor(x)
{
this.data = x;
this.next = null;
}
}
// Function to print elements of the second list based on
// positions from the first list
function printSecondList(head1, head2)
{
// Pointer to traverse the second list
let current2 = head2;
// Start position index at 1
let currentPos = 1;
// Pointer to traverse the first list
let current1 = head1;
while (current1 !== null) {
// Get the target position from the first list
let targetPos= current1.data;
// Move the pointer in the second list to the target
// position
while (current2 !== null
&& currentPos < targetPos) {
current2 = current2.next;
currentPos++;
}
// Print the node data if it matches the target
// position
if (current2 !== null && currentPos === targetPos) {
process.stdout.write(current2.data + " ");
}
// Move to the next node in the first list
current1 = current1.next;
}
console.log();
}
// Create 1st list: 2 -> 5
let head1 = new Node(2);
head1.next = new Node(5);
// Create 2nd list: 4 -> 5 -> 6 -> 7 -> 8
let head2 = new Node(4);
head2.next = new Node(5);
head2.next.next = new Node(6);
head2.next.next.next = new Node(7);
head2.next.next.next.next = new Node(8);
printSecondList(head1, head2);
Time Complexity: O(m+n), At worst case we would traverse each nodes of both linked list
Auxiliary Space: O(1)
Similar Reads
Print the alternate nodes of linked list (Iterative Method)
Given a linked list, print the alternate nodes of the linked list. Examples: Input : 1 -> 8 -> 3 -> 10 -> 17 -> 22 -> 29 -> 42 Output : 1 -> 3 -> 17 -> 29 Alternate nodes : 1 -> 3 -> 17 -> 29 Input : 10 -> 17 -> 33 -> 38 -> 73 Output : 10 -> 33 -
9 min read
Insert a Node after a given Node in Linked List
Given a linked list, the task is to insert a new node after a given node of the linked list. If the given node is not present in the linked list, print "Node not found". Examples: Input: LinkedList = 2 -> 3 -> 4 -> 5, newData = 1, key = 2Output: LinkedList = 2 -> 1 -> 3 -> 4 ->
11 min read
Write a function to get Nth node in a Linked List
Given a LinkedList and an index (1-based). The task is to find the data value stored in the node at that kth position. If no such node exists whose index is k then return -1. Example:Â Input: 1->10->30->14, index = 2Output: 10Explanation: The node value at index 2 is 10 Input: 1->32->
11 min read
An interesting method to print reverse of a linked list
We are given a linked list, we need to print the linked list in reverse order.Examples: Input : list : 5-> 15-> 20-> 25 Output : Reversed Linked list : 25-> 20-> 15-> 5Input : list : 85-> 15-> 4-> 20 Output : Reversed Linked list : 20-> 4-> 15-> 85Input : list : 8
7 min read
Find extra node in the second Linked list
Given two Linked list L1 and L2. The second list L2 contains all the nodes of L1 along with 1 extra node. The task is to find that extra node. Examples: Input: L1 = 17 -> 7 -> 6 -> 16 L2 = 17 -> 7 -> 6 -> 16 -> 15 Output: 15 Explanation: Element 15 is not present in the L1 listI
7 min read
Insert a node in Linked List before a given node
Given a linked list, the task is to insert a new node with a specified value into a linked list before a node with a given key. Examples Input: head: 1 -> 2 -> 3 -> 4 -> 5 , newData = 6, key = 2Output: 1 -> 6 -> 2 -> 3 -> 4 -> 5 Explanation: After inserting node with value
15+ min read
Print alternate nodes of a linked list using recursion
Given a linked list, print alternate nodes of this linked list. Examples : Input : 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10 Output : 1 -> 3 -> 5 -> 7 -> 9 Input : 10 -> 9 Output : 10 Recursive Approach : Initialize a static variable(say flag) If flag
6 min read
Delete a Linked List node at a given position
Given a singly linked list and a position (1-based indexing), the task is to delete a linked list node at the given position. Note: Position will be valid (i.e, 1 <= position <= linked list length) Example: Input: position = 2, Linked List = 8->2->3->1->7Output: Linked List = 8-
8 min read
Reverse each word in a linked list node
Given a linked list of strings, we need to reverse each word of the string in the given linked list. Examples: Input: geeksforgeeks a computer science portal for geeks Output: skeegrofskeeg a retupmoc ecneics latrop rof skeeg Input: Publish your own articles on geeksforgeeks Output: hsilbuP ruoy nwo
6 min read
Insert a node at a specific position in a linked list
Given a singly linked list, a position pos, and data, the task is to insert that data into a linked list at the given position. Examples: Input: 3->5->8->10, data = 2, pos = 2Output: 3->2->5->8->10 Input: 3->5->8->10, data = 11, pos = 5Output: 3->5->8->10->1
8 min read