C++ Very simple solution (Easy😎😎)
\nclass Solution {\npublic:\n    vector<int> change(vector<int>arr,vector<int>v){\n        int n=v.size();\n         for(int i=0;i<n;i++){\n            if(i%2==
```\nclass Solution {\npublic:\n    vector<int> change(vector<int>arr,vector<int>v){\n        int n=v.size();\n         for(int i=0;i<n;i++){\n            if(i%2==0){\n                arr[i]=v[i/2];\n            }\n            else{\n                arr[i]=v[(n/2) + ((i-1)/2) ];\n            }\n        }\n        return arr;\n    }\n    int reinitializePermutation(int n) {\n        vector<int>v(n);\n        for(int i=0;i<n;i++){\n            v[i]=i;\n        }\n        vector<int>arr(n);\n        \n        arr=change(arr,v);\n        if(arr==v){return 1;}\n       \n        int cnt=1;\n        \n        while(arr!=v){\n            arr=change(arr,arr);\n            cnt++;\n            if(arr==v){return cnt;}\n           \n        }\n        return cnt;\n    }\n};\n```
['C', 'C++']