input: Write a function to return a list of Fibonacci numbers less than a given number 'n'.
  assert get_fibonacci_seq(10) == [0, 1, 1, 2, 3, 5, 8]
  assert get_fibonacci_seq(20) == [0, 1, 1, 2, 3, 5, 8, 13]
  assert get_fibonacci_seq(1) == [0]
output: def get_fibonacci_seq(n):
      if n <= 0:
          return []
      fib_seq = [0, 1]
      while True:
          next_fib = fib_seq[-1] + fib_seq[-2]
          if next_fib >= n:
              break
          fib_seq.append(next_fib)
      return fib_seq if n > 1 else [0]