Best logical solution 100% Faster O(1) time, O(1)space. (No DSA required)
\tThis problem can be easily converted into a 2 equations, 2 variables maths problem.\n\t\n\tFor making a Jumbo burger we require: 4 tomato slices and 1 cheese 
\tThis problem can be easily converted into a 2 equations, 2 variables maths problem.\n\t\n\tFor making a Jumbo burger we require: 4 tomato slices and 1 cheese slice.\n\tSimilarly for making a Small burger we require: 2 tomato slices and 1 cheese slice.\n\t\n\tLet the number of Jumbo burgers which can be made using the given slices be denoted by \'x\' and \n\tnumber of Small burgers which can be made using the given slices be denoted by \'y\'.\n\t\n\tNow since each jumbo burger (x) has 4 tomato slices and each small burger (y) has 2 tomato slices:\n\twe can note that the total number of tomato slices will be equal to: \n\tTomato slices (T) = 4*x + 2*y  - (i)\n\t\n\tSimilarly each jumbo burger (x) has 1 cheese slice and each small burger (y) has 1 cheese slice:\n\twe can note that the total number of cheese slices will be equal to: \n\tCheese slices (C) = x + y  - (ii)\n\t\n\tSolving equations (i) and (ii) we get:\n\tx = (T - 2*C) / 2\n\ty = (4*C - T) / 2\n\t\n```\nclass Solution {\npublic:\n    vector<int> numOfBurgers(int T, int C) \n    {\n        if(T==0 && C==0)// if both the slices are zero\n        {\n            return {0,0};\n        }\n        if(T==0 || C==0)// if either one is zero, answer is not possible\n        {\n            return {};\n        }\n        int x = T-(2*C);\n        if(x>0)\n        {\n            x = x/2;\n        }\n        int y = (4*C)-T;\n        if(y>0)\n        {\n            y = y/2;\n        }\n        if(x+y==C && ((4*x)+(2*y))==T)\n        {\n            return {x,y};\n        }\n        return {};\n    }\n};\n```
[]