We at gradjobopenings.com provide free job alerts of freshers job drives. In this website we list on campus job openings for freshers and off campus job openings for freshers and also work from home job openings. This is the best website to apply for off campus drive in India. Visit our website for government job alerts and private job alerts. We also list free interview notes and study materials, one of the best interview study website.comfortable to face the **interviews**:

Given an integer array `nums`

and an integer `val`

, remove all occurrences of `val`

in `nums`

**in-place**. The relative order of the elements may be changed.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the **first part** of the array `nums`

. More formally, if there are `k`

elements after removing the duplicates, then the first `k`

elements of `nums`

should hold the final result. It does not matter what you leave beyond the first `k`

elements.

Return `k`

* after placing the final result in the first *`k`

* slots of *`nums`

.

Do **not** allocate extra space for another array. You must do this by **modifying the input array in-place** with O(1) extra memory.

**Custom Judge:**

The judge will test your solution with the following code:

int[] nums = [...]; // Input array int val = ...; // Value to remove int[] expectedNums = [...]; // The expected answer with correct length. // It is sorted with no values equaling val. int k = removeElement(nums, val); // Calls your implementation assert k == expectedNums.length; sort(nums, 0, k); // Sort the first k elements of nums for (int i = 0; i < actualLength; i++) { assert nums[i] == expectedNums[i]; }

If all assertions pass, then your solution will be **accepted**.

**Example 1:**

Input:nums = [3,2,2,3], val = 3Output:2, nums = [2,2,_,_]Explanation:Your function should return k = 2, with the first two elements of nums being 2. It does not matter what you leave beyond the returned k (hence they are underscores).

**Example 2:**

Input:nums = [0,1,2,2,3,0,4,2], val = 2Output:5, nums = [0,1,4,0,3,_,_,_]Explanation:Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4. Note that the five elements can be returned in any order. It does not matter what you leave beyond the returned k (hence they are underscores).

**Constraints:**

`0 <= nums.length <= 100`

`0 <= nums[i] <= 50`

`0 <= val <= 100`

**Time:**O(n)*O*(*n*)**Space:**O(1)*O*(1)

### Remove Element Program Solution In C++

```
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int i = 0;
for (const int num : nums)
if (num != val)
nums[i++] = num;
return i;
}
};
```

### Remove Element Program Solution In JAVA

```
class Solution {
public int removeElement(int[] nums, int val) {
int i = 0;
for (final int num : nums)
if (num != val)
nums[i++] = num;
return i;
}
}
```

### Remove Element Program Solution In Python

```
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
i = 0
for num in nums:
if num != val:
nums[i] = num
i += 1
return i
```