Make all array elements equal to 0 by replacing minimum subsequences consisting of equal elements | Java program for the above approach ; Function to find minimum count of operations required to convert all array elements to zero br replacing subsequence of equal elements to 0 ; Store distinct elements present in the array ; Traverse the array ; If arr [ i ] is already present in the Set or arr [ i ] is equal to 0 ; Otherwise , increment ans by 1 and insert current element ; Driver Code ; Given array ; Size of the given array
import java . io . * ; import java . util . * ; class GFG { static void minOpsToTurnArrToZero ( int [ ] arr , int N ) { Set < Integer > st = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < N ; i ++ ) { if ( st . contains ( arr [ i ] ) arr [ i ] == 0 ) { continue ; } else { st . add ( arr [ i ] ) ; } } System . out . println ( st . size ( ) ) ; } public static void main ( String args [ ] ) { int arr [ ] = { 3 , 7 , 3 } ; int N = arr . length ; minOpsToTurnArrToZero ( arr , N ) ; } }