同样是 O(n log n)，为什么快排更快
快排和堆排都是 O(n log n)，实测差两三倍。差在哪？
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.
大 O 有意扔掉了常数和低阶项，而在真实机器上，被扔掉的那些经常就是全部的差别 —— 一次 L1 命中约 1ns，一次内存访问约 100ns，两个数量级。
这一份逼你算数：动态数组扩容为什么必须翻倍、建堆到底是 O(n) 还是 O(n log n)、1 秒时限下 n=10⁵ 排除了哪些复杂度。答「更快」一律要追「快多少」。
它是 04、05、10 那几份的地基，建议早做。
What this one drills
This prompt in the repo (the answer key is at the end of that file — you'll see it)
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
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
- Pick one, open it, copy the prompt.
- Paste it into a brand-new conversation, say nothing, and wait for its first question.
- 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.
Sign in to write a note.