🔗
Linked Lists
Reversal, fast/slow pointers, merge, reorder.
01
Basics & reversal
0/12Reverse, count, sum, nth node.
○Count nodes in a listSilver · 1000○Value of the nth nodeSilver · 1000○Reverse a linked listSilver · 1050○Reverse A Singly Linked ListSilver · 1050○Delete Node By ValueSilver · 1050○Nth node from the endSilver · 1180○Remove nth node from endGold · 1380○Reverse And Add Two NumbersGold · 1400○Reverse Nodes In K GroupPlatinum · 1700○Add Two NumbersPlatinum · 1700○Reverse Linked List IIPlatinum · 1750○Reverse nodes in groups of kPlatinum · 1750
02
Fast & slow
0/8Middle, cycle, nth from end, palindrome.
03
Merge & sort
0/7Merge sorted, sort list, insertion sort, k lists.
04
Reorder & transform
0/12Reorder, swap pairs, rotate, partition, add.
○Remove duplicates from an unsorted listSilver · 1200○Remove duplicates from sorted listGold · 1320○Rotate ListGold · 1330○Reorder ListGold · 1350○Plus one to a number listGold · 1350○Odd Even Linked ListGold · 1400○Reorder list (L0, Ln, L1, Ln-1, ...)Gold · 1400○Odd-even node reorderGold · 1450○Partition List Around XGold · 1450○Double a number listGold · 1450○Rotate list right by kGold · 1500○Add two numbers as digit listsPlatinum · 1750