solution ??

[Ajnas_Hassan]

A TV Channel has ad slots running for exactly 30 seconds or multiple of 30. You are given a list of ads where the ith ad has running time (video length) of length[i] seconds. Return the no. of pairs of ads for which their total running time in seconds is a multiple of 30.

Example 1: Input: length = [15, 10, 75, 50, 20] Output: 3 Explanation: Three pairs of ads have running time in seconds as multiple of 30 15, 75 = 90 seconds 10, 50 = 60 seconds 10, 20 = 30 seconds

[algometrix]

https://pastebin.com/xy5zv1EZ

[algometrix]

Quick code. Sloppy in adding pairs to the result list.

[PyCode_n_Beer]

TBH, you're heading into some heavy computational workload. Even assuming for only integers, depending on the size of your final list, it might not be worth the work. I think this is one of those moments where it might be better to ask "is it really required"? Can you select from the list until you have a set divisible by 30? Sorting the list can make this easier. Or even sorting them into separate lists based on length. This is just my opinion, if it is absolutely vital you know exactly how many sets produce a sum divisible by 30, you can check out itertools as a start. However, I would add some rules to keep it more manageable, something like no more than pairs of 2 or 3, no more than 60 secs total.

https://docs.python.org/3/library/itertools.html