CAT 2026 DILR One-Shot Marathon: 8 LRDI Sets from Rodha Explained

What is the Rodha CAT 2026 DILR one-shot marathon?

The video is titled “CAT 2026 DILR One Shot: Complete LRDI CAT Marathon” and is taught by Abhishek Sir on Rodha's official YouTube channel. It runs for approximately six hours and 24 minutes and was published on October 19, 2026.

The class contains eight CAT-level sets with different surfaces: competition voting, selection scores, team rankings, an election, a production process, evaluator assignments, percentage distribution and a number grid. This variety helps students see that unfamiliar stories often reduce to a small group of reasoning actions.

The official description identifies six recurring ideas: data representation, compact tables, constraint tracking, weighted scores, case elimination and exam thinking. Those are more important than the themes themselves because they transfer to unseen CAT sets.

When checked on October 20, the video showed 2,362 views. That count is recorded only to verify that it crossed the automation's 1,000-view publication threshold and will naturally change.

Complete chapter map for the eight LRDI sets

The chapter sequence moves across several common reasoning structures without labelling them as a fixed syllabus. Use the timestamps to attempt one set at a time rather than watching the entire marathon in one sitting.

Each chapter is long enough to include the initial interpretation, construction of a representation, deductions and questions. Pause when a set is introduced and make a genuine attempt before viewing the solution.

How should you use a six-hour DILR video?

Do not treat the marathon as a movie. Divide it into two to four study sessions, and attempt each set before watching Abhishek Sir's method. A productive cycle is 12 to 18 minutes of independent work, solution review, a short error note and a clean reconstruction.

If you cannot solve the set, still record what you understood: the entities, fixed totals, relationships and possible table. This reveals whether the difficulty came from interpretation, representation, deduction or calculation.

After the explanation, close the video and rebuild the solution from a blank page. Recognition is not mastery. You should be able to recreate the table, justify the key deduction and explain why rejected cases fail.

Return to selected sets after two or three days under a timer. Do not repeat all eight immediately; choose the sets that exposed different weaknesses.

• Attempt before watching the full solution.
• Set a realistic first-attempt time limit.
• Write the representation even when deductions are incomplete.
• Record one decisive clue and one avoidable mistake.
• Reconstruct the set without replaying the explanation.
• Reattempt representative sets after a short gap.

Why data representation is the central skill in DILR

DILR stories are deliberately noisy. Names, scores, stages, teams and conditions compete for attention. A strong representation removes the narrative surface and stores only the information needed for deductions.

The best table is not necessarily the most detailed. It should make relationships visible while leaving room for unknowns. In a voting set, rows may represent participants and columns may represent voters or rounds. In a process set, a flow diagram can be better than a grid because quantities change between production, testing and shipping.

Build the smallest structure that can answer multiple questions. If every question requires rereading the passage, the representation is probably incomplete. If constructing the table consumes excessive time and many cells remain irrelevant, it may be too large.

Use consistent symbols. A dash, zero and blank cell should not mean three different things unless you define them. Mark confirmed facts differently from temporary cases so assumptions do not quietly become conclusions.

Set 1: Singing competition and gharana voting

A voting set usually contains two layers: who can vote for whom and how votes translate into a final outcome. The temptation is to list every possible vote sequence, but the cleaner route is to aggregate information wherever order does not matter.

Identify fixed totals first. Count the participants, available votes and any restrictions on self-voting, group voting or repeated choices. Then create a table that separates direct facts from inferred totals.

The transferable lesson is conservation: every vote cast must appear somewhere in the receiving totals. If row totals and column totals represent the same pool, their equality can expose missing values or impossible cases.

For CAT set selection, a voting theme is attractive when the totals are small and several conditions immediately restrict the grid. It is risky when the rules create many symmetric possibilities without a strong starting clue.

Set 2: IIM selection using GE and PI scores

Selection-score sets combine arithmetic with logic. Candidates may receive scores in components such as a group exercise and personal interview, with a weighted formula producing the final ranking.

Write the formula before inserting numbers. Keep raw scores separate from weighted contributions, especially when components have different maximum marks or weights. A candidate who leads in one raw component may not lead overall.

Use inequalities when exact values are unavailable. If one candidate must outrank another, compare their weighted totals and derive the minimum change required. This is often faster than enumerating all score combinations.

The key exam habit is precision. Percentage points, marks and weighted points are not interchangeable. Label every column with its unit and delay rounding unless the set explicitly requires it.

• Separate raw marks from weights.
• Convert ranking statements into inequalities.
• Check ties and tie-breaking rules.
• Keep maximum possible scores visible.
• Verify whether percentages apply before or after aggregation.

Set 3: India versus Korea tournament rankings

Tournament sets can become large because every match appears to create another branch. Start by confirming the scoring system, the number of games and whether draws are possible. Total points available across the tournament may provide a powerful global constraint.

Rank statements are usually weaker than exact scores but still useful. First place means no other team has a greater total, not necessarily that the leader won every match. Build score ranges and use head-to-head or tie-break conditions only when needed.

A compact outcome table can record win, loss or draw while a separate column tracks points. Do not repeatedly recompute totals from the match grid.

For selection, tournament sets are promising when some results are fixed and the question asks about a small number of remaining matches. They are dangerous when several rankings depend on unspoken tie-break assumptions; read the wording carefully.

Set 4: Society election and voting analysis

The second voting-themed set is useful because similar stories can demand different representations. An election may involve candidates, voter groups, rounds or transfers, so copying the first set's table without checking the structure can create confusion.

Translate percentages into counts only after establishing the correct base. The total electorate, valid votes and votes cast may be different quantities. A percentage of registered voters is not automatically a percentage of valid votes.

Use minimum and maximum bounds before detailed casework. If a candidate already has a fixed block of support, calculate the range still possible from undecided or conditional voters. Bounds can answer some questions without identifying every vote.

Set 5: Production, testing and shipping ratios

Process sets connect quantities across stages. A product may be manufactured, tested, rejected, reworked and shipped, with each step governed by a ratio or percentage. A flow diagram is often clearer than a standard table.

Choose a convenient base when only ratios are given. The least common multiple of denominators can eliminate fractions, but verify that the chosen base remains compatible with any fixed totals later in the set.

Track what each percentage applies to. A rejection rate at testing is applied to units tested, not necessarily total production. A shipping ratio may apply only to approved units.

The broader lesson is to resist premature calculation. Map the process first, label each edge and then substitute values. This reduces the chance of applying a correct percentage to the wrong quantity.

Set 6: Professors and thesis evaluation

Assignment sets link one entity type to another: professors to theses, employees to tasks or judges to cases. Begin with a grid and mark direct impossibilities before placing any positive assignment.

Pay attention to capacity. A professor evaluating exactly two theses creates both a row total and a restriction on the remaining cells. Combined row and column counts can trigger deductions even when no single sentence seems decisive.

Conditional clues should be written symbolically. “If A evaluates X, then B does not evaluate Y” is easier to track as a branch than as remembered prose. Complete one branch far enough to find a contradiction or a stable arrangement before opening another.

The session's transferable skill is disciplined case separation. Never carry a deduction from one hypothetical case into another.

Set 7: Student marks and percentage distribution

Marks-distribution sets mix data interpretation with arithmetic reconstruction. Establish the total number of students and the score bands before converting percentages to counts.

Check integrality. Student counts must be whole numbers, so a percentage can restrict the possible total even when the total is not explicitly stated. Use the denominator implied by each percentage to find compatible bases.

Separate cumulative statements from interval statements. “At least 60 percent” includes several score bands, while “between 60 and 70” refers to one interval. A cumulative table can prevent double counting.

When the set includes averages, write total marks as average multiplied by count. Do not average subgroup averages without weighting them by subgroup size.

Set 8: Code Breakers and the prime-number grid

The final set uses a 5-by-5 grid and prime-number restrictions. Grid puzzles reward early control of candidate values. List the allowed primes and any row, column or adjacency conditions before placing numbers.

Use elimination marks lightly. Filling every cell with a long candidate list can make the grid unreadable. Record only candidates that remain plausible after global restrictions.

Look for the most constrained row, column or cell. A location affected by several conditions provides a stronger starting point than the first clue in the paragraph.

Number-property knowledge should serve the logic. Prime parity, possible sums and factor restrictions can eliminate placements, but avoid calculating combinations that violate a simpler positional clue.

How to track constraints without losing control

Classify each condition as fixed, relational, numerical or conditional. Fixed clues can enter the table immediately. Relational clues connect two entities. Numerical clues govern totals. Conditional clues create branches and should remain visibly separate.

After every important placement, scan for consequences across rows, columns and totals. DILR progress often comes from propagation rather than a new clever idea.

When a contradiction appears, identify the assumption that caused it and close only that branch. Erasing the entire table wastes valid deductions.

Use an audit check before answering: totals reconcile, all entities are used as required, and every original condition has been tested against the final arrangement.

• Number the clues when the passage is long.
• Mark confirmed values differently from assumptions.
• Write row and column totals at the edge of the table.
• Close a failed case explicitly.
• Recheck all original conditions before selecting an option.

How do these sets improve CAT set selection?

A marathon is useful only if it improves the choice of sets in a timed section. During each first attempt, spend the opening two or three minutes identifying entities, likely representation, number of open variables and visible entry points.

A good set for you is not necessarily the set with the most familiar theme. Choose the one where the structure becomes clear and early deductions reduce uncertainty. A familiar tournament can still be expensive if outcomes branch widely, while an unfamiliar process set may collapse after one ratio equation.

Set an exit rule. If the representation remains unstable or no new deduction appears after a reasonable attempt, leave and scan another set. Returning later preserves optionality; spending the entire section defending the first choice does not.

After the video, rank the eight sets by your personal selection order and compare that ranking with your actual solving experience. This creates a useful profile of which structural signals you read well.

A four-day revision plan using the marathon

On Day 1, attempt the first two sets and focus on representation and weighted scores. On Day 2, cover the tournament and election sets, paying attention to totals, ranks and voting bases.

On Day 3, work through the process and assignment sets. Compare the flow diagram with the professor-thesis grid and note why each representation fits its structure.

On Day 4, attempt the marks-distribution and prime-grid sets. Finish with a timed scan of all eight set introductions, giving yourself only enough time to choose an order.

Two or three days later, reattempt one set from each major weakness category. Follow it with a full DILR sectional or a mock so that the learning is tested under selection pressure.

Source and verification note

This guide is an original editorial summary of Rodha's public DILR marathon and official description. It does not reproduce the complete questions, transcript, PDF or step-by-step copyrighted solutions.

The title, teacher, duration, publication date, chapter timestamps, topic labels and view count were checked on October 20, 2026. Learners should watch the original video for the full sets and Abhishek Sir's complete explanations.

Related guides