Leetcode Top Interview ✨
Ctrlk
GithubLinkedinXOfficial Website
  • Leetcode Top Interview 🎯
  • Guide to Calculating Algorithm Complexity 🚀
  • Topic 1 Array - String
  • Topic 2 Two Pointers
  • Topic 3 Sliding Window
  • Topic 4 Matrix
  • Topic 5 Hashmap
  • Topic 6 Intervals
  • Topic 7 Stack
  • Topic 8 Linked List
    • 141. Linked List Cycle 🔁
    • 2. Add Two Numbers 🔢
    • 21. Merge Two Sorted Lists 🔗
    • 138. Copy List with Random Pointer 🔗
    • 92. Reverse Linked List II 🔄
    • 25. Reverse Nodes in k-Group 🔄
    • 19. Remove Nth Node From End of List 🗑️
    • 82. Remove Duplicates from Sorted List II ❌🔢
    • 61. Rotate List 🔄
    • 86. Partition List 🔗
    • 146. LRU Cache 🔗
  • Topic 9 Binary Tree General
Powered by GitBook
On this page

Was this helpful?

Topic 8 Linked List

141. Linked List Cycle 🔁2. Add Two Numbers 🔢21. Merge Two Sorted Lists 🔗138. Copy List with Random Pointer 🔗92. Reverse Linked List II 🔄25. Reverse Nodes in k-Group 🔄19. Remove Nth Node From End of List 🗑️82. Remove Duplicates from Sorted List II ❌🔢61. Rotate List 🔄86. Partition List 🔗146. LRU Cache 🔗
Previous224. Basic Calculator 🧮Next141. Linked List Cycle 🔁

Last updated 1 year ago

Was this helpful?