Actually, I am trying to solve Collatz Conjecture To Figure Out Longest Collatz Sequence. I tried optimizing the code to include memoization still getting TLE, for this solution. Wanted some help to understand where the method is consuming time.

Performance Reference

Problem Reference

Wiki-Reference

I am trying to find the longest Collatz Sequence:

Which starting number, ≤ N, produces the longest chain? If many possible such numbers are there print the maximum one. (1 ≤ N ≤ 5×10⁶)

I tried optimizing the code to include memoization still getting Time Limit Exceeded, for these solutions. Wanted some help to understand where the method is consuming time.

Performance Reference

I tried optimizing the code to include memoization still getting TLE, for this solution. Wanted some help to understand where the method is consuming time.

Problem Reference

Actually, I am trying to solve Collatz Conjecture To Figure Out Longest Collatz Sequence. I tried optimizing the code to include memoization still getting TLE, for this solution. Wanted some help to understand where the method is consuming time.

Problem Reference

Wiki-Reference