Problem Description
Given an array A and a value B, remove all the instances of that value in the array.
Also, return the number of elements left in the array after the operation. It does not matter what is left beyond the expected length.
Try to do it in less than linear additional space complexity.
Problem Constraints
1 <= |A| <= 106
0 <= Ai , B <= 2 * 109
Input Format
The first argument is an integer array A.
The second argument is an integer B.
Output Format
Return an integer denoting the number of elements left in the array after the operation, also update the given array A.
Example Input
A = [4, 1, 1, 2, 1, 3]
B = 1
Example Output
Length : 3
Array A : [4, 2, 3]
Example Explanation
If array A is [4, 1, 1, 2, 1, 3]
and the value element is 1,
then the new length is 3, and A is now [4, 2, 3]
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.