C++ in place solution for 90% faster solution
\nclass Solution {\npublic:\n    vector<int> sortArrayByParityII(vector<int>& nums) {\n         \n        for(int i =0 , j =1 ; j < nums.size() && i <nums.size(
```\nclass Solution {\npublic:\n    vector<int> sortArrayByParityII(vector<int>& nums) {\n         \n        for(int i =0 , j =1 ; j < nums.size() && i <nums.size();)\n        {\n            if(nums[i] %2 ==0)\n            i+=2;\n            else if(nums[j] % 2 ==1)\n            j+=2;\n            else\n            swap(nums[i],nums[j]);\n        }\n        return nums;\n        \n        \n    }\n};\n```
['C', 'C++']