input: from typing import List
  
  def min_steps_to_make_divisible_by_three(nums: List[int]) -> int:
      """
      Given an integer array nums, you can increment or decrement each element by 1 in each operation.
  
      Return the minimal number of operations required to make every element in nums divisible by 3.
  
      Examples:
      >>> nums = [1, 2, 3, 4]
      3
      >>> nums = [3, 6, 9]
      0
  
      Constraints:
      1 <= len(nums) <= 50
      1 <= nums[i] <= 50
      """
output:     
      steps = 0
      for num in nums:
          remainder = num % 3
          if remainder == 1:
              steps += 1  # Increment or decrement by 1 to make it divisible by 3
          elif remainder == 2:
              steps += 1  # Increment or decrement by 1 to make it divisible by 3
      return steps
  