Easy C++ Solution || using single queue
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int countStudents(vector<int>& students, vector<int>& sandwiches) {\n       queue<int> q;\n       for(auto i: students){\n           q.push(i);\n       }\n       int i=0,c =0;\n       while(c < q.size() && i < sandwiches.size()){\n           if(q.front()==sandwiches[i]){\n               q.pop();\n               i++;\n               c=0;\n           }\n           else{\n               int val = q.front();\n               q.pop();\n               q.push(val);\n               c++;\n           }\n       }\n       return q.size();\n    }\n};\n```
['C++']