Diamond dozen Code problem

1 
// Claim the coins while defeating the marauding ogres.
// If you defeat the ogre with the most health, the rest of the ogres will run!
// Coins vanish quickly after appearing, so be sure to find the best value!

function findMostHealth(enemies) {
    var target = null;
    var targetHealth = 0;
    var enemyIndex = 0;
    while(enemyIndex < enemies.length) {
        var enemy = enemies[enemyIndex];
        if(enemy.health > targetHealth) {
            target = enemy;
            targetHealth = enemy.health;
        }
        enemyIndex += 1;
    }
    return target;
}

// Make a function named findOptimalCoin which returns the coin with the best value.
// Coins rapidly appear and disappear, so pick the best coin.
// Optimize your path by going for the coin with the largest value over distance.
function findOptimalCoin(coins){
    var bestCoin = null;
    var bestCoinValue = 0;
    var coinIndex = 0;
    while(coinIndex < coins.length){
        var coin = coins[coinIndex];
        var currentCoinValue = coin.value / hero.distanceTo(coin);
        if(bestCoinValue < currentCoinValue){
            bestCoin = coin;
            bestCoinValue = currentCoinValue;
        }
        coinIndex++;
    }
    return bestCoin;
}

while(true) {
    var enemies = hero.findEnemies();
    enemy = findMostHealth(enemies);
    if(enemy && enemy.health > 15) {
        while(enemy.health > 0) {
            hero.attack(enemy);
        }
    } else {
        coins = hero.findItems();
        coin = null;
        coin = findOptimalCoin(coins); // ∆ Uncomment this once you've written the function.
        if(coin) {
            //hero.say(coin.value);
            hero.moveXY(coin.pos.x, coin.pos.y);
        }
    }
}

I can not find what is wrong with my code, need help.

2

Claim the coins while defeating the marauding ogres.

If you defeat the ogre with the most health, the rest of the ogres will run!

Coins vanish quickly after appearing, so be sure to find the best value!

def findMostHealth(enemies):
target = None
targetHealth = 0
enemyIndex = 0
while enemyIndex < len(enemies):
enemy = enemies[enemyIndex]
if enemy.health > targetHealth:
target = enemy
targetHealth = enemy.health
enemyIndex += 1
return target

Make a function named findOptimalCoin which returns the coin with the best value.

Coins rapidly appear and disappear, so pick the best coin.

Optimize your path by going for the coin with the largest value over distance.

def findOptimalCoin(coins):
optimal = 0
coinOpt = None
for coin in coins:
if coin.value / hero.distanceTo(coin) > optimal:
optimal = coin.value / hero.distanceTo(coin)
coinOpt = coin
return coinOpt

while True:
enemies = hero.findEnemies()
enemy = findMostHealth(enemies)
if enemy and enemy.health > 15:
while enemy.health > 0:
hero.attack(enemy)
else:
coins = hero.findItems()
coin = None
coin = findOptimalCoin(coins) # ∆ Uncomment this once you’ve written the function.
if coin:
if hero.isReady(‘jump’):
hero.jumpTo(coin)
else:
hero.moveXY(coin.pos.x, coin.pos.y)
object:echac