Ad
  • Custom User Avatar

    it's not better in terms of time complexity as it would have O(2n) time complexity compare to the first one which has O(n)
    and that's because this solution iterates through the list twice:
    1- on the construction of the first liste comprehension
    2- when counting the number of zeros in the list

  • Custom User Avatar

    that's a really nice solution O(n) time complexity and only O(26) space complexity.