Exercises - Cracking the Coding Interview
Chapter 2 - Linked Lists
- Problem 2.1 - Delete duplicate entries in a linked list (both with and without buffer)
- Problem 2.2 - Find the kth element from the end of a singly linked list
- Problem 2.3 - Remove a node from within a singly linked list given only access to that node
- Problem 2.4 - Partition a singly linked list around a particular value
- Problem 2.5 - Adding digits in two linked links and storing sum in third linked list (reversed and non-reversed)
- Problem 2.6 - Determine whether the elements in a linked list make up a palindrome
- Problem 2.7 - Determine whether two singly linked lists intersect in a common node
- Problem 2.8 - Detect if a singly linked list contains a loop
Problem 2.1 - Delete duplicate entries in a linked list (both with and without buffer)
Problem 2.2 - Find the kth element from the end of a singly linked list
Problem 2.3 - Remove a node from within a singly linked list given only access to that node
Problem 2.4 - Partition a singly linked list around a particular value
Problem 2.5 - Adding digits in two linked links and storing sum in third linked list (reversed and non-reversed)
Problem 2.6 - Determine whether the elements in a linked list make up a palindrome
Problem 2.7 - Determine whether two singly linked lists intersect in a common node
Problem 2.8 - Detect if a singly linked list contains a loop