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

Invariants Proving correctness 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.