Remove Element Problem & Solution

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

See the remove element problem on LeetCode.

C++ Solution

#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")

static const int _=[](){std::ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);return 0;}();

class Solution {
  int removeElement(vector<int>& nums, int val) {
    int j = 0;

    for (int i = 0; i < nums.size(); ++i) {
      if (nums[i] != val) {
        nums[j++] = nums[i];

    return j;

Start Here

Many paths, there are. Follow yours, you must.