CAT 2016 Quantitative Ability

Let the number of games won and those lost by the man be ${\mathit{N}}_{\mathit{w}}$ and N, respectively.
Since he gains $\mathrm{\$}$2, ${\mathit{N}}_{\mathit{w}}-{\mathit{N}}_{\mathit{i}}=2$ .
Also, he does not lose more than once.
The possible cases are (W → Win and L → Loss):
Case (i): ${\mathit{N}}_{\mathit{w}}=2$ and ${\mathit{N}}_1=0$.
The only possible sequence is WW.
Case (ii): ${\mathit{N}}_{\mathit{w}}=3$ and ${\mathit{N}}_1=1$.
Possible sequences: LWWW and WLWW.
Hence, the to tal number of possible Win-Loss sequences = 1 + 2 = 3.