Longest positive subarray

Array A[] contains only ‘1’ and ‘-1’

Construct array B, where B[i] is the length of the longest continuous subsequence starting at j and ending at i, where j < i and A[j] + .. + A[i] > 0

Binding to Model or ViewModel

I know there are already questions on that topic, but the issues there are somewhat specific to other problems and do not offer conclusive answers.

Especially those here: Question1, Question2 and of …