Clever, I like it :)

I really need to remember this exists.

how could that be even possible

6 characters longer than my solution :D (ignoring the newlines added for legibility)

pretty much the same thing as mine... not bad!

Isn't the time complexity O(n)? At least O(n²/(n+1)).

Mathematically, it the same, but sometimes, we lose sense with over-refactoring.

Nice solution :-)

Thank you for your solution and explenetion!

if l=2 and w=2 it would output 8 which is not right

Я только смотрел твоё вмдео спасибо

Don't do this in an interview

The sorting is not done on the same n (input length), so I don't think you're right in that it's O(n log n)

Hint #1 is very good.