APT Puzzles
Interested in working at APT? See if you have what it takes.
Brainteasers:
We tackle a lot of tough problems at APT. Some of them don't have a straightforward technique for getting to a solution. In fact for some of the most important and most challenging problems we work on, the problem itself doesn't tell us what exactly the question is or what form the solution will take. Think you can solve a problem where it's your job to figure out the details? Give it a shot.
Test your coding skills:
Are you an engineer or want to impress us with your coding skills? Try out these more complex puzzles!
At APT, very often we write software to help large companies find solutions to difficult optimization problems. Being an intelligent top-tier college grad (almost), you're going to be faced with plenty of lucrative and fascinating job opportunities - which is just an optimization problem itself. We've put together a problem based on your very situation. See if you can write some code that generates the optimal set of job assignments.
If 1 = a, 2 = b, ... 26 = z, what's the largest Fibonacci number that spells a word? For example, 89 is a Fibonacci number that spells "hi" using the specified encoding.
Using a new mapping, now assign 0-25 to a-z in any order you choose. What is the longest word that can be spelled from a Fibonacci number?