LeetCode 1265. Print Immutable Linked List in Reverse
Description https://leetcode.com/problems/print-immutable-linked-list-in-reverse/ You are given an immutable linked list, print out all values of each node in reverse with the…
Category: Linked List
LeetCode 24. Swap Nodes in Pairs
Description https://leetcode.com/problems/swap-nodes-in-pairs/ Given a linked list, swap every two adjacent nodes and return its head. Example 1: Input: head = [1,2,3,4]…
LeetCode 160. Intersection of Two Linked Lists
Description https://leetcode.com/problems/intersection-of-two-linked-lists/ Write a program to find the node at which the intersection of two singly linked lists begins. For…
LeetCode 328. Odd Even Linked List
Description https://leetcode.com/problems/odd-even-linked-list/ Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here…
LeetCode 146. LRU Cache
Description https://leetcode.com/problems/lru-cache/ Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) –…
LeetCode 876. Middle of the Linked List
Description https://leetcode.com/problems/middle-of-the-linked-list/ Given a non-empty, singly linked list with head node head, return a middle node of linked list. If there are two middle…
LeetCode 237. Delete Node in a Linked List
Description https://leetcode.com/problems/delete-node-in-a-linked-list/ Write a function to delete a node (except the tail) in a singly linked list, given only access…
LeetCode 141. Linked List Cycle
Description https://leetcode.com/problems/palindrome-linked-list/ Given a linked list, determine if it has a cycle in it. To represent a cycle in the…
LeetCode 234. Palindrome Linked List
Description https://leetcode.com/problems/palindrome-linked-list/ Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false Example…
LeetCode 206. Reverse Linked List
Description https://leetcode.com/problems/reverse-linked-list/ Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Follow up: A linked list can be reversed…