Question doubt

Правка en1, от anshu2002, 2022-08-27 15:27:02

There is an array consisting of numbers from 0 to 9 You have to divide the array into buckets such that every occurance of each number falls in only one bucket So find the maximum number of buckets you can form Example arr = {0,0,1,1,2,1,7,8,7,9,9}

ans = 4

({0,0},{1,1,2,1},{7,8,7},{9,9})

Теги geeksforgeeks

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский anshu2002 2022-08-27 15:27:45 0 (published)
en1 Английский anshu2002 2022-08-27 15:27:02 316 Initial revision (saved to drafts)