Unit 5 Session 2 - codepath/compsci_guides GitHub Wiki

Part of TIP101 Unit 5

🔗 Problem Statements

Problem Set Version 1

1. Battle Pokemon
2. Convert to Linked List
3. Add First
4. Get Tail
5. Replace Node
6. List Nodes
7. Insert Value
8. Linked Listify
9. Doubly Linked List
10. Print Backwards

Problem Set Version 2

1. Poker Two-Pair Hand
2. Barbie Linked List
3. Insert Value First
4. Linked List Length
5. Delete Tail
6. Greatest Node
7. Pop Node
8. Find Middle Node
9. Create Double Links
10. Double to Single

Problem Set Version 3

1. Calculate Tournament Placement
2. Update Linked List Sequence
3. Insert Node as Second Element
4. Increment Linked List Node Values
5. Copy Linked List
6. Find Minimum in Linked List
7. Remove Node by Value from Linked List
8. Move Tail to Front of Linked List
9. Convert Singly Linked List to Doubly Linked List
10. Find Length of Doubly Linked List from Any Node