**7 APRIL 2016** – In February this year, Numerical Technologies launched its third Talent Hunt challenge that gave new graduates and graduating students an opportunity to showcase their programming and analytic skills.

To register for the challenge participants had to solve given puzzles. Only correct answer submission led to the final challenge.

## The final challenges

The final challenge involved answering one of two problems:

- A monkey is put on a planar grid. The monkey is able to walk around on the planar grid, one space at a time left, right, up or down, e.g. from (x, y) the monkey can move to (x+1, y), (x-1, y), (x, y+1), or (x, y-1) etc. Points where the sum of the digits of the absolute value of the x coordinate plus the sum of the digits of the absolute value of the y coordinate are lesser than or equal to 20 are accessible to the monkey. For example, the point (58, 77) is inaccessible because 5 + 8 + 7 + 7 = 27, which is greater than 20. Another example: the point (-1, -2) is accessible because abs(-1) + abs(-2) = 1 + 2 = 3, which is less than 20.Write a program to find the longest distance can the monkey move from random given point (x,y) which is unnecessary to be (0,0).
- How many monkeys are there in the world? Explain in detail how you arrived at your answer.

## Challenge Winner

After evaluating the answers to the final challenge, Numerical Technologies is pleased to announce the top 3 participants:

**Challenge Winner and Winner of an iPad mini 4:**

Wen Bin, Lim (National University of Singapore, Quantitative Finance)

**Honourable Mention:**

Tengyang, Jing (National University of Singapore, Biomedical Engineering)

Jason, Gao (National University of Singapore, Industrial and System Engineering)

Thank you once again for all participants and congratulations to Wen Bin, Tengyang and Jason! We had a great fun reviewing all of your creative ideas and solutions.

More information about Junior Software Developer position is available at our careers.numtech.com.