We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 386724b commit 324abceCopy full SHA for 324abce
docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md
@@ -1,8 +1,8 @@
1
2
-# [Greedy Algorithms: Greedy Florist](https://www.hackerrank.com/challenges/greedy-florist)
+# [Greedy Algorithms: Max Min](https://www.hackerrank.com/challenges/angry-children)
3
4
- Difficulty: `#medium`
5
-- Category: `#ProblemSolvingBasic`
+- Category: `#ProblemSolvingBasic` `#greedy`
6
7
You will be given a list of integers, `arr`, and a single integer `k`.
8
You must create an array of length `k` from elements of `arr` such that
0 commit comments