# Move Element to End

Master the technique of reorganizing arrays by moving elements while maintaining structure.

array
medium

Published At

3/5/2023

You're given an array of integers and an integer. Write a function that moves all instances of that integer in the array to the end of the array and returns the array.

The function should perform this in place (i.e., it should mutate the input array) and doesn't need to maintain the order of the other integers.

### Sample Input

js
``````array = [2, 1, 2, 2, 2, 3, 4, 2]
toMove = 2``````
js
``````array = [2, 1, 2, 2, 2, 3, 4, 2]
toMove = 2``````

### Sample Output

js
``[1, 3, 4, 2, 2, 2, 2, 2] // the numbers 1, 3, and 4 could be ordered differently``
js
``[1, 3, 4, 2, 2, 2, 2, 2] // the numbers 1, 3, and 4 could be ordered differently``

### Hints

Hint 1

You can solve this problem in linear time.

Hint 2

In view of Hint #1, you can solve this problem without sorting the input array. Try setting two pointers at the start and end of the array, respectively, and progressively moving them inwards.

Hint 3

Following Hint #2, set two pointers at the start and end of the array, respectively. Move the right pointer inwards so long as it points to the integer to move, and move the left pointer inwards so long as it doesn't point to the integer to move. When both pointers aren't moving, swap their values in place. Repeat this process until the pointers pass each other.

Optimal Space & Time Complexity

O(n) time | O(1) space - where n is the length of the array

Solution-1
js
``````function moveElementToEnd(array, toMove) {
let count = 0;
let arrLen = array.length;

while (count < arrLen) {
if (array[count] == toMove) {
array.splice(count, 1)
array.push(toMove)
arrLen--;
} else {
count++;
}
}

return array
}``````
Solution-1
js
``````function moveElementToEnd(array, toMove) {
let count = 0;
let arrLen = array.length;

while (count < arrLen) {
if (array[count] == toMove) {
array.splice(count, 1)
array.push(toMove)
arrLen--;
} else {
count++;
}
}

return array
}``````
Solution-2
js
``````function moveElementToEnd(array, toMove) {
let count = 0;
let arrLen = array.length - 1;

while (count < arrLen) {
while (count < arrLen && array[arrLen] === toMove) arrLen--;
if (array[count] === toMove) swap (count, arrLen, array);
count++
}

return array
}

function swap(i, j, array) {
const temp = array[j]
array[j] = array[i]
array[i] = temp
}``````
Solution-2
js
``````function moveElementToEnd(array, toMove) {
let count = 0;
let arrLen = array.length - 1;

while (count < arrLen) {
while (count < arrLen && array[arrLen] === toMove) arrLen--;
if (array[count] === toMove) swap (count, arrLen, array);
count++
}

return array
}

function swap(i, j, array) {
const temp = array[j]
array[j] = array[i]
array[i] = temp
}``````

🏅

Do you have any questions, or simply wish to contact me privately? Don't hesitate to shoot me a DM on Twitter.

Have a wonderful day.
Abhishek 🙏

## Join My Exclusive Newsletter Community

Step into a world where creativity intersects with technology. By subscribing, you'll get a front-row seat to my latest musings, full-stack development resources, and exclusive previews of future posts. Each email is a crafted experience that includes:

• In-depth looks at my covert projects and musings to ignite your imagination.
• Handpicked frontend development resources and current explorations, aimed at expanding your developer toolkit.
• A monthly infusion of inspiration with my personal selection of quotes, books, and music.

Embrace the confluence of words and wonder, curated thoughtfully and sent straight to your inbox.

No fluff. Just the highest caliber of ideas.