CAT 2026 DILR Ranking-Based Sets: Relative Ordering, Unique Positions and 3 Solved Sets
A DILR sub-type guide that treats ranking-based sets as their own solving family, distinct from grid seating. It teaches the four-step inequality-chain method for relative ordering, how to identify the unique positions a set locks in versus floating elements, a ranking-vs-seating comparison, three fully worked solved sets (all logic-verified), and the common direction-and-gap traps.
CAT 2026 DILR Ranking-Based Sets: Relative Ordering, Unique Positions and 3 Solved Sets
Ranking sets look like seating arrangements, and solving them like seating arrangements is exactly why they eat your time. When a set asks who is third tallest or who arrived fourth, your instinct is to draw a grid and force entities into fixed seats. But ranking sets do not work on fixed positions. They work on relationships, where you only know that one entity is above or below another. This guide shows you the inequality-chain method built for relative ordering in CAT 2026, how to spot the unique positions a set locks in, and three fully solved ranking sets you can model your practice on.
Why Ranking Sets Are Their Own Solving Family
A ranking set orders entities along one attribute: marks, height, age, salary or arrival time. The defining feature is that the clues are comparative. You are told one entity beats another, or that a fixed number of entities sit between two of them, but rarely a direct position. From these relationships you reconstruct the order.
This is a different mental model from grid-based arrangement. In seating, you fill known seats; in ranking, you grow a chain. Treating the two the same way is the most common reason aspirants stall on what should be a fast set. Once you see ranking as chain-building, the path through the clues becomes obvious.
The Inequality Chain Method
The method is mechanical, which is exactly what you want under time pressure. Follow the same four steps every time and the set assembles itself.
- Translate each clue into an inequality. "A scored more than B" becomes A > B. Keep the notation uniform so higher always means the same direction.
- Merge overlapping inequalities. If A > B and B > C, write A > B > C. Stitch the fragments into the longest chain you can.
- Handle fixed gaps as cases. A clue like "exactly two between A and B" is positional, so test the limited placements it allows rather than guessing.
- Lock the unique positions. Anyone the chain pins to a single spot is fixed; the rest float, and those floats define your cases.
That final step matters most. A ranking set rarely needs a single complete order to answer its questions. Often you only need to know which positions are certain, because most questions hinge on those locked spots rather than the floating ones.
Ranking Sets vs Seating Arrangements
Spotting the family in your first read decides which tool you reach for. The table below contrasts the two so you can label a set fast and pick the right approach.
| Aspect | Ranking sets | Seating arrangements |
|---|---|---|
| What you build | A relative chain | A fixed grid of seats |
| Typical clue | A is taller than B | A sits opposite B |
| Positions | Some locked, some floating | Every seat must be filled |
| Main tool | Inequality chain | Diagram or table |
| Question style | Who is third highest? | Who sits in seat two? |
Master DILR Set Selection
Optima Learn drills each DILR family separately, so you learn to spot a ranking set on sight and pick the sets worth your time on exam day.
Train DILR by Set Type3 Solved Ranking Sets
Here are three sets, increasing in difficulty, each solved with the inequality-chain method. Read the reasoning, then redo each one cold to lock in the approach.
Five students A to E scored distinct marks. A scored more than B. C scored more than A. B scored more than D. E scored less than D.
Translate and merge: from A > B and C > A, we get C > A > B. Adding B > D gives C > A > B > D. Finally E < D extends it to:
The order is fully fixed: C first, then A, B, D, E. Every position is unique, so any rank question answers instantly.
Four friends P, Q, R, S have distinct heights. S is taller than P. P is taller than Q. R is taller than Q.
The first two clues chain to S > P > Q. The third only tells us R > Q, without fixing R against S or P. So R can sit in three places above Q:
Q is the unique position, locked as shortest in every case. R floats, so any question about R needs the cases, while any question about Q is certain.
Five people C, A, E, D, B arrived in distinct positions 1 to 5, where 1 is first. C arrived first. A arrived before B, with exactly two people between A and B. D arrived immediately before B.
C is fixed at 1. "Exactly two between A and B" means their positions differ by three. With position 1 taken, the only fit is A at 2 and B at 5. D immediately before B places D at 4, leaving position 3 for E:
The whole order is forced and unique, even though no clue gave a direct position beyond C. Positional gaps did the rest.
Common Traps in Ranking Sets
Most lost marks in ranking sets come from a few repeatable slips. Watch for these as you build the chain.
- Reversing direction. Mixing "older" with "younger" or "rank 1" with "highest" flips the chain. Fix one direction before you start.
- Forcing a single order. If elements float, do not invent a complete order; carry the cases forward.
- Ignoring "exactly" versus "at least". "Exactly two between" is far tighter than "at least two between," and the difference changes the cases.
Once your chain and cases are set, resist redrawing the order for every question. Read each question against what you already have. Locked positions answer certainty questions immediately, and the cases handle the rest, which is where ranking sets save you the most time.
Scan the clues in your first read. If most are comparative, like higher, taller or earlier, it is a ranking set and the chain method applies. If they pin entities to fixed seats or a layout, it is an arrangement set. Labelling it correctly in ten seconds is the highest-value decision you make on it.
Ranking sets complete a DILR library that already covers grids, games and mixed sets, so practise them alongside our guides on DILR logical reasoning puzzles and DILR mixed sets. Fold ranking practice into your wider CAT preparation, and review your set-selection accuracy weekly with our CAT preparation tracker.
The payoff is reliability. A ranking set you can label and chain in seconds becomes a high-confidence pick during selection, the calm choice that protects your DILR score while others gamble on harder sets. Keep this method central to your CAT 2026 preparation and rehearse it until the chain forms as you read.
Ranking Set Questions, Answered
Build DILR Speed and Accuracy
A personalised CAT 2026 plan that drills every DILR set type, tracks your accuracy by family, and builds the set-selection instinct that protects your score.
Strengthen My DILR
Solve real CAT DILR sets timed
Hand-picked LR puzzles and DI caselets with timer + solution breakdown.