Aggressive Cows Maximum Minimum Distance in DSA Typescript - Build from Scratch

Aggressive Cows Maximum Minimum Distance

📖 Scenario: You are managing a farm with several stalls placed along a straight line. You want to place cows in these stalls so that the minimum distance between any two cows is as large as possible. This helps keep the cows calm and happy.

🎯 Goal: Build a program that finds the largest minimum distance possible between cows placed in the stalls.

📋 What You'll Learn

Create an array called stalls with the exact values [1, 2, 8, 4, 9] representing stall positions.

Create a variable called cows and set it to 3 representing the number of cows to place.

Write a function called canPlaceCows that checks if cows can be placed with at least a given minimum distance.

Use binary search to find the maximum minimum distance possible.

Print the final maximum minimum distance.

💡 Why This Matters

🌍 Real World

This problem models placing resources or devices in locations to maximize minimum spacing, useful in network design, agriculture, and facility planning.

💼 Career

Understanding binary search on answer space and greedy placement is important for software engineering roles involving optimization and algorithm design.

1

Create the stalls array

Create an array called stalls with these exact values: [1, 2, 8, 4, 9].

DSA Typescript

# Create the stalls array with the given positions
// Your code here

Hint

Use const stalls = [1, 2, 8, 4, 9]; to create the array.

2

Set the number of cows

Create a variable called cows and set it to 3.

DSA Typescript

const stalls = [1, 2, 8, 4, 9];
// Create the cows variable and set it to 3
// Your code here

Hint

Use const cows = 3; to set the number of cows.

3

Write the function to check placement feasibility

Write a function called canPlaceCows that takes distance as a parameter and returns true if it is possible to place all cows in stalls with at least that distance between them, otherwise false. Use variables count and lastPosition inside the function.

DSA Typescript

const stalls = [1, 2, 8, 4, 9];
const cows = 3;
// Write the canPlaceCows function below
// Your code here

Hint

Sort the stalls first. Then try placing cows starting from the first stall. Increase count when distance condition is met.

4

Find and print the maximum minimum distance

Use binary search between low = 1 and high = max(stalls) - min(stalls) to find the largest minimum distance where canPlaceCows returns true. Print the final maximum minimum distance using console.log.

DSA Typescript

const stalls = [1, 2, 8, 4, 9];
const cows = 3;

function canPlaceCows(distance: number): boolean {
    stalls.sort((a, b) => a - b);
    let count = 1;
    let lastPosition = stalls[0];
    for (let i = 1; i = distance) {
            count++;
            lastPosition = stalls[i];
            if (count === cows) {
                return true;
            }
        }
    }
    return false;
}

// Use binary search to find max minimum distance and print it
// Your code here

Hint

Use binary search on distance. If canPlaceCows(mid) is true, try bigger distance. Otherwise, try smaller.