|
0002. Add Two Numbers |
Java |
Medium |
|
|
0019. Remove Nth Node From End of List |
Java |
Medium |
|
|
0021. Merge Two Sorted Lists |
Java |
Easy |
|
|
0023. Merge k Sorted Lists |
Java |
Hard |
๐๐๐ |
|
0024. Swap Nodes in Pairs |
Java |
Medium |
|
|
0025. Reverse Nodes in k-Group |
Java |
Hard |
๐ |
|
0061. Rotate List |
Java |
Medium |
|
|
0082. Remove Duplicates from Sorted List II |
Java |
Medium |
|
|
0083. Remove Duplicates from Sorted List |
Java |
Easy |
|
|
0086. Partition List |
Java |
Medium |
๐ |
|
0092. Reverse Linked List II |
Java |
Medium |
๐ |
|
0109. Convert Sorted List to Binary Search Tree |
|
Medium |
|
|
0114. Flatten Binary Tree to Linked List |
|
Medium |
|
|
0116. Populating Next Right Pointers in Each Node |
Java |
Medium |
|
|
0117. Populating Next Right Pointers in Each Node II |
Java |
Medium |
|
|
0138. Copy List with Random Pointer |
Java |
Medium |
๐ |
|
0141. Linked List Cycle |
Java |
Easy |
|
|
0142. Linked List Cycle II |
Java |
Medium |
๐ |
|
0143. Reorder List |
Java |
Medium |
๐ |
|
0146. LRU Cache |
Java |
Medium |
๐๐๐ |
|
0147. Insertion Sort List |
Java |
Medium |
|
|
0148. Sort List |
Java |
Medium |
๐๐๐ |
|
0160. Intersection of Two Linked Lists |
Java |
Easy |
๐ |
|
0203. Remove Linked List Elements |
Java |
Easy |
|
|
0206. Reverse Linked List |
Java |
Easy |
|
|
0234. Palindrome Linked List |
Java |
Easy |
|
|
0237. Delete Node in a Linked List |
Java |
Medium |
|
|
0328. Odd Even Linked List |
Java |
Medium |
๐ |
|
0355. Design Twitter |
Java |
Medium |
๐๐๐ |
|
0369. Plug One Linked List |
Java |
Medium |
|
|
0379. Design Phone Directory |
Java |
Medium |
|
|
0382. Linked List Random Node |
Java |
Medium |
|
|
0426. Convert Binary Search Tree to Doubly Linked List |
|
Medium |
|
|
0430. Flatten a Multilevel Doubly Linked List |
Java |
Medium |
๐ |
|
0432. All O`one Data Structure |
Java |
Hard |
๐๐ |
|
0445. Add Two Numbers II |
Java |
Medium |
|
|
0460. LFU Cache |
Java |
Hard |
๐๐๐ |
|
0622. Design Circular Queue |
Java |
Medium |
|
|
0641. Design Circular Deque |
Java |
Medium |
|
|
0705. Design HashSet |
|
Easy |
๐๐๐ |
|
0706. Design HashMap |
|
Easy |
๐๐๐ |
|
0707. Design Linked List |
Java |
Medium |
|
|
0708. Insert into a Sorted Circular Linked List |
Java |
Medium |
๐๐ |
|
0716. Max Stack |
Java |
Hard |
๐๐๐ |
|
0725. Split Linked List in Parts |
Java |
Medium |
๐ |
|
0817. Linked List Components |
Java |
Medium |
|
|
0876. Middle of the Linked List |
Java |
Easy |
|
|
1019.Next Greater Node in Linked List |
Java |
Medium |
|
|
1171. Remove Zero Sum Consecutive Nodes from Linked List |
Java |
Medium |
|
|
1206. Design Skiplist |
Java |
Hard |
๐๐๐ |
|
1265. Print Immutable Linked List in Reverse |
Java |
Medium |
|
|
1290. Convert Binary Number in a Linked List to Integer |
Java |
Easy |
|
|
1367. Linked List in Binary Tree |
|
Medium |
|
|
1472. Design Browser History |
Java |
Medium |
|
|
1474. Delete N Nodes after M Nodes of a Linked List |
Java |
Easy |
|
|
1634. Add Two Polynomials Represented as Linked Lists |
Java |
Medium |
|
|
1669. Merge In Between Linked Lists |
Java |
Medium |
|
|
1670. Design Front Middle Back Queue |
Java |
Medium |
|
|
1721. Swapping Nodes in a Linked List |
Java |
Medium |
|
|
1836. Remove Duplicates From an Unsorted Linked List |
Java |
Medium |
|
|
2046. Sort Linked List Already Sorted Using Absolute Values |
Java |
Medium |
|
|
2058. Find the Minimum and Maximum Number of Nodes Between Critical Points |
Java |
Medium |
|
|
2074. Reverse Nodes in Even Length Groups |
Java |
Medium |
|
|
2095. Delete the Middle Node of a Linked List |
Java |
Medium |
|
|
2130. Maximum Twin Sum of a Linked List |
Java |
Medium |
|
|
2181. Merge Nodes in Between Zeros |
Java |
Medium |
|
|
2289. Steps to Make Array Non-decreasing |
Java |
Medium |
๐๐๐ |
|
2296. Design a Text Editor |
Java |
Hard |
๐๐ |
|
2326. Spiral Matrix IV |
Java |
Medium |
|
|
2487. Remove Nodes From Linked List |
Java |
Medium |
|
|
Interview 03.03. Stack of Plates LCCI |
Java |
Medium |
๐๐ |