The interview took two weeks. I applied at a university career fair.

They gave me a phone interview and an online assessment.

In the phone interview, they asked me basic information like when I would graduate, whether I was willing to work in WI, and my career plans and experience on my resume.

At the end, they asked me a small algorithm question, the anagram problem from LeetCode. It's easy, but I did badly.

The online assessment was challenging. It tested my response time, skill to learn new things, and programming skills.

Practice algorithm and programming exercises before the test! There were four programming problems; I only solved two.

After two weeks, HR told me I was rejected. TOT.

A number is decomposed into digits (one or more in a group). If the sequence of the new numbers are Fibonacci numbers, this number will be called an "additive number". For example, "1123" can be divided into 1, 1, 2, 3. "12122436" can be divided into 12, 12, 24, 36. Therefore, 1123 and 12122436 are called "additive numbers". Write an algorithm to test whether the input number is an "additive number".