Add new problem "Aggressive Cows" to Adobe Interview Questions #245
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull request adds the problem Aggressive Cows to the Adobe Interview Questions section. The problem involves placing cows in stalls with the maximum possible minimum distance between them using a binary search approach. The solution follows an efficient O(N log N) complexity using sorting and a greedy placement strategy.
Key updates:
Implemented AggressiveCows.java containing the problem solution.
Optimized the code for readability and efficiency.
Ensured adherence to best practices for competitive programming.