100 Days of Algorithms challenges
Day 9: Linked List (Easy)
Given the head of a singly linked list, reverse the list, and return the reversed list.
2. Merge Two Sorted Lists
You are given the heads of two sorted linked lists list1 and list2. Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.
Day 9 - Linked List (Easy)
Given the head of a singly linked list, reverse the list, and return the reversed list.
2. Merge Two Sorted Lists
You are given the heads of two sorted linked lists list1 and list2. Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.
Community|Blog|Youtube|Careers|Contact Us
Have Feedback or want to contribute? Email: hello[@]100DaysOfCode.io
100DaysOfCode@2024