Find indices start and end for a particular value in a sorted integer array with duplicates

Question

Utilisateur anonyme · Accepted Answer

Explained simple way to do this using linear search and binary search and coded up using binary search

Gokhan · Answer

public int firstOccur(int[] arr, int k) {

        if (arr == null || arr.length  combinedOccur(int[] arr, int k) {
        BinarySearchOccurences obj = new BinarySearchOccurences();

        int startIndex = obj.firstOccur(arr, k);
        int endIndex = obj.lastOccur(arr, k);

        if (startIndex == -1 || endIndex == -1) {
            throw new IllegalArgumentException("k does not exist in array");
        }

        ArrayList result = new ArrayList();
        result.add(startIndex);
        result.add(endIndex);

        return result;
    }

Utilisateur anonyme · Answer

public int firstOccur(int[] arr, int k) {

        if (arr == null || arr.length  combinedOccur(int[] arr, int k) {
        BinarySearchOccurences obj = new BinarySearchOccurences();

        int startIndex = obj.firstOccur(arr, k);
        int endIndex = obj.lastOccur(arr, k);

        if (startIndex == -1 || endIndex == -1) {
            throw new IllegalArgumentException("k does not exist in array");
        }

        ArrayList result = new ArrayList();
        result.add(startIndex);
        result.add(endIndex);

        return result;
    }

LinkedIn

Question d’entretien chez LinkedIn

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois