C++ || Easy || Similar to Find Mes number in Array problem
\tclass LUPrefix {\n\tpublic:\n\t\tset st;\n\t\tunordered_map mp;\n\t\tLUPrefix(int n) \n\t\t{\n\t\t\tst.insert(1);\n\t\t}\n\n\t\tvoid upload(int video) \n\t\t{
\tclass LUPrefix {\n\tpublic:\n\t\tset<long long> st;\n\t\tunordered_map<int, int> mp;\n\t\tLUPrefix(int n) \n\t\t{\n\t\t\tst.insert(1);\n\t\t}\n\n\t\tvoid upload(int video) \n\t\t{\n\t\t\tif (!mp[video + 1])\n\t\t\t{\n\t\t\t\tst.insert(video + 1);\n\t\t\t}\n\t\t\tst.erase(video);\n\t\t\tmp[video]++;\n\t\t}\n\n\t\tint longest() \n\t\t{\n\t\t\treturn *st.begin() - 1;            \n\t\t}\n\t};\n\n\t/**\n\t * Your LUPrefix object will be instantiated and called as such:\n\t * LUPrefix* obj = new LUPrefix(n);\n\t * obj->upload(video);\n\t * int param_2 = obj->longest();\n\t */
[]