Split the Parade Into Balanced Blocks

This problem is part of solulu Pro

A parade is a string of L (left-turning) and R (right-turning) floats. Split it into the maximum number of continuous blocks, where each block has the same number of L's and R's. Return the maximum number of blocks.