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. Marc's Cakewalk
  5. Discussions

Marc's Cakewalk

  • nqb11295
     + 0 comments

    This is my solution in JavaScript

    function marcsCakewalk(calorie) {
    // Write your code here
    var result = 0
    calorie.sort((a, b) => (a > b ? -1 : 1))
    for(var i = 0;i < calorie.length;i++){
        result += Math.pow(2,i)*calorie[i] 
    }
    return result
}