o(1) solution python
Intuition2 equations..2 variablesApproach2 equations..2 variables
if any of the slices is negative then return []
if cheeseslice is less the return []Complexity
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
2 equations..2 variables

# Approach
<!-- Describe your approach to solving the problem. -->
2 equations..2 variables
if any of the slices is negative then return []
if cheeseslice is less the return []


# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
$$O(1)$$

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
$$O(1)$$

# Code
```python3 []
class Solution:
    def numOfBurgers(self, tomatoSlices: int, cheeseSlices: int) -> List[int]:
        if tomatoSlices<cheeseSlices or tomatoSlices%2==1:
            return []

        x   = tomatoSlices/2 - cheeseSlices

        y = cheeseSlices - x
        if x<0 or y<0:
            return []
        return [int(x),int(y)]
        

        
```
['Python3']