CareerCup

In java

public static int removeOccurances(int[] data, int key){
		if (data == null)
			return 0;
		int length = data.length-1;
		if (length < 0)
			return 0;
		for(int i=length; i>=0;i--){
			if(data[i] == key){
				data[i] = data[length]; // replacing occurrence with last element
				data[length--] = 0;	  //  replacing last element with 0	
			}
		}
		return length; // This is the size of array which has no occurrence of key element.
	}

unsigned int remove_key(unsigned int a[], unsigned int size, unsigned int key)
    {
    	unsigned int left = 0;
    	unsigned int right = size - 1;
    	
    	while( left < right )
    	{
    		while( left < size && a[left] != key)
    			left++;
    			
    		while( right >left  && a[right] == key )
    			right--;
    		
    		swap(a,left,right);
    	}
    	return right;
    }

int* removeNumberFromArray(int number, int array[])
{
    int count = 0;
    int size = (sizeof(array)/sizeof(array[0]));
    int j= size - 1;
    for (int i=0; i< (size - count); i++) {
        if(array[i] == number)
        {
            while(array[j] == number)
            {
                j--;
            }
            array[i] = array[j];
            array[j] = '\0';
            j--;
            count++;
        }
    }
    return array1;
}

public static int RemoveAllOccurance_Suffle(int[] a, int key)
        {
            int left = 0;
            int right = a.Length - 1;
            int end = right;

            while (left <= right)
            {
                if (a[left] == key)
                {
                    a[left] = 0;
                    swap(a, left, end);
                    end--;
                }
                left++;

                if (a[right] == key)
                {
                    a[right] = 0;
                    swap(a, right, end);
                    end--;
                }
                right++;
            }

            return end;
        }

public static int RemoveAllOccurance_Suffle(int[] a, int key)
        {
            int left = 0;
            int right = a.Length - 1;
            int end = right;

            while (left <= right)
            {
                if (a[left] == key)
                {
                    a[left] = 0;
                    swap(a, left, end);
                    end--;
                }
                left++;

                if (a[right] == key)
                {
                    a[right] = 0;
                    swap(a, right, end);
                    end--;
                }
                right++;
            }

            return end;
        }

roughly

for(i=0; i<N; i++)
   if(you hate a[i])
      a[i] = a[(N--)  -1];

return N; //new array size

Try it and fix the bugs?

void swap_int( int *a, int *b)
{

int temp=*a;
*a=*b;
*b=temp;
}

void remove_dup( int arr[],int num,int *size)
{
for(int i=0;i<(*size);i++)
{
if(arr[i]==num)
{
swap_int(&arr[i],&arr[*size]);
(*size)=(*size)-1;
}
}

}
int main()
{
int arr[]={1,2,4,5,6,7,8,354,345,12,7,89};
int size=(sizeof(arr)/sizeof(arr[0]))-1;

cout<<"\n\n\n\n";
remove_dup(arr,6,&size);


}