Simple Python Solution --> Time: O(n), Space: O(1)
\nclass Solution:\n    def minNumberOfHours(self, initialEnergy: int, initialExperience: int, energy: List[int], experience: List[int]) -> int:\n        N = len
```\nclass Solution:\n    def minNumberOfHours(self, initialEnergy: int, initialExperience: int, energy: List[int], experience: List[int]) -> int:\n        N = len(energy)\n        currEnergy, currExp = initialEnergy, initialExperience\n        enNeeded, expNeeded = 0, 0\n        for i in range(N):\n            enNeeded = max(1 + energy[i] - currEnergy, enNeeded)\n            expNeeded = max(1 + experience[i] - currExp, expNeeded)\n            currEnergy -= energy[i]\n            currExp += experience[i]\n        return enNeeded + expNeeded\n    # Time: O(n) where n is the length of energy\n    # Space: O(1)\n```
['Python']