Available question text
Compute each integer's Collatz "power" (number of steps to reach 1 using x/2 for even and 3x+1 for odd), sort the numbers in [lo, hi] by power (breaking ties by numeric value), and return the k-th element in that order. The range is small (hi ≤ 1000), so precomputing powers for the interval is sufficient.
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 1387. Sort Integers by The Power Value
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source