As algorithm interviews go, this is very much on the easy side.
Typically when people say coding interviews need too much algorithm knowledge which are not required in daily life, they mean stuff like dynamic programming and Dijkstras. This one can be solved without any sort algorithm knowledge at all. Just need to provide a custom comparator to the standard sort.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
As algorithm interviews go, this is very much on the easy side.
Typically when people say coding interviews need too much algorithm knowledge which are not required in daily life, they mean stuff like dynamic programming and Dijkstras. This one can be solved without any sort algorithm knowledge at all. Just need to provide a custom comparator to the standard sort.