EditorWorkspacesCoursesInterviewsGround CallDaily ChallengesReadsGames
Sign InSign Up
Tools
Resume De-AI-ifierAI Email RewriterAI Code DetectorAI Watermark ToolREADME GeneratorSQL AssistantText SummarizerAI Text GeneratorSystem Prompt DiffAI Code SecurityCommit Message GeneratorInterview Question PackSchema Seed DataGraphQL ExplainerJSON DiffDiff & PatchJSON FormatterSQL FormatterJSON ↔ CSVBase64 CodecLog ParserProtobuf DecoderJWT DebuggerENV LinterPassword GeneratorUUID GeneratorRegex TesterEpoch ConverterMeeting PlannerDate MathCron BuilderQR GeneratorColor PickerLucky Draw WheelSpeed TestDiagram StudioCanvas DrawingTurtle Game
Sign InSign Up
Notifications 0
← All coursesPython
DSA Dojo II
Lists, trees, heaps — pointers you can trust.
Pointers, parents, and priority queues without the textbook fog. You walk linked lists and trees the way interviews expect — draw it, code it, check the output — then finish with heaps and a couple of classic backtracking drills.
Learn with Ada, your AI coding mentor — ask questions or tap I’m stuck in any lesson for a nudge without spoilers.
Course content
1 · Linked Lists
- ○Linked List BasicsFree18 min
- 🔒Reverse a Linked List20 min
- 🔒Merge Two Sorted Lists22 min
- 🔒Linked List Cycle20 min
2 · Stacks & Queues
- 🔒Stack & Queue Intuition18 min
3 · Binary Trees
- 🔒Binary Tree Basics18 min
- 🔒DFS Preorder20 min
- 🔒BFS Level Order22 min
- 🔒Maximum Depth15 min
- 🔒Validate BST25 min
4 · Heaps
- 🔒Heap Intro20 min
- 🔒Kth Largest Element22 min
5 · Recursion & Backtracking
- 🔒Subsets (Backtracking)22 min
- 🔒Permutations (Backtracking)25 min