Question

Amazon | OA | SDE-Internship | Coding Questions and Solutions | 2022 | Set-112 | London

Comments

Amazon | OA | SDE-Internship | Coding Questions and Solutions | 2022 | Set-112 | London

Answer 1

public static int[] findDataLocations(int[] locations,int[] movedFrom,int[] movedTo){
        Set<Integer> set = new TreeSet<>();
        for(int loc : locations)
            set.add(loc);
        
        for(int i=0;i<movedTo.length;++i){
            int u = movedFrom[i];
            int v = movedTo[i];
            set.remove(u);
            set.add(v);
        }
        
        int[] result = new int[locations.length];
        int i = 0;
        for(int val : set)
            result[i++] = val;
        
        return result;
    }

Answer 2

 Online Assessment Question:

Comments

vector<int>findDataLocations(vector<int>locations, vector<int>movedFrom, vector<int>movedTo){
    map<int,int>mp;
    vector<int>ans;
    int n = locations.size();
    int m = movedFrom.size();
    for(int i=0;i<n;i++){
        ans.push_back(locations[i]);
        mp[locations[i]]=i;
    }
    for(int i=0;i<m;i++){
        int index = mp[movedFrom[i]];
        ans[index]=movedTo[i];
        mp[movedTo[i]]=index;
    }
    sort(ans.begin(),ans.end());
    return ans;
}