All challenges
Medium 0 solved 0% acceptance

Longest Collatz Chain

Find the starting number up to a limit whose Collatz chain is longest.

What you'll learn

  • Generate a Collatz chain
  • Cache results to avoid repeated work
  • Break ties by the smallest value

Problem

From any positive n, the Collatz rule makes the next term n / 2 when n is even and 3n + 1 when n is odd, and the chain stops when it reaches 1. The chain for 6 is 6, 3, 10, 5, 16, 8, 4, 2, 1: nine terms. Among all starting numbers from 1 to limit, find the one with the most terms.

Implement longest_collatz_chain(limit).

Chains share their endings, so remembering the length found for each number saves a lot of work. Terms along the way can pass the limit; use 64-bit integers.

Input

limit: The largest starting number to try.

Output

Return the starting number whose chain has the most terms (counting the start and the final 1). If several tie, return the smallest of them.

Constraints

1 ≤ limit ≤ 100,000

Examples

Example 1
Input:
limit = 6

Expected output:
expected = 6
Input:
long long limit = 6;

Expected output:
long long expected = 6;
Input:
long limit = 6;

Expected output:
long expected = 6;

Explanation

The chain lengths for 1 to 6 are 1, 2, 8, 3, 6 and 9 terms, so the answer is 6.

Example 2
Input:
limit = 10

Expected output:
expected = 9
Input:
long long limit = 10;

Expected output:
long long expected = 9;
Input:
long limit = 10;

Expected output:
long expected = 9;

Explanation

9 gives 20 terms (9, 28, 14, 7, ...), more than any other start up to 10, so the answer is 9.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Count the terms of one chain first, including the start and the 1.

Hint 2

When a chain reaches a number whose length you already know, add instead of continuing.

Hint 3

Only replace the best start when a length is strictly greater.

Expected complexity

O(limit × average new steps) time, O(limit) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.