抄作业 / 做成了什么 / Grok Bot

做了什么

Interactive bubble map of every LeetCode problem by shared tags—static site created by Grok Bot and published on GitHub Pages.

场景

盯 PR / 仓库 社媒排期 写代码上线

资料完整度

• ✓ 作者与原链接有
• ✓ 做了什么有
• ✓ 来源原文摘录有
• — 截图 / 媒体来源未提供
• ✓ 步骤 / 章节有
• — 提示词 / 配置原文来源未提供
• — 结果 / 数字来源未提供
• ✓ 风险提示有
• ✓ 相关条目有

— 表示来源没有给出，本站不补写。

来源原文摘录

An interactive map of every LeetCode problem. Bubbles that sit near each other share topic tags. A problem belongs to every tag it carries, so questions with several tags rest between those clusters instead of being forced into a single bucket.

摘自项目 README，照录原文，未翻译。

来源里的步骤 / 要点

1. Color is difficulty: green Easy, amber Medium, rose Hard.
2. Nearness means the problems share specific topic tags. Rarer tags pull harder than broad ones, so Array does not swallow the whole map.
3. Dashed lines on hover connect a problem to each of its tag clusters. That is the overlap: one bubble, several memberships.
4. Solid lines are high similarity scores. They appear for the bubble under the pointer, and between neighbors when you have zoomed or filtered to a readable nei…
5. Tag selection highlights membership without clearing the map. Dimmed bubbles are outside the selection.
6. Match all is the intersection. Array and Two Pointers highlights only problems that carry both.
7. Match any is the union.
8. Search and the difficulty switches hide non-matches.

照录来源原文，未翻译。

提示词

来源没有给出可直接复制的提示词原文。

怎么复制

1. 打开仓库：github.com/WilliamZhang20/leetcode-clusters ↗
2. 读 README，把仓库链接发给你的 Bot，让它按 README 复现
3. 先在小范围跑通，再加 routine

风险与限制

• 作者的结果不保证能复现，以原帖为准

用量预估

用金属计算器估一下