input: Write a python function to find the longest consecutive sequence of the same character in a given string.
  assert longestConsecutive("aaaaaaabbbccdddee") == "aaaaaaa"
  assert longestConsecutive("abcddddeeeeffffgggggg") == "gggggg"
  assert longestConsecutive("aabbcc") == "aa"
  assert longestConsecutive("ab") == "a"
  assert longestConsecutive("") == ""
output: def longestConsecutive(s: str) -> str:
      if not s:
          return ""
      
      max_char = s[0]
      max_length = 1
      current_char = s[0]
      current_length = 1
      
      for char in s[1:]:
          if char == current_char:
              current_length += 1
          else:
              if current_length > max_length:
                  max_length = current_length
                  max_char = current_char
              current_char = char
              current_length = 1
      
      if current_length > max_length:
          max_char = current_char
          max_length = current_length
          
      return max_char * max_length