Easy CPP Solution || Beats 100% of CPP Solutions
```\nclass Solution {\npublic:\n    int countStudents(vector& students, vector& sandwiches) {\n        int i=0,j=0;\n        while(j<sandwiches.size()){\n      
```\nclass Solution {\npublic:\n    int countStudents(vector<int>& students, vector<int>& sandwiches) {\n        int i=0,j=0;\n        while(j<sandwiches.size()){\n            if(students[i]==sandwiches[j]) {\n                i++;\n                j++;\n            }\n            else{\n                int flag=0;\n                for(int k=i+1;k<students.size();k++) if(students[k]!=students[i]) {\n                    flag=1;\n                    break;\n                }\n                if(flag==0) break;\n                students.push_back(students[i]);\n                i++;\n            }\n            \n        }\n        return students.size()-i;\n    }\n};\n\n\n\n**/// upvote if u really like my solution  , it\'s motivate  me.**
['Stack', 'Queue']