Tips | for those who got lot of WA || Python
I know this problem is very poor and deceptive. But a lot of us have wasted a lot of time in the contest on this. So solution for those legends. Keep grinding\n
I know this problem is very poor and deceptive. But a lot of us have wasted a lot of time in the contest on this. So solution for those legends. Keep grinding\n\n```\ndef minCostSetTime(self, startAt: int, moveCost: int, pushCost: int, targetSeconds: int) -> int:\n        \n        secs = targetSeconds%60\n        mins = targetSeconds//60\n        cost = float(\'inf\')\n        booli = False\n        \n        # print(mins,secs)\n        if secs==0:\n            time1 = str(mins) + \'00\'\n            time2 = str(mins - 1) + \'60\'\n            if mins >= 99:\n                    time1 = time2 = str(mins - 1) + str(secs + 60)\n        else:\n            print(mins)\n            if mins<=1:\n                # print(\'here\')\n                time = str(targetSeconds)\n                if int(time) <= 99:\n                    booli = True\n            if 1<=secs <=9:\n                time1 = str(mins) +\'0\' + str(secs)\n                time2 = str(mins - 1) + str(secs + 60)\n                if mins >= 99:\n                    time1 = time2 = str(mins - 1) + str(secs + 60)\n            elif 10<= secs <= 39:\n                time1 = str(mins) + str(secs)\n                time2 = str(mins - 1) + str(secs + 60)\n                if mins >= 99:\n                    time1 = time2 = str(mins - 1) + str(secs + 60)\n            else:\n                if mins <=99:\n                    time1 = str(mins) + str(secs)\n                    time2 = time1\n                else:\n                    time1=time2 = str(mins-1) + str(secs + 60)\n        \n        arr = [time1,time2]\n        if booli:\n            arr.append(time)\n        # print(arr)\n        for ele in arr:\n            if str(startAt)==ele[0]:\n                curr = pushCost\n            else:\n                curr = moveCost+pushCost\n            for i in range(1,len(ele)):\n                if ele[i] == ele[i-1]:\n                    curr += pushCost\n                else:\n                    curr += moveCost + pushCost\n            print(curr,ele)\n            cost = min(cost,curr)\n                \n        return cost\n```\nSorry for contest quality code. Took me a lot of debugging.
[]