The problem is to find the number of empty spots within a distance relative to other houses. Consider an array containing either zero or one. One means the place is occupied by a house and zero means an empty place. Count the number of empty places within a distance R with respect to all houses.
-
Notifications
You must be signed in to change notification settings - Fork 0
The problem is to find the number of empty spots within a distance relative to other houses. Consider an array containing either zero or one. One means the place is occupied by a house and zero means an empty place. Count the number of empty places within a distance R with respect to all houses.
GuanJinNL/SolutionCodilityTest
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The problem is to find the number of empty spots within a distance relative to other houses. Consider an array containing either zero or one. One means the place is occupied by a house and zero means an empty place. Count the number of empty places within a distance R with respect to all houses.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published