3661. Maximum Walls Destroyed by Robots
php
dev.to
3661. Maximum Walls Destroyed by Robots Difficulty: Hard Topics: Senior Staff, Array, Binary Search, Dynamic Programming, Sorting, Weekly Contest 464 There is an endless straight line populated with some robots and walls. You are given integer arrays robots, distance, and walls: robots[i] is the position of the iᵗʰ robot. distance[i] is the maximum distance the iᵗʰ robot's bullet can travel. walls[j] is the position of the jᵗʰ wall. Every robot has one bullet that can either fire to th