input: def min_steps_to_reach_sum(k: int) -> int:
      """
      Given a positive integer k, start with an array nums = [1].
  
      You can repeatedly do either of the following operations any number of times:
  
      Increment the value of any element in the array by 1.
      Copy any existing element in the array and append it to the end.
      Compute the minimum number of operations needed so that the sum of the array's elements is at least k.
  
      Examples:
      >>> k = 11
      5
      >>> k = 1
      0
  
      Constraints:
      1 <= k <= 10^5
      """
output:     
      steps = 0
      current_sum = 1
      nums = [1]
  
      while current_sum < k:
          if current_sum * 2 <= k:
              nums.append(current_sum)
              current_sum *= 2
          else:
              increment = k - current_sum
              current_sum += increment
              nums.append(increment)
          steps += 1
  
      return steps
  