Kacam.net

Algorithms

单调栈:什么形状的题会塌成它

模板八行,难的是看见一道新题认出它是这个形状。

Copy the prompt, then pick a model. It plays the interviewer and asks you through it scene by scene instead of handing you the answer.

On a phone with the app installed, the system opens the app directly. Links cannot open external apps inside WeChat — open it in a browser first.

The copied text ends with the answer key the model grades you against. Don't read it yourself first — working it out on your own is the point.

能用单调栈的题只有一个形状:对每个元素找左边或右边第一个比它大/小的。所有变体都是这句话的换皮。

这一份的中心是一问:弹出栈顶的那一刻,你同时知道了哪几件事? 说得出三件(被弹的元素、它右边第一个更大的、它左边第一个更大的)就懂了为什么一遍扫描够用。

最后一幕给三道题让你认形状,其中一道故意不是栈。

★★★☆☆ · about 35 min · Tests: 问题形状的识别、栈里存什么、弹出时的结算、和单调队列的分界

What this one drills

Choosing a structure Amortised analysis Boundary conditions

Have you done this one?

Sign in to mark this one as practised — next time you come back you'll see when you did it.

Notes from people who did this one

Nobody has written yet. After you run it, say what came out of the conversation — which scene stumped you, which conclusion you changed afterwards.

Sign in to write a note.

How to use this

This set teaches rather than interrogates: it guides you instead of pressing until you have nothing left to say. When you're stuck it first asks which layer you're stuck at (never heard of it / know it but not why / know why but can't write it), then decides what to give. Only after guiding you twice on the same point will it spell the answer out — and then it asks you to say it back in your own words.

How to start

  1. Pick one, open it, copy the prompt.
  2. Paste it into a brand-new conversation, say nothing, and wait for its first question.
  3. Trace by hand before you write code — it will interrupt you. Walking through an array of length 2 beats writing the template ten times.

Four commands you can call out at any time

  • 跳过 move to the next scene now
  • 换个说法 explain this bit again from another angle
  • 直说吧 spell the answer out, then make me say it back
  • 复盘 jump to the wrap-up and print the review card

Three traps

  • Don't read the answer key at the end first — that "how people get it wrong" section is the answer to every question it will ask you.
  • Don't rush to code. With algorithms, writing code is the easiest way to hide the fact that you haven't actually thought it through.
  • When it starts praising you, point it back to the "don't praise me" rule. Guiding is not coddling.

Can't come up with a solution? Start with defining the DP state. Always off by one? Binary search and prefix sums. Can't recognise the shape of a problem? Monotonic stack and sliding window. The complexity one underpins several others — do it early.