An formal algorithm describing how transformer works.
count the number of substrings that at most one character appears in an odd number of times.
Given a list of integers, find the largest positive integer that its negative also exists in the list.
Given a string, revers its prefix ended with a specified character