Fastest [JAVA] Solution 100% faster , 0ms
```\nclass Solution {\n    public int[] sortArrayByParity(int[] nums) {\n      int j = 0;\n      for(int i = 0; i < nums.length; i ++)\n        if(nums[i] % 2 =
```\nclass Solution {\n    public int[] sortArrayByParity(int[] nums) {\n      int j = 0;\n      for(int i = 0; i < nums.length; i ++)\n        if(nums[i] % 2 == 0)\n        {                                      // Swap position of nums[i] and nums[j]\n          int t = nums[i];\n          nums[i] = nums[j];\n          nums[j] = t;\n          j ++;\n        }\n      return nums;\n    }\n}
['Array', 'Two Pointers', 'Java']