Simple counter clear solution for Overlapping Disks by U.V - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Simple counter solution in Clear category for Overlapping Disks by U.V

def overlapping_disks(disks: list[tuple[int, int, int]]) -> int:
    return sum((x1 - disks[i2][0]) ** 2 + (y1 - disks[i2][1]) ** 2 <= (r1 + disks[i2][2]) ** 2
                for i1, (x1, y1, r1) in enumerate(disks)
                for i2 in range(i1 + 1, len(disks))
                )

Sept. 20, 2023

Comments:

mennadiego on March 29, 2024, 1:43 p.m.
<p>Incredible solution! Awesome! Congrats! </p>

List, list and list again

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.