[JAVA] 2 liner easiest solution
\n\n# Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(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(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int[] findArray(int[] pref) {\n      for(int i = pref.length - 1; i > 0; i --) {\n          pref[i] ^= pref[i - 1]; \n      }  \n      return pref;\n    }\n}\n```\n# PLEASE UPVOTE IF IT WAS HELPFULL
['Java']