LinkedIn Zip #474

LinkedIn Zip #474 is the LinkedIn Zip daily for July 4, 2026. Zip is LinkedIn's path puzzle: draw one continuous route through a 8×8 grid, visit every cell exactly once, hit 16 numbered checkpoints in order, and navigate around 0 walls. This page includes the live board, a solved-board view, and a step-by-step Solution walkthrough. Difficulty: Hard. Estimated solve time: 6–10 min.

This 8×8 Zip route visits all 64 cells once, hits 16 checkpoints in order, and respects 0 walls:

1→2 (5 cells, R3C5→R7C5); 2→3 (3 cells, R7C5→R6C4); 3→4 (6 cells, R6C4→R3C2); 4→5 (4 cells, R3C2→R2C4); 5→6 (8 cells, R2C4→R6C7); 6→7 (3 cells, R6C7→R4C7); 7→8 (4 cells, R4C7→R2C8); 8→9 (3 cells, R2C8→R1C7); 9→10 (6 cells, R1C7→R2C3); 10→11 (9 cells, R2C3→R6C1); 11→12 (2 cells, R6C1→R7C1); 12→13 (3 cells, R7C1→R8C2); 13→14 (4 cells, R8C2→R5C2); 14→15 (9 cells, R5C2→R7C6); 15→16 (9 cells, R7C6→R3C8)

Checkpoints sit close together on the grid — short numbered hops still need full-cell coverage between them without revisiting squares.

1. Hop 1Sample 1Checkpoint 1 → 2 (5 cells)

   Corridor insight

   Sample 1: 1→2, length 5, walls 0.

   Solving note

   5 cells link checkpoint 1 at R3C5 to checkpoint 2 at R7C5 with open corridors (no walls on this segment).

2. Hop 2Sample 2Checkpoint 2 → 3 (3 cells)

   Corridor insight

   Sample 2: 2→3, length 3, walls 0.

   Solving note

   Tight 3-cell hop — checkpoints 2 and 3 sit near each other; still visit every intervening cell exactly once.

3. Hop 3Sample 3Checkpoint 3 → 4 (6 cells)

   Corridor insight

   Sample 3: 3→4, length 6, walls 0.

   Solving note

   6 cells link checkpoint 3 at R6C4 to checkpoint 4 at R3C2 with open corridors (no walls on this segment).

4. Hop 4Sample 4Checkpoint 4 → 5 (4 cells)

   Corridor insight

   Sample 4: 4→5, length 4, walls 0.

   Solving note

   4 cells link checkpoint 4 at R3C2 to checkpoint 5 at R2C4 with open corridors (no walls on this segment).

5. Hop 5Sample 5Checkpoint 5 → 6 (8 cells)

   Corridor insight

   Sample 5: 5→6, length 8, walls 0.

   Solving note

   8 cells link checkpoint 5 at R2C4 to checkpoint 6 at R6C7 with open corridors (no walls on this segment).

6. Hop 6Sample 6Checkpoint 6 → 7 (3 cells)

   Corridor insight

   Sample 6: 6→7, length 3, walls 0.

   Solving note

   Tight 3-cell hop — checkpoints 6 and 7 sit near each other; still visit every intervening cell exactly once.

7. Hop 7Sample 7Checkpoint 7 → 8 (4 cells)

   Corridor insight

   Sample 7: 7→8, length 4, walls 0.

   Solving note

   4 cells link checkpoint 7 at R4C7 to checkpoint 8 at R2C8 with open corridors (no walls on this segment).

8. Hop 8Sample 8Checkpoint 8 → 9 (3 cells)

   Corridor insight

   Sample 8: 8→9, length 3, walls 0.

   Solving note

   Tight 3-cell hop — checkpoints 8 and 9 sit near each other; still visit every intervening cell exactly once.

9. Hop 9Hop 9Checkpoint 9 → 10 (6 cells)

   Corridor insight

   Hop 9: 9→10, length 6, walls 0.

   Solving note

   6 cells link checkpoint 9 at R1C7 to checkpoint 10 at R2C3 with open corridors (no walls on this segment).

10. Hop 10Hop 10Checkpoint 10 → 11 (9 cells)

    Corridor insight

    Hop 10: 10→11, length 9, walls 0.

    Solving note

    9 cells link checkpoint 10 at R2C3 to checkpoint 11 at R6C1 with open corridors (no walls on this segment).

11. Hop 11Hop 11Checkpoint 11 → 12 (2 cells)

    Corridor insight

    Hop 11: 11→12, length 2, walls 0.

    Solving note

    Tight 2-cell hop — checkpoints 11 and 12 sit near each other; still visit every intervening cell exactly once.

12. Hop 12Hop 12Checkpoint 12 → 13 (3 cells)

    Corridor insight

    Hop 12: 12→13, length 3, walls 0.

    Solving note

    Tight 3-cell hop — checkpoints 12 and 13 sit near each other; still visit every intervening cell exactly once.

13. Hop 13Hop 13Checkpoint 13 → 14 (4 cells)

    Corridor insight

    Hop 13: 13→14, length 4, walls 0.

    Solving note

    4 cells link checkpoint 13 at R8C2 to checkpoint 14 at R5C2 with open corridors (no walls on this segment).

14. Hop 14Hop 14Checkpoint 14 → 15 (9 cells)

    Corridor insight

    Hop 14: 14→15, length 9, walls 0.

    Solving note

    9 cells link checkpoint 14 at R5C2 to checkpoint 15 at R7C6 with open corridors (no walls on this segment).

15. Hop 15Hop 15Checkpoint 15 → 16 (9 cells)

    Corridor insight

    Hop 15: 15→16, length 9, walls 0.

    Solving note

    9 cells link checkpoint 15 at R7C6 to checkpoint 16 at R3C8 with open corridors (no walls on this segment).

Optimal segment vector: 1→2 (5 cells, R3C5→R7C5); 2→3 (3 cells, R7C5→R6C4); 3→4 (6 cells, R6C4→R3C2); 4→5 (4 cells, R3C2→R2C4); 5→6 (8 cells, R2C4→R6C7); 6→7 (3 cells, R6C7→R4C7); 7→8 (4 cells, R4C7→R2C8); 8→9 (3 cells, R2C8→R1C7); 9→10 (6 cells, R1C7→R2C3); 10→11 (9 cells, R2C3→R6C1); 11→12 (2 cells, R6C1→R7C1); 12→13 (3 cells, R7C1→R8C2); 13→14 (4 cells, R8C2→R5C2); 14→15 (9 cells, R5C2→R7C6); 15→16 (9 cells, R7C6→R3C8). Wall budget 0. Pattern class checkpointCluster.

Phase 1: Start at checkpoint 1 (R3C5) on this 8×8 grid with 16 checkpoints and 0 walls. Segment 1: Visit checkpoint 2 at R7C5 via 5 cells from checkpoint 1. 5 cells link checkpoint 1 at R3C5 to checkpoint 2 at R7C5 with open corridors (no walls on this segment). Segment 2: Visit checkpoint 3 at R6C4 via 3 cells from checkpoint 2. Tight 3-cell hop — checkpoints 2 and 3 sit near each other; still visit every intervening cell exactly once. Segment 3: Visit checkpoint 4 at R3C2 via 6 cells from checkpoint 3. 6 cells link checkpoint 3 at R6C4 to checkpoint 4 at R3C2 with open corridors (no walls on this segment). Segment 4: Visit checkpoint 5 at R2C4 via 4 cells from checkpoint 4. 4 cells link checkpoint 4 at R3C2 to checkpoint 5 at R2C4 with open corridors (no walls on this segment). Segment 5: Visit checkpoint 6 at R6C7 via 8 cells from checkpoint 5. 8 cells link checkpoint 5 at R2C4 to checkpoint 6 at R6C7 with open corridors (no walls on this segment). Segment 6: Visit checkpoint 7 at R4C7 via 3 cells from checkpoint 6. Tight 3-cell hop — checkpoints 6 and 7 sit near each other; still visit every intervening cell exactly once. Segment 7: Visit checkpoint 8 at R2C8 via 4 cells from checkpoint 7. 4 cells link checkpoint 7 at R4C7 to checkpoint 8 at R2C8 with open corridors (no walls on this segment). Segment 8: Visit checkpoint 9 at R1C7 via 3 cells from checkpoint 8. Tight 3-cell hop — checkpoints 8 and 9 sit near each other; still visit every intervening cell exactly once. Segment 9: Visit checkpoint 10 at R2C3 via 6 cells from checkpoint 9. 6 cells link checkpoint 9 at R1C7 to checkpoint 10 at R2C3 with open corridors (no walls on this segment). Segment 10: Visit checkpoint 11 at R6C1 via 9 cells from checkpoint 10. 9 cells link checkpoint 10 at R2C3 to checkpoint 11 at R6C1 with open corridors (no walls on this segment). Segment 11: Visit checkpoint 12 at R7C1 via 2 cells from checkpoint 11. Tight 2-cell hop — checkpoints 11 and 12 sit near each other; still visit every intervening cell exactly once. Segment 12: Visit checkpoint 13 at R8C2 via 3 cells from checkpoint 12. Tight 3-cell hop — checkpoints 12 and 13 sit near each other; still visit every intervening cell exactly once. Segment 13: Visit checkpoint 14 at R5C2 via 4 cells from checkpoint 13. 4 cells link checkpoint 13 at R8C2 to checkpoint 14 at R5C2 with open corridors (no walls on this segment). Segment 14: Visit checkpoint 15 at R7C6 via 9 cells from checkpoint 14. 9 cells link checkpoint 14 at R5C2 to checkpoint 15 at R7C6 with open corridors (no walls on this segment). Segment 15: Visit checkpoint 16 at R3C8 via 9 cells from checkpoint 15. 9 cells link checkpoint 15 at R7C6 to checkpoint 16 at R3C8 with open corridors (no walls on this segment). Complete: Hamiltonian path covers all 64 cells, checkpoints 1–16 in order, ending on checkpoint 16 at R3C8.

Checkpoints sit close together on the grid — short numbered hops still need full-cell coverage between them without revisiting squares.

This 8×8 board has 16 checkpoints (1@R3C5, 2@R7C5, 3@R6C4, 4@R3C2, 5@R2C4, 6@R6C7, 7@R4C7, 8@R2C8, 9@R1C7, 10@R2C3, 11@R6C1, 12@R7C1, 13@R8C2, 14@R5C2, 15@R7C6, 16@R3C8) and 0 walls. The solution path covers 64 cells in 15 checkpoint hops: 1→2 (5 cells, R3C5→R7C5); 2→3 (3 cells, R7C5→R6C4); 3→4 (6 cells, R6C4→R3C2); 4→5 (4 cells, R3C2→R2C4); 5→6 (8 cells, R2C4→R6C7); 6→7 (3 cells, R6C7→R4C7); 7→8 (4 cells, R4C7→R2C8); 8→9 (3 cells, R2C8→R1C7); 9→10 (6 cells, R1C7→R2C3); 10→11 (9 cells, R2C3→R6C1); 11→12 (2 cells, R6C1→R7C1); 12→13 (3 cells, R7C1→R8C2); 13→14 (4 cells, R8C2→R5C2); 14→15 (9 cells, R5C2→R7C6); 15→16 (9 cells, R7C6→R3C8). Checkpoints sit close together on the grid — short numbered hops still need full-cell coverage between them without revisiting squares. Use the Solution tab for a checkpoint-segment reveal with live board updates, or the Solved board tab for the complete path at a glance.