Did it long hand in js. Great puzzle!
const strength = num => { let count = 0; if (num === 0) { return 0; } while (num % 2 == 0) { num = num / 2; count++; } return count; }; const strongestNumber = interval => { const [start, end] = interval; let strongest = start; for (let i = start; i <= end; i++) { if (strength(i) > strength(strongest)) { strongest = i; } } return strongest; }; console.log(strongestNumber([1, 2])); console.log(strongestNumber([5, 10])); console.log(strongestNumber([48, 56])); console.log(strongestNumber([129, 193]));
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Did it long hand in js. Great puzzle!