In addition I’ve got a new Metal Monday Coding Challenge and Wednesday I’ll have some answers to the first Metal Monday Coding Challenge. If you’ve not solved it, or attempted to put the information together necessary for that problem to be solved do so now! I WILL PAY THE VICTOR WITH A SOLID ANSWER $100.00!!
With the mind freed, let’s dive into a coding challenge.
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
Work through the solution so that each input would have exactly one solution and do not use the same element twice.
Example: Given nums = [2, 7, 11, 15], target = 9,
Because nums + nums = 2 + 7 = 9, return [0, 1].
Now here’s the twist. Provide at least 2 (or 3!) or more ways in which you solve the problem, in individual repos, that all build via simple README.md instructions. Minimal download, minimal dependencies, one just needs to be able to run it as easily as possible. You knew I couldn’t just make it a simple coding solution, there had to be some odd thing added.
As for the victory prize, suggest something you think would be a well deserved victory prize for such repositories! In a future blog entry I’ll provide some of my own answers to this, with solid builds for each!
After all that building and thinking, time to finish off Metal Monday with a little Amon Amarth.