Math | O(1)
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# Co
# 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```python3 []\nclass Solution:\n    def numOfBurgers(self, tomatoSlices: int, cheeseSlices: int) -> List[int]:\n        # 4x  + 2y = k\n        # x + y = h\n        # 4x + 2(h - x) = k\n        # x = (k - 2h) // 2\n        if tomatoSlices % 2:\n            return []\n        jumbo = (tomatoSlices - 2*cheeseSlices) // 2\n        if jumbo < 0 or jumbo > cheeseSlices:\n            return []\n        else:\n            return [jumbo, cheeseSlices - jumbo]\n```
['Python3']