Simple Greedy Approach with O(1) Time and Space Complexity..
Approach

Check for infeasibility:

If the number of tomato slices is odd, it's impossible to distribute them evenly between burgers (since each burger requires
<!-- # Intuition -->
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->
* Check for infeasibility:
  * If the number of tomato slices is odd, it's impossible to distribute them evenly between burgers (since each burger requires an even number of tomato slices).
  * If the number of tomato slices is less than twice the number of cheese slices, it is not possible to make valid burgers, so return an empty vector.
* Main Logic to find number of jumbo and small burgers,

        int jumbo = (tomatoSlices - (cheeseSlices * 2)) / 2;
        tomatoSlices = tomatoSlices - (jumbo * 4);
        int small = cheeseSlices - jumbo;
* If small urger comes out to be negative, then return {} else return { jumbo, small }.

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

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

# Code
```cpp []
class Solution {
public:
    vector<int> numOfBurgers(int tomatoSlices, int cheeseSlices) {
        if(((tomatoSlices % 2) != 0) || (tomatoSlices < (cheeseSlices * 2))) return {};

        int jumbo = (tomatoSlices - (cheeseSlices * 2)) / 2;
        tomatoSlices = tomatoSlices - (jumbo * 4);
        int small = cheeseSlices - jumbo;
        if(small < 0) return {};
        return {jumbo, small};
    }
};
```
['Math', 'Greedy', 'C++']