Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

README.md

Outline

Linked List

Singly and doubly linked list manipulation and algorithms.

Key Concepts Covered

  • Linked list design and implementation
  • Two-pointer technique (fast/slow pointers)
  • List reversal
  • Cycle detection (Floyd's algorithm)
  • Merging sorted lists
  • Partitioning lists
  • Deep copy with random pointers
  • Doubly linked lists (DLL)

Problems in this Directory

Basic Implementation

Reversal Problems

Merging & Sorting

List Manipulation

Advanced Problems

Doubly Linked List (DLL)

LRU Cache

Special Problems

Tips

  • Always handle NULL pointers carefully
  • Draw diagrams for pointer manipulation
  • Use dummy nodes to simplify edge cases
  • Practice reversing lists—it's fundamental
  • Remember to update all pointers in DLL
Morty Proxy This is a proxified and sanitized view of the page, visit original site.