Chief Hopper Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Chief Hopper
  5. Discussions

Chief Hopper

Sort by

recency

|

149 Discussions

|

  • tuan_lq121100
     + 0 comments

    Just brute force

    function checkEnergy(n, arr) {
    let en = n;
    for(let i=0;i<arr.length;i++) {
        en = 2*en - arr[i];
        if(en < 0) return false;
    }
    return true;
}
function chiefHopper(arr) {
    // Write your code here
    if(checkEnergy(arr[0], arr)) {
        let i = arr[0] - 1;
        while(checkEnergy(i, arr)) {
            i--;
        }
        i++;
        return i;
    } else {
        let i = arr[0] + 1;
        while(!checkEnergy(i, arr)) {
            i++;
        }
        return i;        
    }
}

  • 2101640130051_IT
     + 0 comments

    int chiefHopper(vector arr) { int energy=0,n=arr.size(); int i=0; while(i

  • shreyavishwalin1
     + 0 comments
    def chiefHopper(arr):
    energy = 0
    for height in reversed(arr):
        energy = (energy + height + 1) // 2
    return energy

  • kavijasuper
     + 0 comments

    Easy Solution

     public static int chiefHopper(List<Integer> arr) {
        int E = 0;
        for (int i = arr.size() - 1; i >= 0; i--){
            E = (int) Math.ceil((E + arr.get(i)) / 2.0); 
        }
        return E;
    }

  • yashparihar729
     + 0 comments

    Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Chief Hopper Problem Solution