JAVA | 100% fast solution
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 {\n    public int[] findArray(int[] pref) {\n        int len = pref.length;\n        for(int i = len - 1; i > 0; i--){\n            pref[i] = pref[i - 1] ^ pref[i];\n        }\n        return pref;\n    }\n}\n```
['Array', 'Java']