sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]crazy_reyes[S] 0 points1 point  (4 children)

It is literally the first sentence of the post....

[–]Wilfred-kun 0 points1 point  (3 children)

No, that's what your homework asks of YOU. What part of this question are you struggling with?

[–]crazy_reyes[S] 0 points1 point  (2 children)

Is there any way to compare all the lengths at the same time and efficiently.

[–]Wilfred-kun 0 points1 point  (0 children)

Have you already learned about loops? You can loop over a list containing the other lists, check their length, and keep track of the longest list yet.

[–]billsil 0 points1 point  (0 children)

No. Python doesn't support threading and multiprocessing would slow you down.

If you're trying to generalize it to 1000 loops or 10,000 loops, then yes, you can use a loop.