100% BEAT PYTHON ONE-LINER
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```\nclass Solution:\n    def numOfBurgers(self, tomatoSlices: int, cheeseSlices: int) -> List[int]:\n        return [] if ((4 * cheeseSlices) - tomatoSlices) %2==1 or ((4 * cheeseSlices) - tomatoSlices) //2>cheeseSlices or (4 * cheeseSlices) < tomatoSlices else [(tomatoSlices-((4 * cheeseSlices) - tomatoSlices) )//4,((4 * cheeseSlices) - tomatoSlices) //2]\n```
['Math', 'Greedy', 'Brainteaser', 'Python', 'Python3']