• Home
  • Learn
  • Feed
  • Ladder
  • Saved
← Roadmapsall linked lists problems
🔗

Linked Lists

Reversal, fast/slow pointers, merge, reorder.

5 stops · 52 problems0/52 on the path done
next ▸ Count nodes in a listSilver · 1000
1

Basics & reversal

0/12you are here

Reverse, count, sum, nth node.

○Count nodes in a list○Value of the nth node○Reverse a linked list○Reverse A Singly Linked List○Delete Node By Value○Nth node from the end○Remove nth node from end○Reverse And Add Two Numbers○Reverse Nodes In K Group○Add Two Numbers○Reverse Linked List II○Reverse nodes in groups of k
2

Fast & slow

0/8

Middle, cycle, nth from end, palindrome.

○Middle node value○Middle Of The List○Detect a cycle○Linked List Cycle○Delete the middle node○Palindrome linked list○Intersection start index of two lists○Intersection suffix length
3

Merge & sort

0/7

Merge sorted, sort list, insertion sort, k lists.

○Partition List○Merge two sorted lists○Insertion Sort List○Split List Into K Parts○Insertion sort the list○Split a list into k parts (sizes)○Merge K Sorted Lists
4

Reorder & transform

0/12

Reorder, swap pairs, rotate, partition, add.

○Remove duplicates from an unsorted list○Remove duplicates from sorted list○Rotate List○Reorder List○Plus one to a number list○Odd Even Linked List○Reorder list (L0, Ln, L1, Ln-1, ...)○Odd-even node reorder○Partition List Around X○Double a number list○Rotate list right by k○Add two numbers as digit lists
5

More Linked Lists

0/13

Everything else in this category — keep climbing.

○Count the nodes○Sum of the list○Sort Linked List○Maximum value in the list○Delete all nodes with value○Add One To Number List○Swap Nodes At Kth From Both Ends○Remove Linked List Elements○Keep Distinct Nodes Only○Sort the list○Swap nodes in pairs○Flatten A Multilevel List○Remove Zero Sum Consecutive Nodes
🏁Finish line