✨ Sleek UI Components

A collection of beautifully crafted, reusable Tailwind CSS components.

Namaste DSA Workspace

Interview-readiness system built around your current repo

This page turns the high-level DSA plan into a concrete working system: current audit, topic roadmap, revision loop, and mock-readiness criteria. Use it as the source of truth while you pause UI work and focus on DSA completion.

Current recommendation

Phase 1 now: finish audit cleanup before opening major new topics.

Next untouched priorities: two pointers, sliding window, trees.

Study horizon: 2-3 months, optimized for retention over rushing.

Current solid references

28

Problems to re-solve

18

Incomplete files

1

Major topic gaps

6

13-Week Campaign

Weekly milestones from April 27 to July 26, 2026

This is your interactive mission board. Show up, clear the week, and keep turning the whole journey into a series of satisfying checkmarks.

Campaign progress: 0% complete

Tasks cleared: 0 / 52

Week 1

Current week

Foundation Reset

Apr 27 - May 03, 2026

Clean the current base so you stop carrying shaky wins into the harder topics.

Weekly mission

0 / 4 tasks complete

Target: 14-18 lessons

Mastery wins: 6 mastery wins

Complete 14 lessons across arrays, strings, recursion, and sorting

Progress: 0 / 14

Finish the Merge Sort lesson

Progress: 0 / 1

Master 6 lessons from the foundation block

Progress: 0 / 6

Clear 4 core reset problems

Progress: 0 / 4

Boss Battle

Finish `mergeSort`, re-solve 3 weak old problems without looking at code, and close your top 5 known gaps.

Reward

You earn the right to stop second-guessing the basics and start the real climb.

Auto-tracked from course progress

Week 2

Linked List Fortress

May 04 - May 10, 2026

Turn your strongest topic into a confidence engine.

Weekly mission

0 / 4 tasks complete

Target: 16-20 lessons

Mastery wins: 7 mastery wins

Complete 16 linked list lessons

Progress: 0 / 16

Master 7 linked list lessons

Progress: 0 / 7

Clear the core linked-list boss set

Progress: 0 / 5

Finish at least 2 advanced linked-list variants

Progress: 0 / 2

Boss Battle

Solve reverse, cycle, remove nth, rotate, and merge sorted lists cold in one sitting.

Reward

You unlock a true comfort topic for interview warm-up rounds.

Auto-tracked from course progress

Week 3

Stack and Queue Engine

May 11 - May 17, 2026

Build momentum with pattern repetition and speed.

Weekly mission

0 / 4 tasks complete

Target: 14-18 lessons

Mastery wins: 7 mastery wins

Complete 12 stack and queue lessons

Progress: 0 / 12

Master 7 stack and queue lessons

Progress: 0 / 7

Finish the implementation trio

Progress: 0 / 3

Clear the stack and queue boss set

Progress: 0 / 5

Boss Battle

Do valid parentheses, next greater element, daily temperatures, and rotting oranges back-to-back.

Reward

You start feeling the difference between memorizing solutions and recognizing patterns.

Auto-tracked from course progress

Week 4

Binary Search and Hashing Week

May 18 - May 24, 2026

Sharpen precision before entering the big interview-heavy modules.

Weekly mission

0 / 4 tasks complete

Target: 15-19 lessons

Mastery wins: 8 mastery wins

Complete 10 binary-search lessons

Progress: 0 / 10

Complete 8 hashing lessons

Progress: 0 / 8

Master 8 lessons across binary search and hashing

Progress: 0 / 8

Clear the precision boss set

Progress: 0 / 6

Boss Battle

Solve 4 binary search variants and 3 hashing/string problems under time pressure.

Reward

Your error rate drops because you start trusting your decision patterns.

Auto-tracked from course progress

Week 5

Two Pointer Sprint

May 25 - May 31, 2026

Move into one of the highest-return interview blocks.

Weekly mission

0 / 4 tasks complete

Target: 12-16 lessons

Mastery wins: 8 mastery wins

Complete 7 two-pointer lessons

Progress: 0 / 7

Master 8 lessons in the two-pointer/sliding-window block

Progress: 0 / 8

Clear the two-pointer boss set

Progress: 0 / 4

Finish KMP or first-occurrence string matching work

Progress: 0 / 2

Boss Battle

Clear two sum II, is subsequence, container with most water, three sum, and trapping rain water review.

Reward

You unlock one of the cleanest pattern families in interviews.

Auto-tracked from course progress

Week 6

Sliding Window Wave

Jun 01 - Jun 07, 2026

Stay inside one mental model until it becomes instinctive.

Weekly mission

0 / 4 tasks complete

Target: 10-14 lessons

Mastery wins: 8 mastery wins

Complete the 4 sliding-window cornerstone lessons

Progress: 0 / 4

Master all 4 cornerstone sliding-window lessons

Progress: 0 / 4

Reach 12 completed lessons in the combined pointers/window module

Progress: 0 / 12

Hit 8 mastery wins in the combined pointers/window module

Progress: 0 / 8

Boss Battle

Solve longest substring, character replacement, permutation in string, and sliding window maximum with no notes.

Reward

You gain a pattern that shows up again and again in interview rounds.

Auto-tracked from course progress

Week 7

Tree Traversal Week

Jun 08 - Jun 14, 2026

Start the tree mountain with traversal fluency first.

Weekly mission

0 / 4 tasks complete

Target: 16-20 lessons

Mastery wins: 9 mastery wins

Complete 12 binary-tree lessons

Progress: 0 / 12

Clear the traversal boss set

Progress: 0 / 6

Master 9 binary-tree lessons

Progress: 0 / 9

Finish both level-order approaches

Progress: 0 / 2

Boss Battle

Do preorder, inorder, postorder, level order, and max depth in one revision block.

Reward

Trees stop looking like a wall and start looking like a toolkit.

Auto-tracked from course progress

Week 8

Tree Problems Deep Dive

Jun 15 - Jun 21, 2026

Turn traversal knowledge into actual interview problem solving.

Weekly mission

0 / 4 tasks complete

Target: 15-18 lessons

Mastery wins: 9 mastery wins

Reach 22 completed binary-tree lessons overall

Progress: 0 / 22

Complete the medium tree boss set

Progress: 0 / 5

Master 14 binary-tree lessons overall

Progress: 0 / 14

Finish both symmetric-tree approaches

Progress: 0 / 2

Boss Battle

Solve 5 medium tree problems across recursion and BFS styles in a timed set.

Reward

You unlock real interview-grade confidence in trees.

Auto-tracked from course progress

Week 9

BST and Heap Power-Up

Jun 22 - Jun 28, 2026

Exploit structure and ordering instead of brute force.

Weekly mission

0 / 4 tasks complete

Target: 14-18 lessons

Mastery wins: 9 mastery wins

Complete 5 BST lessons

Progress: 0 / 5

Complete 10 heap / priority queue lessons

Progress: 0 / 10

Master 9 lessons across BST and heaps

Progress: 0 / 9

Clear the BST and heap boss set

Progress: 0 / 5

Boss Battle

Solve validate BST, kth smallest, kth largest, top K frequent, and last stone weight in one stretch.

Reward

You gain stronger judgment about when sorted structure can save time.

Auto-tracked from course progress

Week 10

Graph Foundation Week

Jun 29 - Jul 05, 2026

Build graph comfort before touching the bigger algorithms.

Weekly mission

0 / 4 tasks complete

Target: 14-18 lessons

Mastery wins: 10 mastery wins

Complete 10 foundation graph lessons

Progress: 0 / 10

Master 10 graph lessons

Progress: 0 / 10

Clear the graph foundation boss set

Progress: 0 / 4

Reach 12 completed graph lessons overall

Progress: 0 / 12

Boss Battle

Solve one BFS graph problem, one DFS graph problem, and one topo-style problem in one timed block.

Reward

Graphs stop feeling like chaos and start feeling like traversal choices.

Auto-tracked from course progress

Week 11

Backtracking and Greedy Split

Jul 06 - Jul 12, 2026

Switch between exhaustive search and smart local decisions without confusion.

Weekly mission

0 / 4 tasks complete

Target: 18-22 lessons

Mastery wins: 10 mastery wins

Complete 8 backtracking lessons

Progress: 0 / 8

Complete 8 greedy lessons

Progress: 0 / 8

Master 10 lessons across backtracking and greedy

Progress: 0 / 10

Clear the mixed boss set

Progress: 0 / 5

Boss Battle

Solve subsets or permutations, one combination sum, one interval problem, and one scheduling greedy problem.

Reward

You unlock variety without feeling scattered.

Auto-tracked from course progress

Week 12

Dynamic Programming Launch

Jul 13 - Jul 19, 2026

Start with the most common DP patterns, not every possible DP trick.

Weekly mission

0 / 4 tasks complete

Target: 16-20 lessons

Mastery wins: 10 mastery wins

Complete 12 dynamic-programming lessons

Progress: 0 / 12

Master 10 dynamic-programming lessons

Progress: 0 / 10

Clear the DP boss set

Progress: 0 / 5

Reach the halfway point of the DP module

Progress: 0 / 10

Boss Battle

Do 5 DP problems where you must explain state, transition, and base cases aloud before coding.

Reward

DP becomes structured instead of mystical.

Auto-tracked from course progress

Week 13

Final Boss Month-End

Jul 20 - Jul 26, 2026

Shift from learning mode to interview mode.

Weekly mission

0 / 4 tasks complete

Target: Remaining lessons to close the syllabus

Mastery wins: 12 mastery wins

Reach 100% overall course completion

Progress: 0% / 100%

Master 60% of the full course

Progress: 0% / 60%

Complete the Tries module

Progress: 0 / 4

Clear all starred hard problems to mastery

Progress: 0 / 0

Boss Battle

Run 3 mixed mock sets, clear your starred backlog aggressively, and close the biggest unfinished module.

Reward

You end the 3-month cycle with a system, not just a pile of solved questions.

Auto-tracked from course progress

Live course progress

Track the full public Namaste DSA course outline with persistent checkmarks stored in your browser. This is the momentum layer that gives you visible completion feedback while you work through the syllabus.

View source outline

Today's revision pick

Complete a few lessons first and this banner will start surfacing older completed questions for daily revision.

Completion tracker

0% complete

0 / 236 lessons completed at least once

Remaining

236

Completed today: 0

Mastery tracker

0% mastered

0 / 236 lessons earned the mastery badge

Target

2 revisions

Earned after 2 revision passes, or 4 if the problem is starred as hard.

Completed today

0

Small wins count. Keep the chain moving.

Current streak

0

Days in a row with completion or revision activity.

Best streak

0

Your longest active run so far.

Tracked modules

20

From Introduction to Tries.

0 lessons have earned the mastered badge after 2 successful revision passes.

1 Introduction

0 / 2 completed

0%

2 Warm Up

0 / 11 completed

0%

3 Time/Space Complexity

0 / 1 completed

0%

4 Arrays - Easy/Medium

0 / 9 completed

0%

5 Recursion - Easy/Medium

0 / 6 completed

0%

6 Searching & Sorting - Easy/Medium

0 / 6 completed

0%

7 Linked List - Easy/Medium

0 / 20 completed

0%

8 Strings - Easy/Medium

0 / 15 completed

0%

9 Stack and Queues

0 / 14 completed

0%

10 Binary Search Algorithm

0 / 12 completed

0%

11 Two Pointers & Sliding Window

0 / 13 completed

0%

12 Binary Tree

0 / 26 completed

0%

13 Binary Search Tree

0 / 6 completed

0%

14 Heap / Priority Queue

0 / 14 completed

0%

15 Hashing

0 / 19 completed

0%

16 Backtracking

0 / 13 completed

0%

17 Greedy Algorithm

0 / 14 completed

0%

18 Dynamic Programming

0 / 20 completed

0%

19 Graphs

0 / 30 completed

0%

20 Tries

0 / 4 completed

0%

Phase plan

Foundation Audit And Cleanup

Convert current DSA work from scattered practice into a reliable base.

  • • Classify existing files into solid, needs revisit, and incomplete
  • • Re-solve weak array, recursion, sorting, linked-list, string, and stack/queue questions
  • • Create a short weak-topics list that drives the next phase

Topic-By-Topic Course Completion

Finish Namaste DSA in pattern blocks instead of random question hopping.

  • • Learn pattern, solve easy problems, then medium problems
  • • Add 1-2 selective hard problems for interview-heavy topics
  • • Do mini checkpoints before moving to the next topic

Revision Loop Running In Parallel

Prevent forgetting earlier topics while new topics are still being added.

  • • Re-solve one old problem daily
  • • Review one failed or slow problem every 3-4 days
  • • Run one mixed revision set every week

Interview-Readiness Layer

Practice solving and explaining under time pressure before interviews start.

  • • Start timed mocks after the first major half of the syllabus
  • • Track speed, clarity, edge-case handling, and correctness
  • • Finish with mixed sets instead of only topic-based practice

Weekly cadence

Weekdays

  • • 45-60 min: new topic problems
  • • 20-25 min: re-solve or weak problem
  • • 10-15 min: notes, complexity, and edge-case review

Weekends

  • • 90-120 min: deeper topic block or selective hard problem
  • • 30-45 min: mixed revision set
  • • 20-30 min: audit cleanup, mistake review, and next-week planning

Tracker buckets

NewSolved with helpSolved independentlyNeeds re-solve

Promotion rule: a problem only becomes solved independently after one clean re-solve without help.

Topic roadmap

Follow this order instead of hopping randomly across the course.

Complexity, arrays, strings, recursion

Foundation built

Clean weak spots and finish remaining basics before moving on.

Searching and sorting

Partially built

Finish merge sort and tighten edge cases in current practice files.

Linked lists

Strong head start

Revisit rotation and deletion edge cases, then keep this as a strength area.

Stacks and queues

Good base

Keep monotonic-stack problems fresh and clean up draft-style implementations.

Hashing

Light coverage

Promote hashmap thinking from string problems into dedicated pattern work.

Two pointers

Not started

Treat as a high-priority interview pattern block.

Sliding window

Not started

Study immediately after two pointers because the techniques overlap.

Trees

Not started

Make this the first major untouched data-structure block.

BST

Not started

Follow trees while traversal and recursion patterns are fresh.

Heaps / priority queue

Not started

Add once tree comfort is established.

Graphs

Early glimpse only

Build from BFS/DFS basics before moving to harder graph variants.

Advanced / remaining course topics

Later phase

Only after easy + medium mastery is stable.

Current audit

This is your starting point for Phase 1. Use it to decide what to keep, what to re-solve, and what to postpone until later.

Warm-up and core basics

Good problem count, but several files still read like practice drafts instead of interview-ready references.

Needs revisit

countDigits.js

Needs revisit

Contains debug-driven exploration rather than final reference quality.

palindrome.js

Needs revisit

Multiple variants and debug output make it better as a revisit problem.

reverseNumber.js

Needs revisit

Keep as a re-solve candidate to lock overflow and sign handling.

secondLargest.js

Needs revisit

Useful warm-up, but it still has exploratory logging.

starPattern.js

Needs revisit

Pattern practice is helpful, but not a high-priority interview reference file.

sumOfN.js

Needs revisit

Treat as a quick fundamentals refresher rather than a finished anchor problem.

Arrays and strings

This is a solid starting area and should mostly shift into re-solve mode.

Foundation built

removeDuplicates.js

Solid

removeElement.js

Solid

mergeArray.js

Solid

missingNumber.js

Solid

singleNumber.js

Solid

stock.js

Solid

reverseString.js

Solid

String_anagram.js

Solid

String_Isomorphic.js

Solid

String_JewelsAndStones.js

Solid

String_LargestOddNumber.js

Solid

String_LengthOfLastWord.js

Solid

Strings_BalancedStrings.js

Solid

String_groupAnagram.js

Needs revisit

Two solutions are useful, but the optimized key generation should be reviewed once more.

String_ReverseString.js

Needs revisit

Keep this in the re-solve bucket until the pattern feels automatic.

Strings_FrequentVowelsAndConsonant.js

Needs revisit

A good candidate for hashing-focused cleanup.

Recursion, searching, and sorting

You already started the essentials, but this area still needs one cleanup pass before it is interview-ready.

Partially built

Recursion_Factorial.js

Solid

Recursion_Fibonacci.js

Solid

Recursion_PowerOfTwo.js

Solid

recursion_SumOfArray.js

Needs revisit

Good concept coverage, but it should be re-solved from memory.

binarySearch.js

Solid

bubbleSort.js

Needs revisit

Keep as revision, not as a finished reference implementation.

selectionSort.js

Needs revisit

Good for fundamentals, but not yet a locked-in strength.

insertionSort.js

Needs revisit

Worth re-solving once more to strengthen loop invariants.

mergeSort.js

Incomplete

Still empty and should be completed during Phase 1.

Linked lists

This is currently your strongest topic family and should become one of your dependable interview areas.

Strong head start

LinkedList_Reverse.js

Solid

LinkedList_cycle.js

Solid

LinkedList_MergeSortedList.js

Solid

LinkedList_remove_nth.js

Solid

LinkedList_OddEven.js

Solid

LinkedList_Palindrome.js

Solid

LinkedList_intersection.js

Solid

LinkedList.removeNode.js

Needs revisit

Keep for revision because naming and presentation still feel draft-like.

LinkedList_Rotate.js

Needs revisit

Edge cases around empty input and full rotations should be revisited.

Stacks and queues

You already have the right problem mix here. The next step is polish, not starting over.

Good base

Stack_ValidParens.js

Solid

Stack_DailyTemperature.js

Solid

Stack_NextGreaterElement.js

Solid

Stack_NextGreaterElement2.js

Solid

Stack_QueueUsingStacks.js

Needs revisit

Useful pattern, but keep it in the re-solve bucket until it feels automatic.

Stack_StackUsingQueue.js

Needs revisit

Contains multiple implementations and is better treated as revision material.

Queue_Rotting_Oranges.js

Needs revisit

Logic is close, but debug logs and BFS polish are still needed.

High-priority gaps

These topics should drive the next major phase after Phase 1 cleanup is done.

Not started yet

Two pointers

Missing

High interview value and currently absent from the repo.

Sliding window

Missing

Should follow two pointers immediately.

Trees

Missing

The biggest untouched data-structure block.

BST

Missing

Schedule directly after trees.

Heaps / priority queue

Missing

Add after trees and BST.

Graphs

Early glimpse only

You have rotting oranges, but not a full graph foundation yet.

Recurring mistakes to track

  • • Off-by-one errors
  • • Pointer movement and loop boundaries
  • • Hashmap bookkeeping
  • • Recursion base cases
  • • Tree traversal choice
  • • Graph visited-state bugs

Readiness checks

  • • Solve common easy problems quickly and cleanly
  • • Solve medium problems with structure and reasonable speed
  • • Explain time complexity, space complexity, and edge cases aloud
  • • Complete 8-12 timed mock sessions before calling yourself interview-ready
  • • Clear your major re-solve backlog instead of only stacking new problems