Simple easy to understand code
Intuition\nwell it took me a lot of time to get this solution right, although it is not that complex but initially i was thinking we can move to any digit with 
# Intuition\nwell it took me a lot of time to get this solution right, although it is not that complex but initially i was thinking we can move to any digit with move cost and push the button, that itself looked hard. But after reading it again it was easy, sicne we are starting from 0 and pushing the next digit only\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int minCostSetTime(int startAt, int moveCost, int pushCost, int targetSeconds) {\n        //target representation\n        int ans = Integer.MAX_VALUE;\n        for(int x: getNumbers(targetSeconds)){\n            List<Integer> list = new LinkedList();\n            while(x!=0){\n                list.add(x%10);\n                x=x/10;\n            }\n            ans = Math.min(ans, cost(list, startAt, pushCost, moveCost));\n        }\n        return ans;\n    }\n\n    public int cost(List<Integer> list, int startAt, int pushCost, int moveCost){\n        int cost = 0;\n        for(int i=list.size()-1;i>=0;i--){\n            if(startAt == list.get(i)){\n                cost += pushCost;\n            } else {\n                cost += moveCost + pushCost;\n                startAt = list.get(i);\n            }\n        }\n        return cost;\n    }\n\n    public List<Integer> getNumbers(int x){\n        List<Integer> list = new LinkedList<>();\n        for(int i=0;i<100;i++){\n            if(x-i >= 0 && (x-i)%60 == 0 && (x-i)/60 < 100) {\n                list.add(((x-i)/60)*100 + i);\n                if(list.get(0) == 0){\n                    list.removeFirst();\n                }\n                if(list.get(0) == 0){\n                    list.removeFirst();\n                }\n            }\n        }\n        return list;\n    }\n}\n```
['Java']