Register for our webinar

### How to Nail your next Technical Interview

1 hour
1
Enter details
2
Select webinar slot
*Invalid Name
*Invalid Name
Step 1
Step 2
Congratulations!
You have registered for our webinar
Oops! Something went wrong while submitting the form.
1
Enter details
2
Select webinar slot
*All webinar slots are in the Asia/Kolkata timezone
Step 1
Step 2
Confirmed
You are scheduled with Interview Kickstart.
Redirecting...
Oops! Something went wrong while submitting the form.

## You may be missing out on a 66.5% salary hike*

### Nick Camilleri

Head of Career Skills Development & Coaching
*Based on past data of successful IK students
Help us know you better!

## How many years of coding experience do you have?

Oops! Something went wrong while submitting the form.

## FREE course on 'Sorting Algorithms' by Omkar Deshpande (Stanford PhD, Head of Curriculum, IK)

Oops! Something went wrong while submitting the form.

# Swap kth Nodes In Given Linked List Problem

Given an integer singly linked list L of size n, and an integer k, you have to swap kth (1-indexed) node from the beginning, with kth node from the end.

Note that you have to swap the nodes themselves, not just the contents.

##### Example

Input:

list: 1 -> 2 -> 3 -> 4 -> 7 -> 0 -> NULL

k: 2

Output:

1 -> 7 -> 3 -> 4 -> 2 -> 0 -> NULL

##### Notes

Input Parameters: There are two arguments in input. First is an integer singly linked list L and second is an integer k.

Output: Return resultant linked list resL, after swapping kth nodes of L.

##### Constraints:

● 1

● -2 * 10^9

● 1

● Try to access linked list nodes minimum number of times.

#### Solution

Have you considered "Try to access linked list nodes minimum number of times."?

If you have:

1) First find linked list length n.

2) Then find k-th node.

3) Then n-k+1-th node.

4) Swap the nodes.

Then this is not the optimal solution.

Note that while finding the length of the list we could have found the k-th node in the same loop!

Now this is an optimal solution.

Also there is another optimal solution possible and we have presented that in optimal_solution.cpp.

O(n).

O(1).

##### Space Complexity:

O(n).

The input is O(n) and the auxiliary space used is O(1). So, O(n) + O(1) -> O(n).

### Try yourself in the Editor

Note: Input and Output will already be taken care of.

# Swap kth Nodes In Given Linked List Problem

Given an integer singly linked list L of size n, and an integer k, you have to swap kth (1-indexed) node from the beginning, with kth node from the end.

Note that you have to swap the nodes themselves, not just the contents.

##### Example

Input:

list: 1 -> 2 -> 3 -> 4 -> 7 -> 0 -> NULL

k: 2

Output:

1 -> 7 -> 3 -> 4 -> 2 -> 0 -> NULL

##### Notes

Input Parameters: There are two arguments in input. First is an integer singly linked list L and second is an integer k.

Output: Return resultant linked list resL, after swapping kth nodes of L.

##### Constraints:

● 1

● -2 * 10^9

● 1

● Try to access linked list nodes minimum number of times.

#### Solution

Have you considered "Try to access linked list nodes minimum number of times."?

If you have:

1) First find linked list length n.

2) Then find k-th node.

3) Then n-k+1-th node.

4) Swap the nodes.

Then this is not the optimal solution.

Note that while finding the length of the list we could have found the k-th node in the same loop!

Now this is an optimal solution.

Also there is another optimal solution possible and we have presented that in optimal_solution.cpp.

O(n).

O(1).

##### Space Complexity:

O(n).

The input is O(n) and the auxiliary space used is O(1). So, O(n) + O(1) -> O(n).

## Worried About Failing Tech Interviews?

Attend our free webinar to amp up your career and get the salary you deserve.

Hosted By
Ryan Valles
Founder, Interview Kickstart
Accelerate your Interview prep with Tier-1 tech instructors
360° courses that have helped 14,000+ tech professionals
100% money-back guarantee*