Back to course home
0% completed
Vote For New Content
Easier approach
Shivangi Pandey
Mar 28, 2024
class Solution { public int remove(int[] arr) { // TODO: Write your code here int p=1; int q=arr[0]; for(int i:arr){ if(q!=i){ q=i; p+=1; } } return p; } }
0
2
Comments
Comments
On this page
Problem Statement
Solution
Step-by-Step Algorithm
Algorithm Walkthrough
Code
Complexity Analysis
Time Complexity
Space Complexity
Similar Questions
Solution:
Complexity Analysis
Time Complexity
Space Complexity