wat a dumb sh1t question. i thought u need to defeat the enemies from 1 to n in order, used the standard method to do it but got wrong answer. checked my code for ages then realized the dumb fk question doesnt require the enemies in order

this is a Easy, Problem Solving (Basic), Max Score: 5, why is this 50 points and in dynamic programming? the other dynamic programming questions are HARD, i cant even do the red ones. this question is for people on their 1st day of learning programming and belongs to Warmup

another fail from hackerrank

Embark on adventures with our promotional travel mugs while exploring "Mandragora Forest." These mugs keep your beverages at the ideal temperature as you delve into fantastical realms or plan outdoor escapades. Whether hiking, camping, or exploring fictional landscapes, our travel mugs ensure you stay refreshed and focused. Enjoy the journey with our durable and stylish travel mugs, designed to accompany you through every twist and turn in Mandragora Forest or any outdoor expedition.

The problem statement might throw some people off (it did for me).

Note: You don't need to face the mandragons in order. You can choose to face them in any order. Intuitively, you would choose to face them in increasing size of health (this is because if you choose to save and increase s, you would do so for smaller payout monsters that lead to bigger earnings later on.)

def mandragora(H):
    H.sort()
    s = 1
    sumTail = sum(H)
    for i in range(0, len(H)):
        saveValue = (s+1)*(sumTail - H[i])
        eatValue = s*sumTail
        if saveValue > eatValue:
            s += 1
            sumTail -= H[i]
        else:
            return eatValue 

Here is my solution in java, javascript, python, C ,C++, Csharp HackerRank Mandragora Forest Problem Solution

Here is Mandragora Forest problem solution - https://programs.programmingoneonone.com/2021/07/hackerrank-mandragora-forest-problem-solution.html