{"id":"power-of-four-mask-32bit","text":"The mask `0x55555555` only covers bit positions 0–30, so the power-of-four solution assumes n fits in a 32-bit signed integer (matching the LeetCode constraint).","truth_value":"IN","source":"entries/2026/06/06/power-of-four-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"power-of-four-mask-32bit","truth_value":"IN","reason":"premise"}]}}