Topic: Linked List

alleasymediumhard

alltodoattemptedfailedsolved

66 problems

#	Title	Status	Difficulty	Topics	Accept
2	Add Two Numbersread	—	Medium	Linked ListMathRecursion	46%
19	Remove Nth Node From End of List	—	Medium	Linked ListTwo Pointers	49%
21	Merge Two Sorted Lists	—	Easy	Linked ListRecursion	67%
23	Merge k Sorted Lists	—	Hard	Linked ListDivide and ConquerHeap (Priority Queue)	56%
24	Swap Nodes in Pairs	—	Medium	Linked ListRecursion	67%
25	Reverse Nodes in k-Group	—	Hard	Linked ListRecursion	63%
61	Rotate List	—	Medium	Linked ListTwo Pointers	40%
82	Remove Duplicates from Sorted List II	—	Medium	Linked ListTwo Pointers	50%
83	Remove Duplicates from Sorted List	—	Easy	Linked List	55%
86	Partition List	—	Medium	Linked ListTwo Pointers	59%
92	Reverse Linked List II	—	Medium	Linked List	49%
109	Convert Sorted List to Binary Search Tree	—	Medium	Linked ListDivide and ConquerTree	64%
114	Flatten Binary Tree to Linked List	—	Medium	Linked ListStackTree	68%
116	Populating Next Right Pointers in Each Node	—	Medium	Linked ListTreeDepth-First Search	65%
117	Populating Next Right Pointers in Each Node II	—	Medium	Linked ListTreeDepth-First Search	55%
138	Copy List with Random Pointerread	—	Medium	Hash TableLinked List	60%
141	Linked List Cycle	—	Easy	Hash TableLinked ListTwo Pointers	52%
142	Linked List Cycle II	—	Medium	Hash TableLinked ListTwo Pointers	55%
143	Reorder List	—	Medium	Linked ListTwo PointersStack	62%
146	LRU Cacheread	—	Medium	Hash TableLinked ListDesign	45%
147	Insertion Sort List	—	Medium	Linked ListSorting	56%
148	Sort List	—	Medium	Linked ListTwo PointersDivide and Conquer	61%
160	Intersection of Two Linked Lists	—	Easy	Hash TableLinked ListTwo Pointers	61%
203	Remove Linked List Elements	—	Easy	Linked ListRecursion	52%
206	Reverse Linked List	—	Easy	Linked ListRecursion	79%
234	Palindrome Linked List	—	Easy	Linked ListTwo PointersStack	56%
237	Delete Node in a Linked Listread	—	Medium	Linked List	82%
328	Odd Even Linked List	—	Medium	Linked List	62%
355	Design Twitterread	—	Medium	Hash TableLinked ListDesign	42%
382	Linked List Random Noderead	—	Medium	Linked ListMathReservoir Sampling	64%
430	Flatten a Multilevel Doubly Linked List	—	Medium	Linked ListDepth-First SearchDoubly-Linked List	61%
432	All O`one Data Structureread	—	Hard	Hash TableLinked ListDesign	44%
445	Add Two Numbers IIread	—	Medium	Linked ListMathStack	62%
460	LFU Cacheread	—	Hard	Hash TableLinked ListDesign	46%
622	Design Circular Queueread	—	Medium	ArrayLinked ListDesign	52%
641	Design Circular Dequeread	—	Medium	ArrayLinked ListDesign	64%
705	Design HashSetread	—	Easy	ArrayHash TableLinked List	67%
706	Design HashMapread	—	Easy	ArrayHash TableLinked List	66%
707	Design Linked Listread	—	Medium	Linked ListDesign	29%
725	Split Linked List in Parts	—	Medium	Linked List	70%
817	Linked List Components	—	Medium	ArrayHash TableLinked List	57%
876	Middle of the Linked List	—	Easy	Linked ListTwo Pointers	80%
1019	Next Greater Node In Linked List	—	Medium	ArrayLinked ListStack	62%
1171	Remove Zero Sum Consecutive Nodes from Linked List	—	Medium	Hash TableLinked List	53%
1206	Design Skiplistread	—	Hard	Linked ListDesign	58%
1290	Convert Binary Number in a Linked List to Integer	—	Easy	Linked ListMath	81%
1367	Linked List in Binary Tree	—	Medium	Linked ListTreeDepth-First Search	52%
1472	Design Browser Historyread	—	Medium	ArrayLinked ListStack	78%
1669	Merge In Between Linked Listsread	—	Medium	Linked List	82%
1670	Design Front Middle Back Queueread	—	Medium	ArrayLinked ListDesign	56%

Page 1 of 2