remove_elm.cpp

/*
LeetCode: Problem 27: Remove Element
Difficulty Level: Easy
Name: Nava Nizard
Date: September 12, 2025
Programming Language: C++
Instructions: Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. 
    The order of the elements may be changed. Then return the number of elements in nums which are not equal 
    to val.
Approach: Iterate through the array; when you find the target value, replace it with the 
    last element and shorten the array length. Otherwise, move forward. Return the new length.
*/



class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int elms = nums.size();
        int idx = 0;
        while (idx < elms) {
            if (nums[idx] == val) {
                nums[idx] = nums[elms - 1];
                elms--;
            }
            else {
                idx++; //only continue if no overwrite

            }
        }
        return elms; //number of elms not equal to val
    }
};