well, i can see what the problem is: you are still unclear on the fundamentals of how data sufficiency works.
when you are working with one of the statements,
that statement must be TRUE!in other words, you don't need to consider any cases that violate the statement.
look at how you dealt with statement 2:
rihanna.hayat Wrote:it took more than 4 mins trying combinations such as:(values in order x......y)
For condition (2)
-2.......3 (x<y)
-3.......2 (x<y)
2........3 (x<y)
3........2 (x>y)
2.......-3 (x>y)
-2......-3 (x>y)
the 3 red pairs aren't even relevant here, because those don't satisfy statement 2 (xy < 0) in the first place. why would you plug in values that don't satisfy the initial requirement?
try re-visiting our basic DS materials and acquiring a more solid (and more rapid) understanding of
how data sufficiency works in the first place.
until you acquire that understanding -- i.e., until you get to the point where you immediately
understand what you are actually supposed to do here -- there's little point in thinking about things that are "less time-consuming".