3 line code O(1) and O(1) :::::::::> This is how legends code 
Intuition, Approach and Thought Process Combined for youThe problem involves finding the number of jumbo and small burgers based on the total number of tomato s
# Intuition, Approach and Thought Process Combined for you 
<!-- Describe your first thoughts on how to solve this problem. -->
The problem involves finding the number of jumbo and small burgers based on the total number of tomato slices (t) and cheese slices (c). Each jumbo burger requires 4 tomato slices and 1 cheese slice, while each small burger requires 2 tomato slices and 1 cheese slice.

We aim to determine if it's possible to satisfy the given constraints (t and c) and, if so, calculate the quantities of jumbo and small burgers. The solution leverages simple algebra to deduce the number of jumbo (x) and small (y) burgers.

The key equations are:

    4x+2y=t (for tomato slices)
    x+y=c (for cheese slices)

By solving these equations:

    From Equation (2): x=c−y x=c−y
    Substitute x into Equation (1): 
     4(c−y)+2y=t
     4c−4y+2y=t 
     2c−2y=t/2 
     y=c−t/2

Now, x can be calculated as: x=t/2−c

From here:

    x=Number of jumbo burgers
    y=Number of small burgers

Finally:

    The solution checks whether the values of x and y are valid (non-negative integers) under the given constraints.

# Complexity
- Time complexity:
     O(1)
- Space complexity:
    O(1)
# Code
```cpp []
class Solution {
public:
    vector<int> numOfBurgers(int t, int c) {
        int x = t/2 - c ;
        if(t%2 == 1 || t/2 < c || c<t/4){
            return {} ;
        }

        return {t/2-c, 2*c -t/2} ;
    }
};
```
['Array', 'Greedy', 'C++']