vcveebcoderLABS
← All challenges

CHALLENGE /002 · Planning & constraints

Ship without breaking the graph

Advanced · ~35 min

01 / THE BRIEF

Your mission

Produce the earliest possible parallel release waves for the target checkout. Each component takes one wave. A dependency must finish in an earlier wave. Include only the target and its transitive dependencies, once each. Sort names alphabetically within each wave.

Acceptance criteria

  1. Include all transitive dependencies and checkout exactly once.
  2. Exclude unrelated analytics.
  3. Never schedule a dependency in the same or a later wave.
  4. Use the minimum number of waves; sort each wave alphabetically.

Input fixture

{
  "target": "checkout",
  "dependencies": {
    "checkout": [
      "api",
      "ui"
    ],
    "api": [
      "schema",
      "auth"
    ],
    "ui": [
      "design"
    ],
    "auth": [
      "schema"
    ],
    "schema": [],
    "design": [],
    "analytics": [
      "schema"
    ]
  }
}

Expected output shape

[["component", "component"], ["component"]]

This evaluates one visible fixture, not arbitrary code or a hidden generalization suite. Use any model outside this site. Don’t paste secrets or personal data.

02 / YOUR WORKSPACE

Build. Test. Refine.

Use your preferred AI tool, then bring the result here. Nothing is sent to a model or stored on our server.

Track your run Self-reported · optional

Include all attempts and input + output tokens. These values are not independently verified and never qualify for a ranking.

Local workspace · reload clears your work · export to keep a copy