You can easily solve this by observing the fact that,a binary strings has exactly as many "01" sub-strings as "10" sub-strings iff it starts & ends with the same character
so Regex for language will be ,
L= 1(1+0)*1 + 0(1+0)*0
if you construct DFA using this expression then it will be same as shown in answer by @srestha