~/home ~/about ~/projects ~/blog ~/tracker ~/uses ~/contact

~/home ~/about ~/projects ~/blog ~/tracker ~/uses ~/contact

DSA Tracker

0%

Apr 07 → Jul 20, 2026 on track

Wk 1 · Basics & Foundations Wk 2 · Strings & Advanced Fou

Wk 3 · Linked Lists - Basics Wk 4 · Queues & Binary Trees Wk 5 · Binary Trees Advanced

Wk 6 · Heaps & Graphs Basics Wk 7 · Graph Algorithms & Tri Wk 8 · Union-Find & Phase 3 R

Wk 9 · Dynamic Programming Ba Wk 10 · Dynamic Programming A Wk 11 · Backtracking & Phase

Wk 12 · Timed Sessions & Prac Wk 13 · Practice Rounds 2 & 3 Wk 14 · Final Consolidation &

Wk 15 · Arrays & Hash Maps Wk 16 · Linked Lists & Trees

Wk 17 · Graphs & Dynamic Prog Wk 18 · Backtracking & Final

Week 3: Linked Lists - Basics

Apr 21-27 | Phase 2: Core Structures

Day 1-2: Linked Lists - Basics

2-3 hours

📚 Learning

Node structure
Singly linked list traversal
Insert and delete operations

🔗 LeetCode

206. Reverse Linked List Easy
21. Merge Two Sorted Lists Easy
92. Reverse Linked List II Medium

📝 Reflection / Notes:

Day 3-4: Linked Lists - Advanced

2-3 hours

📚 Learning

Fast and slow pointer
Cycle detection
Remove duplicates from list

🔗 LeetCode

141. Linked List Cycle Easy
203. Remove Linked List Elements Easy
82. Remove Duplicates from Sorted List II Medium

📝 Reflection / Notes:

Day 5-7: Stacks

2-3 hours

📚 Learning

Stack implementation using list
Push, pop, peek operations
LIFO principle

🔗 LeetCode

20. Valid Parentheses Easy
155. Min Stack Medium
71. Simplify Path Medium

📝 Reflection / Notes: