Unit 6 Session 2 - codepath/compsci_guides GitHub Wiki

Part of TIP101 Unit 6

🔗 Problem Statements

Problem Set Version 1

1. Detect Circular Linked List
2. Find Last Node in a Linked List Cycle
3. Partition List Around Value
4. Convert Binary Number in a Linked List to Integer
5. Add Two Numbers Represented by Linked Lists
6. Reverse Sublist of a Linked List

Problem Set Version 2

1. Convert a Singly Linked List to a Circular Linked List
2. Collect Nodes of a Cycle in a Linked List
3. Delete Duplicates in a Linked List
4. Identical Linked Lists
5. Circular Linked List Rotate
6. Circular Linked List Delete

Problem Set Version 3

1. Circular List Length
2. Detect and Remove Cycle in a Linked List
3. Merge Two Sorted Linked Lists
4. Skip and Remove Nodes in a Linked List
5. Rotate a Doubly Linked List to the Left
6. Merge Nodes Between Zeros in a Linked List