Find Pairs with least absolute difference in an given unsorted array,

Question

Pooja · Accepted Answer

1. Sort the array - O(nlogn)
2. Run through the loop to get the minimum difference

Utilisateur anonyme · Answer

there is better approach: build a tree, and each time you insert a value to the tree, compute difference with all elements you compare with this element. The whole complexity will be O(NlogN)

hivejin · Answer

Time O(n), Space O(n), n is length of integer.

    List> findPairNubmer(int[] nums, int target) {
        List> result = new ArrayList();
        if(nums.length == 0 )
            return result;
        HashSet set = new HashSet();
        for(int i : nums) {
            set.add(i);
        }

        for(int i = 0; i  pair = new ArrayList();
                pair.add(nums[i]);
                pair.add(nums[i] + target);
                result.add(pair);
            }
        }
        return result;
    }

Salesforce

Question d’entretien chez Salesforce

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois