class Solution {
public:
int removeDuplicates(int A[], int n) {
if( n == 0 ) {
return 0;
}
int count = 1;
int last = A[0];
int index = 1;
for( int i = 1 ; i < n ; i++ ) {
if( A[i] == last && count == 1 ) {
A[index++] = A[i];
count++;
}
else if( A[i] == last ) {
}
else {
A[index++] = A[i];
count = 1;
last = A[i];
}
}
return index;
}
};
System Design for Beginners
A masterclass that helps early engineers and product managers become great at designing scalable systems.
132+ learners
Details →System Design Masterclass
A masterclass that helps you become great at designing scalable, fault-tolerant, and highly available systems.
1000+ learners
Details →Redis Internals
Learn internals of Redis by re-implementing some of the core features in Golang.
98+ learners
Details →