Leetcode – Two Sums

Inspired by my fellow developers, I’ve decided to try a couple of challenges every week. Starting at the very beginning: Name: Two SumsDifficulty: EasyDescription: Return the indexes of the two numbers which add up to the target number. Example: Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 […]