×

Search anything:

Get this book -> Problems on Array: For Interviews and Competitive Programming

This article introduces the exclusive book on Linked List Data Structure titled "Linked List Problems: For Interviews and Competitive Programming". It is a part of the book series "Must for Coding Interviews".

Get the book "Linked List Problems" at:

Following is the cover of the book:

Cover of the exclusive book: Linked List Problems

Did you know that the algorithms dealing with L1, L2 and L3 cache in your computer rely on Linked List?

The calculations for Rocket and Satellite launches in NASA use Linked Lists to store numbers and perform critical calculations.

These are just 2 instances of Linked List. It is one of the most used Data Structures and you should definitely master it before you jump into the real world.

This book â€śLinked List Problems: For Interviews and Competitive Programmingâ€ť is a deep dive into Linked List Data Structure, core techniques and Practice problems on Linked List. On completing this book, you will have these core skills:

• Strong hold on Linked List (Research Level)
• Easily solve any Linked List problem in Coding Interview and Competitive Programming Contests
• Design Custom Data Structures for real-life applications

This book is divided into 4 sections:

• Fundamentals of Linked List: This section builds your fundamentals. We explain how to implement Linked List using Industry standard, core operations along with Time and Space Complexity Analysis. This burst several misconceptions and assumptions a programmer makes about Linked List.

• Types of Linked Lists: This section builds you hold on twisting Linked List as per your requirements to solve a problem.

• Core Linked List Techniques: This is the most important section which presents you all the tools and techniques you need to conquer Linked Lists.

• Practice Problems on Linked List: Practice is a key to success for Coding Interviews, Competitive Programming and Efficient Problem Solving. Practice one problem everyday by implementing the solution on your own.

## Details

• Book: â€śLinked List Problems: For Interviews and Competitive Programmingâ€ť
• Authors (3): Aditya Chatterjee, Ue Kiao, Geoffrey Ziskovin

• Aditya Chatterjee is an Independent Researcher, Technical Author and the Founding Member of OPENGENUS, a scientific community focused on Computing Technology.

• Ue Kiao is a Japanese Software Developer and has played key role in designing systems like TaoBao, AliPay and many more. She has completed her B. Sc in Mathematics and Computing Science at National Taiwan University and PhD at Tokyo Institute of Technology.

• Geoffrey Ziskovin is an American Software Engineer with an experience of over 30 years. He has interviewed over 700 candidates worldwide for various Fortune 500 companies.

• Publisher: OpenGenus

• Published: March 2022

• Number of Pages: 465

• ISBN: 9798436608754

• Search an element in a Linked List
• Delete an element in a Linked List
• Insert an element in a Linked List
• Linked List with Hotel Example
• Linked List with no NULLs
• Time Complexity Analysis of Linked List

• Insert element in a sorted Linked List
• Move the first element of the linked list to the end
• Fast and slow pointer technique in Linked List
• Detect a loop in a linked list (3 techniques)
• Cycle Detection Algorithms
• Reverse a linked list (2 techniques)
• Move all occurrences of an element to end of linked list
• Practice Problems on Linked List
• Check if Linked List is Empty
• Find the middle element of a singly Linked List
• Delete Middle Node from Linked List
• Remove Nth Node from end of Singly Linked List
• Reverse part of Singly Linked List
• Reverse alternate groups of K nodes in a Singly Linked List
• Reverse a Doubly Linked List
• Move Last Element of Linked List to Front
• Check if a linked list is sorted
• Sort a Linked List which is already sorted on absolute values
• Swap Nodes in Pairs
• Find starting point of loop in linked list
• Finding the length of a loop in linked list
• Intersection point of two linked lists
• Detect and remove loop in a Linked List
• Check whether a Singly Linked List is Palindrome or not
• Merge two sorted linked lists
• Merge K sorted Linked Lists
• Implement Least Recently Used (LRU) Cache
• Concluding Note

## Leaf from the Book

Following is a leaf from the book "Linked List Problems":

Get started with this book and change the equation of your career.

#### Geoffrey Ziskovin

Geoffrey Ziskovin is an American Software Developer and Author with an experience of over 30 years. He started his career with Haskell and has interviewed over 700 candidates for Fortune 500 companies