LeetCode Remove Element

Easy!

O(n)

class Solution {
public:
    int removeElement(int A[], int n, int elem) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        int p=0;
        int q=0;
        while(q<n)
        {
            if(A[q]==elem)
            {
               q++;
            }
            else
            {
                A[p] = A[q];
                p++; q++;
            }
        }
        
        return p;
    }
};