linked-list

Leetcode 2181. Merge Nodes in Between Zeros

Merge Nodes in Between Zeros

by foolish
Algorithm

Leetcode 2181: Merge Nodes in Between Zeros

Leetcode-21 Merge Two Sorted Linked Lists

by foolish
Algorithm

merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.

Reverse a Linked List Recursively

by foolish
Algorithm

Given the head of a singly linked list, reverse the list, and return the reversed list.