Скачать или смотреть LeetCode Problem: 905. Sort Array By Parity || Java Solution Walkthrough

LeetCode is a great platform for people who want general coding practice, whether that be for interviews or just wanting to practice their problem solving. I will be taking you through all the steps of finding the optimal solution to each problem on the site following a logical ordering setout by LeetCode themselves.

In this video, we are going over the problem 905. Sort Array By Parity, where the goal is to check whether or not the current value inside of the array is an even number or an odd number. If it is an odd number, we want to shift it to the end of the array.

This problem does not require us to modify the array in place, however it is not any more difficult to modify it in place than it is to create a new array, so we will go ahead and just modify it in place. We can use a counting system similar to some of our previous problems to keep track of the last index of our even numbers, and use that to know where to place our even or odd numbers.

~~~ Stay Up To Date With My Social Media ~~~

Twitter:   / unknownkoder  
Twitch:   / unknownkoderyt  
Be sure to subscribe and turn on the bell notifications on youtube to not miss another episode of Lets Build Twitter: shorturl.at/gnxZ8

#unknownkoder #leetcode #algorithms