Hi CS Club,

I just wanted to share with you an awesome service that sends subscribers a new technical/programmer interview question every other day. It's like SAT Question of the Day but for interview questions. This is an invaluable resource and gives you a huge competitive edge! Sign up here - its 100% free!

Here's a sample question (more on site):

5/4/2012 - Given an array of integers, devise an algorithm to find the largest number possible from a concatenation of the integers in the array. Each number must be used exactly once.

ex. input:

returns: 5,958,521

`[59, 58, 5, 1, 2]`

returns: 5,958,521

See the answer.

Remember to sign up here!

Thanks,

Zaheer M.