014 - Longest Collatz sequence - Project Euler Challenge - JavaScript freeCodeCamp

The following iterative sequence is defined for the set of positive integers: n → n/2 (n is even) n → 3n + 1 (n is odd) Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1. Which starting number, under the given limit, produces the longest chain?

Link to Challenge : https://www.freecodecamp.org/learn/coding-interview-prep/project-euler/problem-14-longest-collatz-sequence Written Guide and Source Code : https://www.notion.so/ganeshh123/Longest-Collatz-sequence-cb706142861a41a5b7cd34d6a4c467cc Full Playlist: https://www.youtube.com/playlist?list=PLhGp6N0DI_1RQjG0wIOi2afjuh9iIeHU6

Project Euler Written Guides : https://www.notion.so/ganeshh123/62598b647b6040f88843b33b46faa309 All My Tutorials can be found at : https://www.notion.so/Tutorials-Ganesh-H-293ea420d34a464f9a1907e0405b5f26

-————————————————————————————————————- Project Euler (named after Leonhard Euler) is a website dedicated to a series of computational problems intended to be solved with computer programs. The project attracts adults and students interested in mathematics and computer programming. Since its creation in 2001 by Colin Hughes, Project Euler has gained notability and popularity worldwide. It includes over 700 problems, with a new one added once every one or two weeks. Problems are of varying difficulty, but each is solvable in less than a minute of CPU time using an efficient algorithm on a modestly powered computer. As of 5 April 2020, Project Euler has more than 1,000,000 users, from all over the world, who have solved at least one problem.

NOTE: I am not a teacher by any means, these videos are just to help me improve my understanding.

Thanks for Watching! ... https://www.youtube.com/watch?v=ANa0_a8uKGg