Aggressive Cows Problem Statement

[dewanshiPaul]

Related Issue

• Issue No: Aggressive Cows Problem Statement Solution #802

Proposed Changes

• Added a binary seach level-2 problem solution
• Added readme for it with explanations

Checklist

• ✅ My code follows the code style of this project.
• 📝 My change requires a change to the README.
• 🎀 I have updated the README accordingly.
• 👀 I have read the CONTRIBUTING document.
• ✨ I have added tests to cover my changes.
• 🚩 All new and existing tests passed.
• 🌟 ed the repo

This is code for a problem known as aggressive cows. The statement is:
There is a new barn with N stalls and C cows. The stalls are located on a straight line at positions x1,….,xN (0 <= xi <= 1,000,000,000). We want to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?

Explanation of the problem statement with approach discussion and time complexity is added in readme file. This is a level 2 problem which was not present in repo and hence gives understanding of binary search related problems.

• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• Breaking change (fix or feature that would cause existing functionality to change)

Screenshots

Screenshot 1	Screenshot 2
Readme	Code

Output Screenshot

[Lakhankumawat]

LGTM 🎉✨
Your contribution looks great keep contributing like this .
Contiuous Good Contribution 1

Mention this Pr in your next PRs and you will have a chance to get your levels increased 🎀

[Lakhankumawat]

@all-contributors please add @dewanshiPaul code ,

[allcontributors]

@Lakhankumawat

I've put up a pull request to add @dewanshiPaul! 🎉