Two Sum problem

The two sum problem is being based on target value which should be met from summing indices of an integer array.Our output should contain the numbers of the indices that contains this values

First solution is basic brute force method

The code is uploaded on the following github repository.

Code in Github