PROBLEM LINK : https://www.hackerearth.com/practice/data-structures/trees/binary-search-tree/practice-problems/algorithm/monk-and-his-friends/?fbclid=IwAR1n1FJUNpWIeq7dHY-HytoqqE1nbK9gD4jMjI2UWGTPE8GF4kHROCb7ouA
MY SOLUTION : MY CODE WHICH IS DISPLAYING WRONG ANSWERS
FOR SOLVING THIS QUESTION PLZ TRY TO USE SETS AND MAPS AS I HAVE’NT DONE BST
MY APROACH : STORING NUMBER OF CANDIES WITH STUDENTS IN THE CLASS INTO A MULTISET IF A STUDENT WITH SAME NUMBER OF CANDIES FOUND PRINT YES AND ERASE THAT STUDENT FROM MULTISET
New contributor
Yug Bhatia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1