Two Sum Problem- LeetCode- Given an array of integers of the two numbers such that they add up to a specific target. You may assume that each input would have one solution, and you may not use the same element twice.

gistfile1.txt

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
      vector<int> arr;
        for (int i=0; i < nums.size(); i++){
            int rem = target - nums[i];
            for (int j=0; j < nums.size(); j++){
                if (rem == nums[j] && j!=i){
                    arr.push_back(i);
                    arr.push_back(j);
                    i= nums.size();
                }
                
            }
        }
        return arr;
    }
};