> For the complete documentation index, see [llms.txt](https://dailyjournal.gitbook.io/solutions/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://dailyjournal.gitbook.io/solutions/leetcode-solutions/problems/algorithms/easy/905.-sort-array-by-parity.md).

# 905. Sort Array By Parity

https\://leetcode.com/problems/sort-array-by-parity/

{% tabs %}
{% tab title="C#" %}

```csharp
public class Solution {
    public int[] SortArrayByParity(int[] nums) {
        var countEven = 0;
        for(int i = 0; i < nums.Length; i++){
            if(nums[i] % 2 == 0){
                (nums[i], nums[countEven]) = (nums[countEven], nums[i]);
                countEven++;
            }
        }
        return nums;
    }
}
```

* **LINQ**

```csharp
public class Solution {
    public int[] SortArrayByParity(int[] nums) {
        var evenNumbers = nums.Where(n => n % 2 == 0);
        var oddNumbers = nums.Where(n => n % 2 == 1);
        return evenNumbers.Concat(oddNumbers).ToArray();
    }
}
```

{% endtab %}
{% endtabs %}