simple and easy C++ solution
\n# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n###### Let\'s Connect on LinkedIn: www.linkedin.com/in/shishirrsiam\n###### Let\'s Connect on Facebook
\n# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n###### Let\'s Connect on LinkedIn: www.linkedin.com/in/shishirrsiam\n###### Let\'s Connect on Facebook: www.fb.com/shishirrsiam\n\n\n\n\n# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    vector<int> findArray(vector<int>& pref) \n    {\n        int n = pref.size();\n        vector<int>ans(n);\n        ans[0] = pref[0];\n        for(int i = 1; i < n; i++)\n            ans[i] = pref[i] ^ pref[i - 1];\n        return ans;\n    }\n};\n```
['Array', 'Bit Manipulation', 'C++']