- Python Basic Tutorial
- Python - Home
- Python - Overview
- Python - Environment Setup
- Python - Basic Syntax
- Python - Comments
- Python - Variables
- Python - Data Types
- Python - Operators
- Python - Decision Making
- Python - Loops
- Python - Numbers
- Python - Strings
- Python - Lists
- Python - Tuples
- Python - Dictionary
- Python - Date & Time
- Python - Functions
- Python - Modules
- Python - Files I/O
- Python - Exceptions

# Program to maximize the minimum force between balls in a bucket using Python

Suppose we are given several buckets and x number of balls. If the balls are put into the bucket, a special force acts within them and we have to find out a way to maximize the minimum force between two balls. The force between two balls in a bucket of position p and q is |p - q|. The input given to us is the array containing the bucket positions and the number of balls x. We have to find out the minimum force between them.

So, if the input is like pos = [2, 4, 6, 8, 10, 12], x = 3, then the output will be 4.

The balls can be put into the given positions in an array of 12 buckets. The three balls can be put into positions 4, 8, and 12 and the power between them will be 4. This value cannot be increased further.

To solve this, we will follow these steps −

Define a function ball_count() . This will take d

and := 1

curr := pos[0]

for i in range 1 to n, do

if pos[i] - curr >= d, then

ans := ans + 1

curr := pos[i]

return ans

n := size of pos

sort the list pos

left := 0

right := pos[-1] - pos[0]

while left < right, do

mid := right - floor value of((right - left) / 2)

if ball_count(mid) >= x, then

left := mid

otherwise,

right := mid - 1

return left

## Example

Let us see the following implementation to get better understanding −

def solve(pos, x): n = len(pos) pos.sort() def ball_count(d): ans, curr = 1, pos[0] for i in range(1, n): if pos[i] - curr >= d: ans += 1 curr = pos[i] return ans left, right = 0, pos[-1] - pos[0] while left < right: mid = right - (right - left) // 2 if ball_count(mid) >= x: left = mid else: right = mid - 1 return left print(solve([2, 4, 6, 8, 10, 12], 3))

## Input

[2, 4, 6, 8, 10, 12], 3

## Output

4

- Related Articles
- Program to find minimum limit of balls in a bag in Python
- Program to maximize the minimum value after increasing K sublists in Python
- Program to find out the minimum rotations needed to maximize the profit from a Ferris wheel in Python
- Program to find maximum number of balls in a box using Python
- Program to find minimum number of operations to move all balls to each box in Python
- How to maximize a plt.show() window using Python?
- Python Program to Find the Gravitational Force Acting Between Two Objects
- Program to find minimum difference between largest and smallest value in three moves using Python
- Program to maximize number of nice divisors in Python
- Program to find sum of differences between max and min elements from randomly selected k balls from n balls in Python
- Program to find minimum distance to the target element using Python
- How to Maximize window in chrome using webDriver (Python)?
- How to maximize plt.show() using Python on Mac?
- Program to find minimum swaps to arrange a binary grid using Python
- Program to find minimum insertions to balance a parentheses string using Python