Question

Q1. Write an algorithm to do the following operation on an array passed as parameter: If an element of the array is having more than one occurrence, then keep the first occurrence and remove all other occurrences of the element.

Answer 1

Please find the answer below.

There can be two types of array

1) Sorted array : { 1, 2, 3 , 4, 5, 5 }

2) Unsorted array : { 1, 4, 5, 2, 6, 4 }

1) Algorithm to remove duplicate elements in a sorted array:

• Input the number of elements of the array (n).
• Input the array (arr) elements.
• Pass the array (arr) and the size of the array (n) into the function as parameters.
• Function :
  • Loop i = 0 to n-1
    • if (arr[i] != arr[i+1])
    • temp[j++] = arr[i]
    • temp[j++] = arr[n-1]
  • Loop i = 0 to j-1
    • arr[i] = temp[i]
  • return j
• Loop i= 0 to j-1
  • Print : arr[i]

2) Algorithm to remove duplicate elements in an unsorted array :

• Input the number of elements of the array (n).
• Input the array elements (arr).
• Pass the array (arr) and the size of the array (n) into the function as parameters.
• Function :
  • Create a hashmap and store all the elements and their count.
  • Print all the elements from the hashmap having count = 1.