lp01 : Leetcode practice with linked lists

num	ready?	description	assigned	due
lp01	true	Leetcode practice with linked lists	Mon 03/31 09:00AM	Fri 05/30 11:59AM

Additional Practice with linked lists

Note: A maximum of two medium difficulty problems from this problem set will count toward the 10% overall grade for Leet Code problems. Submit direct links to your solution for at least 2 problems on the assignment on Gradescope by the due date..

1. Reverse a singly linked list (easy): https://leetcode.com/problems/reverse-linked-list/. Note that in lecture 1 we coded an iterative implementation for problem #1. Try solving the same problem recursively.
2. Merge two sorted lists(easy): https://leetcode.com/problems/merge-two-sorted-lists/
3. Remove duplicates from sorted lists (easy): https://leetcode.com/problems/remove-duplicates-from-sorted-list/
4. Middle of the Linked List (easy): https://leetcode.com/problems/middle-of-the-linked-list/
5. Delete Node in a Linked List (medium): https://leetcode.com/problems/delete-node-in-a-linked-list/description/
6. Insert Greatest Common Divisor in a Linked List (medium): https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/description/
7. Partition a linked list (medium): https://leetcode.com/problems/partition-list/description/?envType=problem-list-v2&envId=linked-list
8. Rotate list (medium): https://leetcode.com/problems/rotate-list/description/
9. LinkedList Cycle II (medium): https://leetcode.com/problems/linked-list-cycle-ii/description/
10. Delete the middle node of a linked list (medium): https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/description/?envType=problem-list-v2&envId=linked-list