šŸ¦†THE RUBBER DUCK
Launch →
✨stop copy-pasting solutions. start solving.

Solve DSA problemswithout the answer key.

The Rubber Duck is a Socratic companion for algorithm problems. It never gives you the solution — it asks the right questions until you find it yourself.

session — sliding window
duck
What is the absolute brute-force approach here?
you
I guess I'd check every subarray with two nested loops... O(n²)
duck
Good. Now — what redundant work are those nested loops doing that you could eliminate?
you
Wait... I'm recalculating the sum from scratch each time. I could just slide the window and subtract/add...
duck
There it is. What's the time complexity now?
you
The Duck Asks

Questions that trigger "Aha!" moments

"Where exactly does your current logic break at the edge cases?"

"If you can't use a Hash Map, what's your next move?"

Answering these questions is usually enough to crack the problem.

The duck doesn't solve — you do.

Process

Three steps to the optimal solution

01

Paste the Problem

Drop your DSA problem statement. Two Sum, LRU Cache, whatever's keeping you up.

02

Think Out Loud

The Duck asks Socratic questions — forcing you to articulate your brute force and bottlenecks.

03

Own the Solution

No spoon-fed answers. You arrive at the O(n) math yourself, building true intuition.

Why This Works

Stop grinding. Start understanding.

Never gives you the answer

Forces you to reason through brute force → optimal on your own.

Builds real intuition

Answering 'why does this break at edge cases?' is worth 10 LeetCode submits.

Works for any pattern

Sliding window, DP, graphs, greedy — the duck adapts to your problem.

{ }

Free. No signup. Ever.

No accounts. No paywalls. Just you, the duck, and the algorithm.