📂
Interview Prep
Ctrlk
  • Introduction
  • Trees
  • Recursion & Backtracking
  • Maths
  • Binary Searching & Sorting
  • Strings
  • BIT Manipulation
  • Two Pointers
  • Arrays
  • Linked List
    • Intersection of Linked Lists
    • Reverse Linked List
    • Palindrome Linked List
    • Remove Duplicates from Sorted List
    • Remove Duplicates from Sorted List II
    • Merge Two Sorted Lists
    • Remove Nth Node From End of List
    • Rotate List
    • Reverse Linked List II
    • Reorder List
    • Linked List Cycle
    • Linked List Cycle II
    • Reverse Nodes in k-Group
    • Swap Nodes in Pairs
    • Add Two Numbers
    • Partition List
    • Insertion Sort List
    • Sort List
    • Flatten a Multilevel Doubly Linked List
    • Odd Even Linked List
    • Remove Zero Sum Consecutive Nodes from Linked List
    • Linked List Random Node
    • Design Browser History
    • LFU Cache
    • LRU Cache
  • Stacks & Queues
  • HashMap & HashSet & Sliding Window
  • Priority Queue
  • Dynamic Programming
  • Greedy
  • Graphs, BFS & DFS
  • Geometry
  • Merge Sort
  • Segment Trees
  • Most consistent ways of dealing with the series of stock problems
Powered by GitBook
On this page

Linked List

Intersection of Linked ListsReverse Linked ListPalindrome Linked ListRemove Duplicates from Sorted ListRemove Duplicates from Sorted List IIMerge Two Sorted ListsRemove Nth Node From End of ListRotate ListReverse Linked List IIReorder ListLinked List CycleLinked List Cycle IIReverse Nodes in k-GroupSwap Nodes in PairsAdd Two NumbersPartition ListInsertion Sort ListSort ListFlatten a Multilevel Doubly Linked ListOdd Even Linked ListRemove Zero Sum Consecutive Nodes from Linked ListLinked List Random NodeDesign Browser HistoryLFU CacheLRU Cache
PreviousFind the Winner of an Array GameNextIntersection of Linked Lists

Last updated 5 years ago