You have n balls and a 2D grid of size m×n representing a box. The box is open on the top and bottom sides. Each cell in the box has a diagonal that can redirect a ball to the right or the left. You must drop n balls at each column’s top. The goal is to determine whether each ball will fall out of the bottom or become stuck in the box. Each cell in the grid has a value of 1 or −1.
A ball gets stuck if it hits a V-shaped pattern between two grids or if a grid redirects the ball into either wall of the box.
The solution should return an array of size n, with the ith element indicating the column that the ball falls out of, or it becomes −1 if it’s stuck. If the ball drops from column x and falls out from column y, then in the result array, index ...
You have n balls and a 2D grid of size m×n representing a box. The box is open on the top and bottom sides. Each cell in the box has a diagonal that can redirect a ball to the right or the left. You must drop n balls at each column’s top. The goal is to determine whether each ball will fall out of the bottom or become stuck in the box. Each cell in the grid has a value of 1 or −1.
A ball gets stuck if it hits a V-shaped pattern between two grids or if a grid redirects the ball into either wall of the box.
The solution should return an array of size n, with the ith element indicating the column that the ball falls out of, or it becomes −1 if it’s stuck. If the ball drops from column x and falls out from column y, then in the result array, index ...