Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Two Peaceful Knights > Editorial

Two Peaceful Knights — Solution & Editorial

Back to the Problem

All placements C(k², 2) minus attacking pairs: every 2×3 rectangle holds exactly two attacking arrangements, and there are 4(k−1)(k−2) such placements.

Complexity: O(N)

Watch out: k4/2 overflows 32 bits at k ≈ 300 — 64-bit throughout.