The “Two Sum” problem is an introductory algorithm problem that you may come across in job interviews. It’s a beginner friendly problem that has several common solutions — although they aren’t all made equal. Let’s have a look at two of them.

The problem is as follows: “Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order”. For example:

Amy Hayes

Perpetual university student.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store