C++ 💪 Based Solution to terrible problem 💪 with explanation | Beats 150%
\nclass OrderedStream {\nprivate:\n    int k; //pointer to min index\n    vector<string> chunks; //chunky boy\npublic:\n    OrderedStream(int n) {\n        k = 
```\nclass OrderedStream {\nprivate:\n    int k; //pointer to min index\n    vector<string> chunks; //chunky boy\npublic:\n    OrderedStream(int n) {\n        k = 1; //init to first pos\n        \n        for(int i = 0; i < n; i++) {\n            chunks.push_back("-1"); //init all pos to -1 (unvisited)\n        }\n        \n    }\n    \n    vector<string> insert(int idKey, string value) {\n        vector<string> chunk{}; //output chonk\n        chunks[idKey-1] = value; //replace -1 with actual value, 0-indexed\n        \n        if(idKey == k) { //if we are on our min pointer\n            while(k <= chunks.size() && chunks[k-1] != "-1") { //and we are within bounds and haven\'t visited this index yet, \n                chunk.push_back(chunks[k-1]); //push to output chonk\n                k++; //increase pointer, will increase to next "-1" unvisited index\n            }\n        }\n        \n        return chunk;\n    }\n};\n```
[]