If you start with all the possible cases you will be lost.
In DS question the correct approach ALWAYS is to prove insufficiencySo basically I try to show that three are 2 possibles cases that follow the given conditions and hence statement is insufficient.
St 1) The first and fourth letters in the code are the same, as are the second and fifth letters.
Very easy to show two possible cases.
C C C C C
A C C B A
2 cases, Insufficient! MOVE ON.
St 2) There is exactly one C
Note: the conditions say for any other place than the first place if I use A , B must precede A { B A}
and for any other place than the first place if I use B , C must precede B { C B}
lets start with last position, and note "exactly' one C
1. Assume last place is C
- - - - C. for the 4th place I am left with either A or B.
- C B A C
- - C B C
You can see whatever case I use I will need one more C
2. Assume last place is A
Then I am sure that - - C B A will be the pattern
What can second place be? if I use B then I will need one more C, Clearly A is the second place and So first place should be B
B A C B A This is one possible case, is there any other possible case?
3. Assume last place is B
- - - C B This will be my starting case. What can 3rd place be?
if its A " - B A C B " Now the first place is forced to be C again, but remember we only had one C. not possible
if its B " - C B C B" second place is forced to be C again. not possible.
SO for Statement 2 i could only find one possible case Hence St 2 Alone Sufficient
Option B