HackerRank - Equal | Full Solution with Simplified Examples and Visuals | Study Algorithms

Показать описание

In this problem you want to ensure that all the employees have an equal number of chocolate distribution. However, you can only give 1, 2, or 5 chocolates at a time. You give chocolates to everyone but 1 employee. In this video I explain the test cases to understand it in a perfect way. Then watch the video to see how I simplify the problem using a very neat trick. All along with visuals and explanations.

Chapters:
00:00 - Intro
01:06 - Problem statement and description
05:08 - Simplification of problem
09:00 - How to Solve?
14:28 - Dry-run of Code
19:24 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#hackerrank #programming #interview

Рекомендации по теме

Комментарии

Thanks brother! Finally I understood it. The visuals and explanation were really good.

doingsneakypeakylike

Nice solution, we can have only three possibilites[ will lead to recurrence.... Why? because in question we are given [1, 2, 5]...
This works for me->
int equal(vector<int> arr) {
vector<int> possibilities(3);

// Start with the minimum element
int minimum = *min_element(arr.begin(), arr.end());

for (int i = 0; i < 3; i++) {

for (int k : arr) {
int diff = k - minimum;
int stepsRequired = diff / 5 + (diff % 5) / 2 + ((diff % 5) % 2) / 1;
possibilities[i] += stepsRequired;
}
minimum--;
}

// Return the minimum number out of all the possibilities
return *min_element(possibilities.begin(), possibilities.end());
}

sudarshanmaskare