Given a binary string, count number of substrings that start and end with 1 (Binary String) | Java

Given a binary string S. The task is to count the number of substrings that start and end with 1. For example, if the input string is “00100101”, then there are three substrings “1001”, “100101” and “101”.
#datastructure,
#algorithem,
#computerscience
#prepareyourself
#java
#array
#geeksforgeekssolution
#leetcodesolution
#arraysolutioninhindi
#datastructureinhindi

[@amanmotghare7196]

good explaination

[@ahn360]

Nice Explanation

[@A_CupOf_Life]

👍👍👍 great

[@rekhakalasare4910]

Great explanation! But how did you frame this formula? Cant we directly return countofOne variable?

[@bhaveshmadnani8646]

Niceee i love it❤👍👍👍

[@prepareyourself7992]

thanks, glad you like it.