linked-list-techniques

linked-list-techniques

ascherj

A Python implementation demonstrating three fundamental linked list techniques with clear examples and detailed explanations. Features Multiple Pass, Temporary Head, and Fast-Slow Pointer algorithms for common linked list operations including finding middle elements, reversing lists, and cycle detection.

19 Stars
2 Forks
0 Watchers
Python Language
61.6 SrcLog Score
Cost to Build
$648
Market Value
$722

Growth over time

8 data points  ·  2026-04-10 → 2026-10-25
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about linked-list-techniques

Question copied to clipboard

What is the ascherj/linked-list-techniques GitHub project? Description: "A Python implementation demonstrating three fundamental linked list techniques with clear examples and detailed explanations. Features Multiple Pass, Temporary Head, and Fast-Slow Pointer algorithms for common linked list operations including finding middle elements, reversing lists, and cycle detection.". Written in Python. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

🏆 Show off this rank

ascherj/linked-list-techniques on SrcLog (holo style)

Add it to a GitHub README or profile — the card updates as the ranking changes:

How to clone linked-list-techniques

Clone via HTTPS

git clone https://github.com/ascherj/linked-list-techniques.git

Clone via SSH

[email protected]:ascherj/linked-list-techniques.git

Download ZIP

Download main.zip

Found an issue?

Report bugs or request features on the linked-list-techniques issue tracker:

Open GitHub Issues