Two Sum Leetcode Solution

class Solution {
public:
    vector twoSum(vector& nums, int target) {
        // declaration of map
        unordered_map mpp;
        
        // inserting value of array along with its index
        for(int i=0;i< nums.size();i++){
            mpp[nums[i]]= i;
        }
        
        // check if value and target - value present in the map
        for(auto it : mpp){
            if(mpp.find(target - it.fist) != mpp.end()){
                return {it.first, mpp[target - it.first]};
            }
        }
        return {-1,-1};
    }
};

import java.util.HashMap;
import java.util.Map;

class Solution {
    public int[] twoSum(int[] nums, int target) {
        
        Map mpp = new HashMap<>();
        
        for(int i=0; i entry : mpp.entrySet()){
            int key = entry.getKey();
            int value = entry.getValue();
            
            if(mpp.containsKey(target - key)){
                return new int[]{key, mpp.get(target - key)};
            }
        }
        
        return new int[]{-1, -1};
    }
}

class Solution:
    def twoSum(self, nums, target):
        mpp = {}
        
        for i in range(len(nums)):
            mpp[nums[i]] = i
        
        for key, value in mpp.items():
            if (target - key) in mpp:
                return [key, mpp[target - key]]
        
        return [-1, -1]