matchingChar:

          -set count
          -iterate through a
          -set str1, str2 to a[i], b[i]

          -check if str1,str2 are empty
          -check if charAt(0) are equal
          -increment, return count

     longestStreak

          -set max

          -iterate i
               -set count
               -iterate j
                    -check if charAt(i) equals charAt(j)
                          -increment count
                    -else break
               -if count greater than max: update max

          -return max

     -if str length less than two: return zero

     -if substring of 0,2 equals yo:
          -return 1 plus yoYo of substring at 1

     -else
          -return yoYo at substring 1

     -if str.equals empty: return str

     -if str.charAt zero equals o
          -return endoo of substring at 1 plus o

     -else
          -return charAt zero plus endoo of substring at one

     if str len less than two: return str

     -if charAt zero equals charAt one
          -return charAt zero - hyphenSplit substring at one

     -return charAt zero plus hyphSplit substring at one

     -if charAt zero does not equal open brace
          -return iB at substring 1

     -if charAt length minus one does not equal close brace
          -return iB substring zero to len minus one

     -return str