No Math | Intuitive Greedy Solution
Split tomatoSlices to count of 4s as maximum as possible. For Example if tomatoSlices are 18 then count of 4s should be 4 and count of 2s should be 2. Silimarly
Split tomatoSlices to count of 4s as maximum as possible. For Example if tomatoSlices are 18 then count of 4s should be 4 and count of 2s should be 2. Silimarly for 16, count of 4 is 4 and count of 2 is 0.  Then we break down the count of 4s and count of 2s such that it equals to cheeseSlices.\n\n```\nclass Solution {\npublic:\n    vector<int> numOfBurgers(int tomatoSlices, int cheeseSlices) {\n    \n        if(cheeseSlices == 0 && tomatoSlices == 0){\n            return {0, 0} ;\n        }\n        if(cheeseSlices >= tomatoSlices || tomatoSlices %2 != 0){\n            return {} ;\n        }\n        int cnt4s = 0 ;\n        int cnt2s = 0 ;\n        if(tomatoSlices %4 == 0){\n            cnt4s += tomatoSlices /4 ;\n        }else{\n            cnt4s += tomatoSlices /4 ;\n            cnt2s++ ;\n        }\n        \n        while(cheeseSlices > (cnt4s + cnt2s)){\n            if(cnt4s < 0){\n                return {};\n            }\n            cnt4s-- ;\n            cnt2s += 2 ;\n        }\n        \n        if(cheeseSlices == (cnt4s + cnt2s)){\n            return {cnt4s, cnt2s} ;\n        }\n        return {} ;\n    }\n};\n```
['Greedy']