Added soln for 3075. Maximize Happiness of Selected Children (Java)

[RatanKokal]

Pull Request Template

Description

3075. Maximize Happiness of Selected Children

Each of the children have a happiness value assigned to them. One needs to select the children with maximum happiness in each turn for k turns and return the maximum sum. In each turn the happiness of the children who have not been selected reduces by 1. Note: Happiness can't be negative at any instant

Topics: Arrays, Sorting, Greedy

No dependencies

Put check marks:

Have you made changes in README file ?

• [x] Added problem & solution under correct topic.
• [x] Specified Space & Time complexity.
• [x] Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• [x] Test A
• [x] Test B

My solution got accepted on LeetCode.

Make sure all below guidelines are followed else PR will get Reject:

• [x] My code follows the style guidelines of this project
• [x] I have performed a self-review of my own code
• [x] I have commented my code so that it is easy to understand
• [x] I have made corresponding changes to the documentation
• [x] My changes generate no new warnings
• [x] Any dependent changes have been merged and published in downstream modules

[welcome[bot]]

I can tell this is your first pull request! Thank you I'm so honored. :tada::tada::tada: I'll take a look at it ASAP!