Curriculum Pricing

Sign in Get access

Systematic DSA preparation

Curriculum Pricing Sign in Support

© 2026 AlgoPath. All rights reserved.

Analysis of algorithms

Bit manipulation

Linked list basics Traversal and search Insertion and deletion Reverse a linked list Cycle detection Find the middle node Merge two sorted lists Merge k sorted lists Doubly linked list LRU cache

Binary search tree

Dynamic programming

Curriculum/Linked list

Find the middle node

9 min read

This lesson is locked

Get full access to all 25 modules and 272 lessons.

Unlock — from $7/month Sign in

Intersection and reorder

Linked list summary

Cycle detection

Merge two sorted lists