Yes. You are right. Since we always need to move forward in t regarding the index, thus we have to find out the very first character in t that is the same with the current character we are considering in s. Then we set our prev (which is the start index of substring in t) to prev++.
Great explanation. Thanks for sharing the binary search solution