Hi

\",\n});\n```\n\n## Val Town Utility Functions\n\nVal Town provides several utility functions to help with common project tasks.\n\n### Importing Utilities\n\nAlways import utilities with version pins to avoid breaking changes:\n\n```ts\nimport {\n parseProject,\n readFile,\n serveFile,\n} from \"https://esm.town/v/std/utils@85-main/index.ts\";\n```\n\n### Available Utilities\n\n#### **serveFile** - Serve project files with proper content types\n\nFor example, in Hono:\n\n```ts\n// serve all files in frontend/ and shared/\napp.get(\"/frontend/*\", (c) => serveFile(c.req.path, import.meta.url));\napp.get(\"/shared/*\", (c) => serveFile(c.req.path, import.meta.url));\n```\n\n#### **readFile** - Read files from within the project:\n\n```ts\n// Read a file from the project\nconst fileContent = await readFile(\"/frontend/index.html\", import.meta.url);\n```\n\n#### **listFiles** - List all files in the project\n\n```ts\nconst files = await listFiles(import.meta.url);\n```\n\n#### **parseProject** - Extract information about the current project from import.meta.url\n\nThis is useful for including info for linking back to a val, ie in \"view source\"\nurls:\n\n```ts\nconst projectVal = parseProject(import.meta.url);\nconsole.log(projectVal.username); // Owner of the project\nconsole.log(projectVal.name); // Project name\nconsole.log(projectVal.version); // Version number\nconsole.log(projectVal.branch); // Branch name\nconsole.log(projectVal.links.self.project); // URL to the project page\n```\n\nHowever, it's _extremely importing_ to note that `parseProject` and other\nStandard Library utilities ONLY RUN ON THE SERVER. If you need access to this\ndata on the client, run it in the server and pass it to the client by splicing\nit into the HTML page or by making an API request for it.\n\n## Val Town Platform Specifics\n\n- **Redirects:** Use\n `return new Response(null, { status: 302, headers: { Location: \"/place/to/redirect\" }})`\n instead of `Response.redirect` which is broken\n- **Images:** Avoid external images or base64 images. Use emojis, unicode\n symbols, or icon fonts/libraries instead\n- **AI Image:** To inline generate an AI image use:\n `

`\n- **Storage:** DO NOT use the Deno KV module for storage\n- **Browser APIs:** DO NOT use the `alert()`, `prompt()`, or `confirm()` methods\n- **Weather Data:** Use open-meteo for weather data (doesn't require API keys)\n unless otherwise specified\n- **View Source:** Add a view source link by importing & using\n `import.meta.url.replace(\"ems.sh\", \"val.town)\"` (or passing this data to the\n client) and include `target=\"_top\"` attribute\n- **Error Debugging:** Add\n `` to HTML to capture\n client-side errors\n- **Error Handling:** Only use try...catch when there's a clear local\n resolution; Avoid catches that merely log or return 500s. Let errors bubble up\n with full context\n- **Environment Variables:** Use `Deno.env.get('keyname')` when you need to, but\n generally prefer APIs that don't require keys\n- **Imports:** Use `https://esm.sh` for npm and Deno dependencies to ensure\n compatibility on server and browser\n- **Storage Strategy:** Only use backend storage if explicitly required; prefer\n simple static client-side sites\n- **React Configuration:** When using React libraries, pin versions with\n `?deps=react@18.2.0,react-dom@18.2.0` and start the file with\n `/** @jsxImportSource https://esm.sh/react@18.2.0 */`\n- Ensure all React dependencies and sub-dependencies are pinned to the same\n version\n- **Styling:** Default to using TailwindCSS via\n `` unless otherwise\n specified\n\n## Project Structure and Design Patterns\n\n### Recommended Directory Structure\n\n```\n├── backend/\n│ ├── database/\n│ │ ├── migrations.ts # Schema definitions\n│ │ ├── queries.ts # DB query functions\n│ │ └── README.md\n│ └── routes/ # Route modules\n│ ├── [route].ts\n│ └── static.ts # Static file serving\n│ ├── index.ts # Main entry point\n│ └── README.md\n├── frontend/\n│ ├── components/\n│ │ ├── App.tsx\n│ │ └── [Component].tsx\n│ ├── favicon.svg\n│ ├── index.html # Main HTML template\n│ ├── index.tsx # Frontend JS entry point\n│ ├── README.md\n│ └── style.css\n├── README.md\n└── shared/\n ├── README.md\n └── utils.ts # Shared types and functions\n```\n\n### Backend (Hono) Best Practices\n\n- Hono is the recommended API framework\n- Main entry point should be `backend/index.ts`\n- **Static asset serving:** Use the utility functions to read and serve project\n files:\n ```ts\n import {\n readFile,\n serveFile,\n } from \"https://esm.town/v/std/utils@85-main/index.ts\";\n\n // serve all files in frontend/ and shared/\n app.get(\"/frontend/*\", (c) => serveFile(c.req.path, import.meta.url));\n app.get(\"/shared/*\", (c) => serveFile(c.req.path, import.meta.url));\n\n // For index.html, often you'll want to bootstrap with initial data\n app.get(\"/\", async (c) => {\n let html = await readFile(\"/frontend/index.html\", import.meta.url);\n\n // Inject data to avoid extra round-trips\n const initialData = await fetchInitialData();\n const dataScript = ``;\n\n html = html.replace(\"\", `${dataScript}`);\n return c.html(html);\n });\n ```\n- Create RESTful API routes for CRUD operations\n- Always include this snippet at the top-level Hono app to re-throwing errors to\n see full stack traces:\n ```ts\n // Unwrap Hono errors to see original error details\n app.onError((err, c) => {\n throw err;\n });\n ```\n\n### Database Patterns\n\n- Run migrations on startup or comment out for performance\n- Change table names when modifying schemas rather than altering\n- Export clear query functions with proper TypeScript typing\n\n## Common Gotchas and Solutions\n\n1. **Environment Limitations:**\n - Val Town runs on Deno in a serverless context, not Node.js\n - Code in `shared/` must work in both frontend and backend environments\n - Cannot use `Deno` keyword in shared code\n - Use `https://esm.sh` for imports that work in both environments\n\n2. **SQLite Peculiarities:**\n - Limited support for ALTER TABLE operations\n - Create new tables with updated schemas and copy data when needed\n - Always run table creation before querying\n\n3. **React Configuration:**\n - All React dependencies must be pinned to 18.2.0\n - Always include `@jsxImportSource https://esm.sh/react@18.2.0` at the top of\n React files\n - Rendering issues often come from mismatched React versions\n\n4. **File Handling:**\n - Val Town only supports text files, not binary\n - Use the provided utilities to read files across branches and forks\n - For files in the project, use `readFile` helpers\n\n5. **API Design:**\n - `fetch` handler is the entry point for HTTP vals\n - Run the Hono app with\n `export default app.fetch // This is the entry point for HTTP vals`",[206],"a00171c6-1738-4619-81f5-b8654fa1d1c4","2026-08-03.ts","f954f66c-8f76-11f1-8627-1607ee4eb77e",1119,["D",1785789508612],38,"import { assertEquals } from \"jsr:@std/assert@1.0.19\";\n//Given an array of strings A, and an array of indexes B, reorder the strings in array A with the given indices in array B. You can choose to do this in-place, or return a new array. As you decide which route to take, think... which is more efficient?\n\nfunction reorder(a: string[], b: number[]): string[] {\n return Object.values(Object.fromEntries(a.map((s, i) => [b[i], s])));\n}\n\nconst a = [\"C\", \"D\", \"E\", \"F\", \"G\", \"H\"];\nconst b = [3, 0, 4, 1, 2, 5];\n\nassertEquals(reorder(a, b), [\"D\", \"F\", \"G\", \"C\", \"E\", \"H\"]);\nconsole.log(\"test passes\");",[213],"239db67c-586d-4a56-9ab1-bafd89f2f610","2026-07-27.ts","19f58758-8d5e-11f1-9ce2-1607ee4eb77e",1057,["D",1785560089906],61,"import { assertEquals } from \"jsr:@std/assert@1.0.19\";\n\nfunction fulfilledOrdersBeforeFailure(\n orders: string[][],\n stock: Record,\n): number {\n let fulfilled = 0;\n\n for (const order of orders) {\n const counts: Record = {};\n\n for (const flavor of order) {\n counts[flavor] = (counts[flavor] ?? 0) + 1;\n }\n\n for (const [flavor, count] of Object.entries(counts)) {\n if ((stock[flavor] ?? 0) < count) return fulfilled;\n }\n\n for (const [flavor, count] of Object.entries(counts)) {\n stock[flavor] -= count;\n }\n\n fulfilled++;\n }\n\n return fulfilled;\n}\n\nassertEquals(\n fulfilledOrdersBeforeFailure(\n [[\"chocolate\"], [\"chocolate\"], [\"chocolate\"]],\n { chocolate: 2 },\n ),\n 2,\n);\n\nassertEquals(\n fulfilledOrdersBeforeFailure(\n [[\"vanilla\", \"vanilla\"], [\"chocolate\", \"mint\"], [\"strawberry\"], [\n \"strawberry\",\n \"mint\",\n ]],\n { vanilla: 2, chocolate: 1, mint: 1, strawberry: 5 },\n ),\n 3,\n);\n\nassertEquals(\n fulfilledOrdersBeforeFailure(\n [[\"rocky road\"], [\"vanilla\"]],\n { vanilla: 3 },\n ),\n 0,\n);\n\nconsole.log(\"All tests pass\");",[221],"90cb55af-c47b-4548-ba6d-7033a7577222","2026-07-06.ts","0effb9a2-79ba-11f1-9fd0-1607ee4eb77e",993,["D",1783399548124],47,"import { assertEquals } from \"jsr:@std/assert@1.0.19\";\n\nconst isInBounds = (limit: number, target: number): boolean =>\n\ttarget >= 0 && target <= limit - 1;\n\nfunction within(x: number, n: number): number[] {\n\treturn Array.from({ length: 2 * n + 1 }, (_, i) => x - n + i);\n}\n\nfunction getImpactedCoordinates(\n\tn: number,\n\tm: number,\n\tsize: number,\n\trow: number,\n\tcol: number,\n) {\n\tconst radius = Math.floor(size / 2);\n\tconst impacted: number[][] = [];\n\n\tfor (const x of within(row, radius)) {\n\t\tfor (const y of within(col, radius)) {\n\t\t\tif (isInBounds(n, x) && isInBounds(m, y)) {\n\t\t\t\timpacted.push([x, y]);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn impacted;\n}\n\nassertEquals(getImpactedCoordinates(5, 5, 3, 1, 1), [\n\t[0, 0],\n\t[0, 1],\n\t[0, 2],\n\t[1, 0],\n\t[1, 1],\n\t[1, 2],\n\t[2, 0],\n\t[2, 1],\n\t[2, 2],\n]);\nassertEquals(getImpactedCoordinates(3, 3, 1, 2, 1), [[2, 1]]);\nassertEquals(\n\tgetImpactedCoordinates(5, 5, 3, 4, 4),\n\t[[3, 3], [3, 4], [4, 3], [4, 4]],\n);\n\nconsole.log(\"All tests pass\");",[229],"764bf32c-80d0-435d-be18-660348509ad8","2026-06-29.ts","783e61e4-73d3-11f1-8ea5-1607ee4eb77e",945,["D",1783230860054],43,"import { assertEquals } from \"jsr:@std/assert@1.0.19\";\n\nconst bitLength = (x: number) => x === 0 ? 1 : Math.floor(Math.log2(x)) + 1;\n\nfunction meanBits(n: number): number {\n\tlet result = 0;\n\tfor (let i = 0; i <= n - 1; i++) {\n\t\tresult += bitLength(i);\n\t}\n\treturn result / n;\n}\n\nassertEquals(meanBits(6), 2.00);\nconsole.log(\"all tests pass\");",[237],"06c3c2de-b0cd-492c-9333-9bb36d9f2464","2026-06-22.ts","07d46672-6e5d-11f1-b399-1607ee4eb77e",898,["D",1782157151844],106,"import { assertEquals } from \"jsr:@std/assert@1.0.19\";\n\nconst getMs = (d: string): number => (new Date(d)).getTime();\n\nfunction shouldAutoReply(u: string[][], o: string[], m: string): boolean {\n\tif (!u.every((range) => range.length === 2)) {\n\t\tthrow new Error(\"All ranges should have exactly two dates\");\n\t}\n\tconst msgMs: number = getMs(m);\n\tconst overridesMs: number[] = o.map(getMs);\n\n\tif (overridesMs.includes(msgMs)) return false;\n\n\treturn u.some(([start, end]) => {\n\t\tconst startMs = getMs(start);\n\t\tconst endMs = getMs(end);\n\t\treturn startMs <= msgMs && msgMs <= endMs;\n\t});\n}\n\nconst unavailableRanges1 = [[\"2026-07-01\", \"2026-07-10\"], [\n\t\"2026-08-15\",\n\t\"2026-08-20\",\n]];\nconst overrideDates1 = [\"2026-07-04\"];\nconst messageDate1 = \"2026-07-05\";\n\nconst unavailableRanges2 = [[\"2026-07-01\", \"2026-07-10\"]];\nconst overrideDates2 = [\"2026-07-04\"];\nconst messageDate2 = \"2026-07-04\";\n\nconst unavailableRanges3 = [[\"2026-07-01\", \"2026-07-10\"]];\nconst overrideDates3 = [];\nconst messageDate3 = \"2026-07-11\";\n\nassertEquals(\n\tshouldAutoReply(unavailableRanges1, overrideDates1, messageDate1),\n\ttrue,\n);\nassertEquals(\n\tshouldAutoReply(unavailableRanges2, overrideDates2, messageDate2),\n\tfalse,\n);\nassertEquals(\n\tshouldAutoReply(unavailableRanges3, overrideDates3, messageDate3),\n\tfalse,\n);\nconsole.log(\"all tests pass\");",[245],"b3bf9152-5b19-11f1-aba7-ee650bb23af1","2026-05-25.ts","bc4310aa-5b15-11f1-8c7c-ee650bb23af1",774,["D",1780030137284],73,"import { assertEquals } from \"jsr:@std/assert@1.0.19\";\n\nfunction shuffleLine(queue: T[], n: number): T[] {\n if (n <= 1) return queue;\n\n const keep: T[] = [];\n const move: T[] = [];\n\n for (let i = 0; i < queue.length; i++) {\n ((i + 1) % n === 0 ? move : keep).push(queue[i]);\n }\n\n return [...keep, ...move];\n}\n\nassertEquals(\n shuffleLine([\"Ada\", \"Ben\", \"Cam\", \"Diya\", \"Eli\", \"Fay\"], 3),\n [\"Ada\", \"Ben\", \"Diya\", \"Eli\", \"Cam\", \"Fay\"],\n);\n\nassertEquals(\n shuffleLine([\"A\", \"B\", \"C\", \"D\", \"E\"], 2),\n [\"A\", \"C\", \"E\", \"B\", \"D\"],\n);\n\nassertEquals(shuffleLine([\"Mo\", \"Noah\", \"Oli\"], 1), [\"Mo\", \"Noah\", \"Oli\"]);\n\nconsole.log(\"all tests pass\");",[253],"013a6a96-53ff-11f1-bcb2-ee650bb23af1","2026-05-18.ts","ee458f84-53f3-11f1-bf48-ee650bb23af1",698,["D",1779249012739],95,"import { assertEquals } from \"jsr:@std/assert@1.0.19\";\n\nfunction toggleChar(s: string, alternating = false): string {\n if (!alternating) {\n return s\n .split(\"\")\n .map((c) => {\n if (/[a-z]/.test(c)) return c.toUpperCase();\n if (/[A-Z]/.test(c)) return c.toLowerCase();\n return c;\n })\n .join(\"\");\n }\n\n let upper = true;\n\n return s\n .split(\"\")\n .map((c) => {\n if (!/\\w/.test(c)) return c;\n const o = upper ? c.toUpperCase() : c.toLowerCase();\n upper = !upper;\n return o;\n })\n .join(\"\");\n}\n\nassertEquals(toggleChar(\"Hello, world!\"), \"hELLO, WORLD!\");\nassertEquals(toggleChar(\"HeheHeheHEheheHeH\"), \"hEHEhEHEheHEHEhEh\");\nassertEquals(\n toggleChar(\"This will be alternated\", true),\n \"ThIs WiLl Be AlTeRnAtEd\",\n);\n\nconsole.log(\"all tests pass\");",[261],"23f5f864-3174-11f1-94fc-42dde27851f2","2026-04-06.ts","bf29969e-3172-11f1-8985-42dde27851f2",602,["D",1775451031435],17,"import { assertEquals } from \"jsr:@std/assert@1.0.19\";\n\nconst p = (n: number): number => {\n if (n === 0) return 3;\n if (n === 1) return 0;\n if (n === 2) return 2;\n return p(n - 2) + p(n - 3);\n};\n\nconst perrinCombinations = (n: number, k: number) => {\n const perrins = new Set();\n for (let i = 0; i <= n; i++) {\n perrins.add(p(i));\n }\n\n const nums = [...perrins].sort();\n const results: number[][] = [];\n\n function search(start: number, current: number[], remaining: number): void {\n if (remaining === 0) {\n results.push([...current]);\n return;\n }\n\n for (let i = start; i < nums.length; i++) {\n if (nums[i] > remaining) break;\n current.push(nums[i]);\n search(i + 1, current, remaining - nums[i]);\n current.pop();\n }\n }\n\n search(0, [], k);\n\n return results;\n};\n\nassertEquals(perrinCombinations(7, 12), [[0, 2, 3, 7], [0, 5, 7], [2, 3, 7], [\n 5,\n 7,\n]]);\n\nassertEquals(perrinCombinations(6, 5), [[0, 2, 3], [0, 5], [2, 3], [5]]);",[269],"7714a13a-2148-11f1-92da-42dde27851f2","2026-03-16.ts","321bf114-2148-11f1-8977-42dde27851f2",536,["D",1773673054426],4,"// > fireStationCoverage([\n// [2, 0, 1],\n// [0, 2, 0],\n// [1, 0, 2]\n// ])\n// > [[2, 1, 0],\n// [1, 2, 1],\n// [0, 1, 2]]\n\n// > fireStationCoverage([\n// [1, 0, 0, 1],\n// [0, 0, 0, 0],\n// [0, 0, 0, 0],\n// [1, 0, 0, 1]\n// ])\n// > [[0, 1, 2, 0],\n// [1, 2, 2, 1],\n// [1, 2, 2, 1],\n// [0, 1, 2, 0]]",[277],"edc863c0-0b54-11f1-a9ed-42dde27851f2","2026-02-16.ts","235703fa-0b52-11f1-8e94-42dde27851f2",531,["D",1771259481951],48,"import { assertEquals } from \"jsr:@std/assert@1.0.18\";\n\nfunction zoom(arr: T[][], k: number): T[][] {\n const zoomed: T[][] = [];\n\n for (const sub of arr) {\n for (let i = 0; i < k; i++) {\n zoomed.push(sub.flatMap((n) => Array.from({ length: k }, () => n)));\n }\n }\n return zoomed;\n}\n\nassertEquals(\n zoom([[1, 2], [3, 4]], 2),\n [\n [1, 1, 2, 2],\n [1, 1, 2, 2],\n [3, 3, 4, 4],\n [3, 3, 4, 4],\n ],\n);\n\nassertEquals(zoom([[7, 8, 9]], 3), [\n [7, 7, 7, 8, 8, 8, 9, 9, 9],\n [7, 7, 7, 8, 8, 8, 9, 9, 9],\n [7, 7, 7, 8, 8, 8, 9, 9, 9],\n]);\n\nassertEquals(zoom([[1], [2]], 3), [\n [1, 1, 1],\n [1, 1, 1],\n [1, 1, 1],\n [2, 2, 2],\n [2, 2, 2],\n [2, 2, 2],\n]);\n\nconsole.log(\"All pass\");",[285],"146d383a-0b54-11f1-be43-42dde27851f2","2026-01-26.ts","04b23810-fad2-11f0-8a5e-42dde27851f2",512,["D",1771259117296],16,"import { assert } from \"jsr:@std/assert@1.0.18\";\nimport { assertEquals } from \"jsr:@std/assert@1.0.18\";\n\nfunction flippedy(s: string): string {\n const vowels = [\"a\", \"i\", \"u\", \"e\", \"o\"];\n const words = s.split(\" \");\n const vowelCount = (word: string) =>\n word.split(\"\").filter((char) => vowels.includes(char)).length;\n return [\n words[0],\n ...words.slice(1).map((w) => {\n return vowelCount(w) === vowelCount(words[0])\n ? w.split(\"\").reverse().join(\"\")\n : w;\n }),\n ].join(\" \");\n}\n\nassert(\"cat dna mice\" === flippedy(\"cat and mice\"));\nassert(\"banana healthy\" === flippedy(\"banana healthy\"));\n\nconsole.log(\"Tests passed\");",[293],"e80a858c-efdc-11f0-b2c8-42dde27851f2","2026-01-12.ts","8adf5eb6-efda-11f0-8843-42dde27851f2",462,["D",1768239251324],"import { assert } from \"jsr:@std/assert@1.0.16/assert\";\nimport { arraysEqual } from \"./solution-utils.ts\";\n\nconst bears = [\n { name: \"Baloo\", hunger: 6 },\n { name: \"Yogi\", hunger: 9 },\n { name: \"Paddington\", hunger: 4 },\n { name: \"Winnie\", hunger: 10 },\n { name: \"Chicago\", hunger: 20 },\n];\n\nconst hungryBears = (bears: { name: string; hunger: number }[]): string[] => {\n const avgHunger = bears.reduce((a, c) => a + c.hunger, 0) / bears.length;\n\n return bears.filter((bear) => bear.hunger > avgHunger).map((bear) =>\n bear.name\n );\n};\n\nassert(arraysEqual([\"Chicago\", \"Winnie\"], hungryBears(bears)));\n\nconsole.log(\"Arrays are equal\");",[301],"a97b3362-a2d3-11f0-ad74-0224a6c84d84","2025-10-06.ts","2f7e5bb2-a2cd-11f0-bb78-0224a6c84d84",411,["D",1759769041358],70,"type Edit = {\n timestamp: string;\n component: string;\n};\n\ntype ChangelogEntry = {\n component: string;\n start: string;\n end: string;\n};\n\nfunction areWithin10Minutes(ts1: string, ts2: string): boolean {\n const diff = Math.abs(new Date(ts1).getTime() - new Date(ts2).getTime());\n const tenMinutesInMs = 10 * 60 * 1000;\n return diff <= tenMinutesInMs;\n}\n\nfunction groupChangelogEdits(edits: Edit[]): ChangelogEntry[] {\n const changelog: ChangelogEntry[] = [];\n\n for (const [index, edit] of edits.entries()) {\n const isEditInChangelog = Boolean(\n changelog.find((entry) => {\n return (\n entry.component === edit.component &&\n (entry.start === edit.timestamp || entry.end === edit.timestamp)\n );\n }),\n );\n\n if (isEditInChangelog) continue;\n\n const nextEdit = edits.find(\n (e) =>\n edit.component === e.component &&\n edits.indexOf(e) !== index &&\n areWithin10Minutes(edit.timestamp, e.timestamp) &&\n new Date(edit.timestamp) < new Date(e.timestamp),\n );\n\n if (nextEdit) {\n changelog.push({\n component: edit.component,\n start: edit.timestamp,\n end: nextEdit.timestamp,\n });\n } else {\n changelog.push({\n component: edit.component,\n start: edit.timestamp,\n end: edit.timestamp,\n });\n }\n }\n\n return changelog;\n}\n\nconst edits: Edit[] = [\n { timestamp: \"2025-10-06T08:00:00Z\", component: \"Header\" },\n { timestamp: \"2025-10-06T08:05:00Z\", component: \"Header\" },\n { timestamp: \"2025-10-06T08:20:00Z\", component: \"Header\" },\n { timestamp: \"2025-10-06T08:07:00Z\", component: \"Footer\" },\n { timestamp: \"2025-10-06T08:15:00Z\", component: \"Footer\" },\n];\n\nconst changelog = groupChangelogEdits(edits);\nconsole.log(changelog);",[308],"8778d77e-a2d3-11f0-8b18-0224a6c84d84","2025-09-29.ts","8e2e8778-9d45-11f0-b4ad-0224a6c84d84",410,["D",1759768984297],3,"import { assert } from \"jsr:@std/assert\";\n\nconst hyperfactorial = (n: number) => {\n let result = 1;\n for (let i = 1; i <= n; i++) {\n result *= i ** i;\n }\n return result;\n};\n\nassert(hyperfactorial(0) === 1);\nassert(hyperfactorial(2) === 4);\nassert(hyperfactorial(3) === 108);\nassert(hyperfactorial(7) === 3319766398771200000);",[316],"ffba4ee8-855f-11f0-98a5-0224a6c84d84","2025-08-25.tsx","fb972df4-855f-11f0-9913-0224a6c84d84",263,["D",1756530780715],"const orders = [\n { table: 1, items: [\"burger\", \"fries\"] },\n { table: 2, items: [\"burger\", \"burger\", \"fries\"] },\n { table: 1, items: [\"salad\"] },\n { table: 2, items: [\"fries\"] },\n];\n\nfunction orderSummary(orders: { table: number; items: string[] }[]) {\n return Object.fromEntries(\n Object.entries(Object.groupBy(orders, (order) => order.table))\n .map(([table, orders]) => [\n table,\n orders!.flatMap((order) => order.items).reduce((acc, item) => {\n acc[item] = (acc[item] || 0) + 1;\n return acc;\n }, {} as Record),\n ]),\n );\n}\n\nconsole.log(orderSummary(orders));",[324],"e9c4909e-85ff-11f0-8c63-0224a6c84d84","2025-08-18.tsx","809d79e4-85fc-11f0-ade1-0224a6c84d84",321,["D",1756599463348],28,"function* simpleGenerator(): Generator {\n yield \"soak\";\n yield \"wash\";\n yield \"rinse\";\n yield \"spin\";\n yield \"dry\";\n}\n\nconst createLaundryItem = () => {\n return {\n item: simpleGenerator(),\n\n nextCycle() {\n const state = this.item.next();\n return state.done ? \"done\" : state.value;\n },\n };\n};\n\nconst towel = createLaundryItem();\nconsole.log(towel.nextCycle()); // \"soak\"\nconsole.log(towel.nextCycle()); // \"wash\"\nconsole.log(towel.nextCycle()); // \"rinse\"\nconsole.log(towel.nextCycle()); // \"spin\"\nconsole.log(towel.nextCycle()); // \"dry\"\nconsole.log(towel.nextCycle()); // \"done\"\nconsole.log(towel.nextCycle()); // \"done\"",[331],"5e76fad6-727c-11f0-b83a-0224a6c84d84","2025-08-04.ts","79a1804a-7279-11f0-accf-0224a6c84d84",67,["D",1754453893474],55,"function minMonsterDistance(monsters: number[], d: number): number {\n const pairs: number[][] = [];\n\n for (let i = 0; i < monsters.length - 1; i++) {\n pairs.push([monsters[i], monsters[i + 1]]);\n }\n\n const distances = pairs.map((pair) => {\n return Math.abs(pair[0] - pair[1]);\n });\n\n console.log(distances.sort());\n return distances.every((n) => n >= d) ? -1 : distances.sort()[0];\n}\n\nconsole.log(minMonsterDistance([3, 8, 10, 15], 6));\nconsole.log(minMonsterDistance([5, 9, 14, 18], 4));",[339],"37ed3828-6bcc-11f0-a998-0224a6c84d84","2025-07-28.ts","53deda92-6bcb-11f0-9a67-0224a6c84d84",11,["D",1753718530414],"function canFormHexagon(sides: number[]) {\n return new Set(sides).size === 3;\n}\n\nconsole.log(canFormHexagon([2, 3, 8, 8, 2, 3])); // true\nconsole.log(canFormHexagon([1, 2, 3, 4, 5, 6])); // false\nconsole.log(canFormHexagon([2, 2, 2, 2, 2, 2, 2])); // false",[347],"8e07dc72-9d45-11f0-866c-0224a6c84d84",".vtignore","8e07dcfe-9d45-11f0-866c-0224a6c84d84",332,["D",1759158250923],".git\n.vscode\n.cursor\n.DS_Store\nnode_modules\nvendor",[354],"pulls","branches","forks","envVars",{"_367":181,"_369":181},"connections",{"_367":181,"_368":181},"count","unfilledCount","emptyCount",{"_42":353,"_32":354,"_30":355,"_155":-5,"_40":41,"_39":356,"_157":158,"_37":476,"_13":181,"_33":20,"_35":358,"_23":24,"_162":-5,"_398":477,"_26":478},{"_42":346,"_32":347,"_30":348,"_155":-5,"_40":41,"_39":349,"_157":158,"_37":473,"_13":281,"_33":34,"_35":351,"_23":24,"_162":-5,"_398":474,"_26":475},{"_42":338,"_32":339,"_30":340,"_155":-5,"_40":41,"_39":341,"_157":158,"_37":470,"_13":343,"_33":34,"_35":344,"_23":24,"_162":-5,"_398":471,"_26":472},{"_42":330,"_32":331,"_30":332,"_155":-5,"_40":41,"_39":333,"_157":158,"_37":467,"_13":335,"_33":34,"_35":336,"_23":24,"_162":-5,"_398":468,"_26":469},{"_42":323,"_32":324,"_30":325,"_155":-5,"_40":41,"_39":326,"_157":158,"_37":464,"_13":160,"_33":34,"_35":328,"_23":24,"_162":-5,"_398":465,"_26":466},{"_42":315,"_32":316,"_30":317,"_155":-5,"_40":41,"_39":318,"_157":158,"_37":461,"_13":320,"_33":34,"_35":321,"_23":24,"_162":-5,"_398":462,"_26":463},{"_42":307,"_32":308,"_30":309,"_155":-5,"_40":41,"_39":310,"_157":158,"_37":458,"_13":312,"_33":34,"_35":313,"_23":24,"_162":-5,"_398":459,"_26":460},{"_42":300,"_32":301,"_30":302,"_155":-5,"_40":41,"_39":303,"_157":158,"_37":455,"_13":233,"_33":34,"_35":305,"_23":24,"_162":-5,"_398":456,"_26":457},{"_42":292,"_32":293,"_30":294,"_155":-5,"_40":41,"_39":295,"_157":158,"_37":452,"_13":297,"_33":34,"_35":298,"_23":24,"_162":-5,"_398":453,"_26":454},{"_42":284,"_32":285,"_30":286,"_155":-5,"_40":41,"_39":287,"_157":158,"_37":449,"_13":289,"_33":34,"_35":290,"_23":24,"_162":-5,"_398":450,"_26":451},{"_42":276,"_32":277,"_30":278,"_155":-5,"_40":41,"_39":279,"_157":158,"_37":446,"_13":281,"_33":34,"_35":282,"_23":24,"_162":-5,"_398":447,"_26":448},{"_42":268,"_32":269,"_30":270,"_155":-5,"_40":41,"_39":271,"_157":158,"_37":443,"_13":273,"_33":34,"_35":274,"_23":24,"_162":-5,"_398":444,"_26":445},{"_42":260,"_32":261,"_30":262,"_155":-5,"_40":41,"_39":263,"_157":158,"_37":440,"_13":265,"_33":34,"_35":266,"_23":24,"_162":-5,"_398":441,"_26":442},{"_42":252,"_32":253,"_30":254,"_155":-5,"_40":41,"_39":255,"_157":158,"_37":437,"_13":257,"_33":34,"_35":258,"_23":24,"_162":-5,"_398":438,"_26":439},{"_42":244,"_32":245,"_30":246,"_155":-5,"_40":41,"_39":247,"_157":158,"_37":434,"_13":249,"_33":34,"_35":250,"_23":24,"_162":-5,"_398":435,"_26":436},{"_42":236,"_32":237,"_30":238,"_155":-5,"_40":41,"_39":239,"_157":158,"_37":431,"_13":241,"_33":34,"_35":242,"_23":24,"_162":-5,"_398":432,"_26":433},{"_42":228,"_32":229,"_30":230,"_155":-5,"_40":41,"_39":231,"_157":158,"_37":428,"_13":233,"_33":34,"_35":234,"_23":24,"_162":-5,"_398":429,"_26":430},{"_42":220,"_32":221,"_30":222,"_155":-5,"_40":41,"_39":223,"_157":158,"_37":425,"_13":225,"_33":34,"_35":226,"_23":24,"_162":-5,"_398":426,"_26":427},{"_42":212,"_32":213,"_30":214,"_155":-5,"_40":41,"_39":215,"_157":24,"_37":422,"_13":217,"_33":34,"_35":218,"_23":24,"_162":-5,"_398":423,"_26":424},{"_42":205,"_32":206,"_30":207,"_155":-5,"_40":41,"_39":208,"_157":158,"_37":419,"_13":181,"_33":20,"_35":210,"_23":24,"_162":-5,"_398":420,"_26":421},{"_42":197,"_32":198,"_30":199,"_155":-5,"_40":41,"_39":200,"_157":158,"_37":416,"_13":202,"_33":20,"_35":203,"_23":24,"_162":-5,"_398":417,"_26":418},{"_42":190,"_32":191,"_30":192,"_155":-5,"_40":41,"_39":193,"_157":158,"_37":413,"_13":181,"_33":20,"_35":195,"_23":24,"_162":-5,"_398":414,"_26":415},{"_42":183,"_32":184,"_30":185,"_155":-5,"_40":41,"_39":186,"_157":158,"_37":410,"_13":59,"_33":20,"_35":188,"_23":24,"_162":-5,"_398":411,"_26":412},{"_42":179,"_32":27,"_30":31,"_155":-5,"_40":41,"_39":14,"_157":24,"_37":407,"_13":181,"_33":34,"_35":36,"_23":24,"_162":-5,"_398":408,"_26":409},{"_42":171,"_32":172,"_30":173,"_155":-5,"_40":41,"_39":174,"_157":24,"_37":404,"_13":176,"_33":34,"_35":177,"_23":24,"_162":-5,"_398":405,"_26":406},{"_42":164,"_32":165,"_30":166,"_155":-5,"_40":41,"_39":167,"_157":158,"_37":401,"_13":160,"_33":34,"_35":169,"_23":24,"_162":-5,"_398":402,"_26":403},{"_42":152,"_32":153,"_30":154,"_155":-5,"_40":41,"_39":156,"_157":158,"_37":397,"_13":160,"_33":34,"_35":161,"_23":24,"_162":-5,"_398":399,"_26":400},["D",1768239179997],"children",[],[153],["D",1756599172383],[],[165],["D",1785788994090],[],[172],["D",1786379887106],[],[27],["D",1771259467113],[],[184],["D",1759158250927],[],[191],["D",1753718404826],[],[198],["D",1759158250903],[],[206],["D",1785789508612],[],[213],["D",1785560089906],[],[221],["D",1783399548124],[],[229],["D",1783230860054],[],[237],["D",1782157151844],[],[245],["D",1780030137284],[],[253],["D",1779249012739],[],[261],["D",1775451031435],[],[269],["D",1773673054426],[],[277],["D",1771259481951],[],[285],["D",1771259117296],[],[293],["D",1768239251324],[],[301],["D",1759769041358],[],[308],["D",1759768984297],[],[316],["D",1756530780715],[],[324],["D",1756599463348],[],[331],["D",1754453893474],[],[339],["D",1753718530414],[],[347],["D",1759158250923],[],[354],["D",1753718147794],["D",1789693835578],{"_96":95,"_103":99},{"_96":95,"_97":-5,"_98":99,"_18":53,"_100":101,"_102":24},{"_13":85,"_32":86,"_42":41,"_87":43,"_88":-5,"_89":-5,"_90":-5,"_91":-5,"_92":-5,"_93":44,"_94":95},"ctx",{"_78":-5,"_122":517,"_518":519,"_520":521,"_522":24,"_523":24,"_524":24,"_525":158,"_526":-5,"_527":-7,"_528":-7,"_529":181,"_530":24,"_531":24,"_532":-5,"_533":24,"_534":24,"_535":24,"_536":-5},"ENV",{"_488":489,"_490":491,"_492":86,"_493":494,"_495":496,"_497":498,"_499":500,"_501":502,"_503":504,"_505":506,"_507":508,"_509":510,"_511":512,"_513":514,"_515":516},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","71c1b20804b3232a7e513be260cfffc1932a9e97","RENDER_GIT_BRANCH","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","CLOUDFLARE_TURNSTILE_SITE_KEY","0x4AAAAAACtaIZJH7s9rBMZ6","GOOGLE_CLIENT_ID","875989696899-jtsqkhlbdv5jrlsk8631p7ipjg3c6o62.apps.googleusercontent.com","STRIPE_PUBLISHABLE_KEY","pk_live_51N2zvWEpZTTLipIkVEwXrUG9AT0yeOOEYxszarZT1jpsZV58Ly6wlg3SltZpHN26CUalOBmUSY7adQRQiSkCZz2500qSXNkf8Y","API_URL","https://api.val.town",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]

Diff · v1120