Problem StatementThere are N rectangular cuboids in a three-dimensional spaceThese cuboids do not overlap Formally for any two different cuboids among them their intersection has a volume of 0The diag

Given a set of N rectangular cuboids in a three-dimensional space, the task is to find, for each cuboid, the number of other cuboids that share a face with it.

To solve this problem, we can iterate over each pair of cuboids and check if their surfaces intersect. Two cuboids share a face if and only if their surfaces intersect.

To check if the surfaces of two cuboids intersect, we need to compare the coordinates of the two cuboids. If the minimum coordinate of one cuboid is greater than the maximum coordinate of the other cuboid in any dimension (x, y, or z), then their surfaces do not intersect. Otherwise, their surfaces intersect.

For each cuboid, we can keep a count of the number of cuboids that share a face with it. Initially, this count is zero. For each pair of cuboids, if their surfaces intersect, we increment the count for both cuboids.

At the end, we will have the count of the number of cuboids that share a face with each cuboid