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

Aggressive Cows Maximum Minimum Distance

📖 Scenario: You are helping a farmer place aggressive cows in stalls along a straight line. The farmer wants to place all cows so that the minimum distance between any two cows is as large as possible. You will write a program to find this largest minimum distance.

🎯 Goal: Build a Go program that takes stall positions and the number of cows, then calculates the maximum minimum distance possible between any two cows placed in those stalls.

📋 What You'll Learn

Create a slice called stalls with the exact values 1, 2, 4, 8, 9

Create an integer variable called cows and set it to 3

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

Use binary search to find the maximum minimum distance

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 and greedy algorithms is essential for software engineering roles involving optimization and algorithmic problem solving.

1

Create the stalls slice

Create a slice called stalls with the exact values 1, 2, 4, 8, 9.

DSA Go

# Create the stalls slice with values 1, 2, 4, 8, 9
# Your code here

Hint

Use := to create and assign the slice stalls with the given numbers.

2

Add the cows variable

Create an integer variable called cows and set it to 3.

DSA Go

package main

func main() {
    stalls := []int{1, 2, 4, 8, 9}
    // Create cows variable and set to 3
    // Your code here
}

Hint

Use cows := 3 inside main to create the variable.

3

Write canPlaceCows function

Write a function called canPlaceCows that takes stalls []int, cows int, and distance int. It returns bool. The function should check if it is possible to place all cows in the stalls so that the minimum distance between any two cows is at least distance. Use a greedy approach starting from the first stall.

DSA Go

package main

func main() {
    stalls := []int{1, 2, 4, 8, 9}
    cows := 3
}

// Write canPlaceCows function below
// Your code here

Hint

Start placing the first cow at the first stall. Then place next cows only if the distance condition is met. Return true if all cows placed, else false.

4

Find and print maximum minimum distance

Use binary search between low = 1 and high = stalls[len(stalls)-1] - stalls[0] to find the maximum minimum distance. Use canPlaceCows to check feasibility. Print the final maximum minimum distance using fmt.Println.

DSA Go

package main

import "fmt"

func canPlaceCows(stalls []int, cows int, distance int) bool {
    count := 1
    lastPosition := stalls[0]
    for i := 1; i = distance {
            count++
            lastPosition = stalls[i]
            if count == cows {
                return true
            }
        }
    }
    return false
}

func main() {
    stalls := []int{1, 2, 4, 8, 9}
    cows := 3

    // Use binary search to find max minimum distance
    // Your code here
}

Hint

Use binary search on distance. If canPlaceCows returns true, try bigger distance. Else try smaller.