Simple Two Combination Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(1)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public int minCostSetTime(int startAt, int moveCost, int pushCost, int targetSeconds) {\n        int minCost = Integer.MAX_VALUE;\n\n        int minutes = targetSeconds / 60;\n        int seconds = targetSeconds % 60;\n\n        // Check (minutes, seconds) and (minutes - 1, seconds + 60)\n        if (minutes < 100) {\n            String timeStr = String.format("%02d%02d", minutes, seconds);\n            minCost = Math.min(minCost, calculateCost(startAt, moveCost, pushCost, timeStr));\n        }\n\n        // Also check if we can represent the time as (minutes - 1, seconds + 60)\n        if (minutes >= 0 && seconds + 60 < 100) {\n            String timeStr = String.format("%02d%02d", minutes - 1, seconds + 60);\n            minCost = Math.min(minCost, calculateCost(startAt, moveCost, pushCost, timeStr));\n        }\n\n        return minCost;\n    }\n\n    private int calculateCost(int startAt, int moveCost, int pushCost, String timeStr) {\n        int totalCost = 0;\n        int currentPos = startAt; \n        \n        int startIndex = 0;\n        while (startIndex < timeStr.length() && timeStr.charAt(startIndex) == \'0\') {\n            startIndex++;\n        }\n\n        for (int i = startIndex; i < timeStr.length(); i++) {\n            int digit = timeStr.charAt(i) - \'0\';\n            \n            if (currentPos != digit) {\n                totalCost += moveCost;\n                currentPos = digit;\n            }\n            \n            totalCost += pushCost;\n        }\n        \n        return totalCost;\n    }\n}\n```
['Math', 'Enumeration', 'Java']