solution without using new array
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    // vector<int> findArray(vector<int>& pref) {\n    //     int n = pref.size();\n    //     vector<int> ans;\n    //     ans.push_back(pref[0]);\n\n    //     for(int i = 1; i < n; i++){\n    //         int result = pref[i] ^ pref[i - 1];\n    //         ans.push_back(result);\n    //     }\n    //     return ans;\n    // }\n    \n    //2nd method without using new array\n    \n    vector<int> findArray(vector<int>& pref) {\n        int n = pref.size();\n       \n        for(int i = n-1; i > 0; i--){\n            pref[i] = pref[i] ^ pref[i - 1];\n        }\n        return pref;\n    }\n};\n```
['C++']