Chocolate Monger - Problem | Code Chef || Daily Coding Problem || Java Code ||

Описание

Hello and welcome to Today’s video
.
.
.
Problem - Chocolate Monger
Problem Code - CM164364
Problem Level- Easy
Platform - Code Chef

Problem Statement :
There are n chocolates, and you are given an array of n numbers where the i-th number A_i is the flavour type of the i-th chocolate. Sebrina wants to eat as many different types of chocolates as possible, but she also has to save at least x number of chocolates for her little brother.

Find the maximum possible number of distinct flavour types Sebrina can have.
.
.
.
Problem link: https://www.codechef.com/LP1TO205/problems/CM164364?tab=statement
.
.
.
.
HashSet Video link : https://www.youtube.com/watch?v=nWXJ-JqXfJ4
.
.
.

Thanks 4 watching