LRU Cache
LRU Cache: Design a data structure that follows the constraints of a Least Recently Used (LRU) cache .
-
-
Rotate List
Rotate List: Given the head of a linked list, rotate the list to the right by k places.
-
Remove Nth Node From End of List
Remove Nth Node From End of List: Given the head of a linked list, remove the nth node from the end of the list and return its head.
-
Remove Duplicates from Sorted List
Remove Duplicates from Sorted List: Given the head of a sorted linked list, delete all duplicates such that each element appears only once.
-
Remove Linked List Elements
Remove Linked List Elements: Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.
-
Merge Two Sorted Lists
Merge Two Sorted Lists: You are given the heads of two sorted linked lists list1 and list2.