input: def has_two_char_substring_in_reverse(text: str) -> bool:
      """
      Given a text string, determine if there is any substring of length 2 that appears in both the string and its reverse.
  
      Return True if such a substring is found, otherwise False.
  
      Examples:
      >>> text = "leetcode"
      True
      >>> text = "abcba"
      True
      >>> text = "abcd"
      False
  
      Constraints:
      1 <= len(text) <= 100
      The text consists of only lowercase English letters.
      """
output:     
      substrings = set()
      for i in range(len(text) - 1):
          substr = text[i:i+2]
          substrings.add(substr)
      reverse_text = text[::-1]
      for i in range(len(reverse_text) - 1):
          if reverse_text[i:i+2] in substrings:
              return True
      return False
  