Ad
  • Default User Avatar

    Kata is fun and really perfect, but what about time complexity? My code works for O(n^2) like (n + 1) * (n / 2) if n is the length of last row. But is there solution faster?