Available question text
Given n (<= 1e18), find the smallest integer base k >= 2 such that n's base-k representation is all 1s — i.e., n = 1 + k + k^2 + ... + k^m for some m >= 1. This reduces to finding integer pairs (k, m) satisfying that geometric series equation and choosing the minimal k.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 483. Smallest Good Base
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source