Puzzles for IBPS PO — Floor, Box, Scheduling, Grouping & Grid Arrangements

advanced 22 min read

Concept

A puzzle, in the Reasoning section of IBPS PO, is a constraint-satisfaction problem. You are given a set of objects, people, or attributes — and a series of conditions linking them. Your job is to build a complete, unique arrangement that satisfies every condition simultaneously.

Think of it like a Sudoku board. Each cell must be filled with exactly one value, every row and column must be consistent, and the clues restrict which values can go where. Puzzles in IBPS PO work the same way — except instead of numbers, you're placing people on floors, books in boxes, employees in time slots, or students in departments.

Here's the key insight most aspirants miss: a puzzle is never solved by reading all clues and then thinking. It is solved by anchoring on certainties first and using them to eliminate possibilities. You are not "figuring it out" — you are systematically collapsing a grid of options until only one arrangement survives.

The major puzzle types you will face in IBPS PO:

IBPS PO typically wraps 4-5 questions around a single puzzle set. That means if you crack the arrangement in 3-4 minutes, you are answering 4-5 questions at roughly 40-60 seconds each. If you fail to crack it, you lose all 4-5 questions. This is where the exam is won or lost.


Deep Dive

The Universal Puzzle-Solving Protocol

Regardless of puzzle type, follow this sequence every time. Deviating from it is the single biggest source of time loss.

Step 1 — Classify the puzzle immediately. Read the first two lines only. Identify: How many people? How many variables? What is the grid structure? Draw the blank grid before reading clues.

For a 7-person floor puzzle with 3 attributes (floor number, city, profession), your grid is 7 rows × 3 columns. Label it. Then read clues.

Step 2 — Extract definite clues first. A definite clue places one person in one slot with certainty: "A lives on floor 5." Mark it and circle it. These are your anchors.

Step 3 — Extract relative clues. These say things like "B is immediately above C" or "D is on an even-numbered floor." Do not place these yet — convert them into a shorthand notation on the side: B = C + 1, D ∈ \{2, 4, 6\}.

Step 4 — Chain clues together. Look for clues that share a person or a slot. Chain: "A is on floor 5" + "B is immediately above A" → B is on floor 6. Each chain step should take 5-10 seconds.

Step 5 — Use elimination on the grid. As soon as any person is placed, cross them off every other slot in that column. As soon as any attribute is assigned to a slot, cross it from all other slots. This is the grid's mechanical work — let it do the thinking for you.

Step 6 — Deploy contradiction testing for stuck points. If you have two possible placements for someone (say, floor 3 or floor 5), assume floor 3 temporarily and check if it creates a contradiction downstream. If it does, floor 5 is confirmed.


Floor Puzzle Specifics

Floor puzzles are the most common in IBPS PO. Key conventions to memorize:

A common trap: "A is above B" does not mean immediately above. It means A's floor number > B's floor number. Two or three floors above is still valid unless "immediately" is specified.

When a floor puzzle says "no two people live on the same floor," it's a clean bijection — one person per floor. Treat it like a permutation.


Scheduling Puzzle Specifics

Scheduling puzzles typically assign people to months (January–December or a subset), often with a second variable like the year (2019/2020) or a category. The grid is: person × month × (year or category).

Watch for: "X was born before Y" vs. "X was born immediately before Y." The first is a partial order constraint; the second is a direct adjacency constraint. Treat them differently.

A useful shorthand for scheduling: write months as numbers (Jan=1, Feb=2, ...). "A is in a month with 30 days" → A ∈ {4, 6, 9, 11} (April, June, September, November).


Grouping + Ordering Hybrid

These are the hardest puzzle type in IBPS PO. You have, say, 8 people split into 2 groups of 4, and within each group they are ranked 1-4.

Strategy: treat the two groups as two separate linear arrangements and link them with the cross-group clues. Solve each group partially, use cross-group clues to anchor further, then complete both.


Grid Puzzle Reading Technique

For any puzzle with 3+ variables, build a full grid on your rough sheet. Example: 6 people, 6 floors, 3 cities, 2 professions.

Your grid has 6 rows (one per floor) and 3 columns (person, city, profession). As you eliminate options, put a cross. As you confirm, put a tick. This visual structure prevents the most common IBPS PO mistake — confidently placing a person in a slot without realizing a different clue already disqualifies it.


Memory Tricks & Shortcuts

patternDICE Rule — Definite, Inference, Contradiction, Elimination

When you read a clue set, tag each clue: D (gives a definite placement), I (gives an inference when combined with another), C (use for contradiction testing), E (pure elimination — tells you what's NOT true). Process in order D → I → E → C. This stops the habit of reading clues randomly. In a 5-clue puzzle, tagging takes 20 seconds but saves 90+ seconds of re-reading. Standard re-read spiral: 3-4 minutes. DICE order: under 2 minutes to first confident placement.

patternThe Anchor-Chain Method for Floor Puzzles

Find the person with the most clues referencing them — this is your anchor. Write all clues about them in a vertical chain. Each link in the chain should move the anchor up or down by a fixed number of floors. You're building a mini-arrangement around one person first, then slotting everyone else around it. Standard random-clue scanning: 12-15 placements steps. Anchor-chain: 6-8 steps to the same result.

substitutionMonth-to-Number Substitution for Scheduling

Replace all month names with their numbers (Jan=1, Feb=2, ... Dec=12) the moment you read the puzzle. "3 months after March" becomes 3+3=6=June. "Between April and August" becomes slots {5,6,7} — three possible months. This eliminates the mental overhead of month names entirely. Standard month-name reasoning: error rate roughly 1 in 4 due to miscounting. Numerical substitution: near-zero arithmetic errors, saves 15-20 seconds per "gap" clue.

eliminationOdd-One-Out Elimination for Two-Group Puzzles

In a grouping puzzle with two groups, list both group slots. As you assign people, cross them from the other group. When one group has only one empty slot and only one person is unassigned, that's a forced placement — no reasoning needed. This sounds obvious but most aspirants don't maintain the cross-group elimination list and miss these forced moves. Recognizing a forced placement takes 3 seconds; missing it and using trial-and-error takes 45-60 seconds.

estimationDay-Offset Arithmetic for Calendar/Day Clues

For "day before yesterday / day after tomorrow" type clues, assign today a number: today = 0, yesterday = -1, day before yesterday = -2, tomorrow = +1, day after tomorrow = +2. Then convert back to the day name at the end using modular arithmetic. "Day before yesterday was Thursday" → Thursday = -2 → today = Thursday + 2 = Saturday. "Day after tomorrow" = Saturday + 2 = Monday. This two-step number conversion takes 8 seconds. Tracking day names verbally takes 20-25 seconds and has higher error probability.


Fast-Solving Framework

In the exam hall, use this decision tree:

1. Read first 2 lines → classify puzzle type → draw grid (15 seconds max).

2. Skim all clues for any definite placements → anchor them in the grid.

3. Combine relative clues with anchors → derive secondary placements.

4. After each new placement, immediately cross-eliminate that person from all other slots in the same column.

5. If stuck after processing all clues once → identify the slot with fewest remaining options (1 or 2) → test the smaller option and check for contradiction.

6. Never re-read the full clue list more than once. If you need to re-check a specific clue, search for it by keyword (the person's name or floor number), not by re-reading from the top.

7. Attempt all 4-5 questions from one puzzle before moving to the next, even if one or two specific questions feel uncertain. Sunk time is sunk — extract maximum value from a cracked arrangement.

If a puzzle is not resolving after 5 minutes, mark the questions, flag the puzzle, and return after completing simpler standalone questions. Do not abandon a partially solved puzzle mid-set if you have 3 of 6 variables filled.


Solved PYQs

Why this question: The simplest linear arrangement. Tests whether you default to systematic left-to-right filling rather than overthinking adjacency clues.

Previous Year Questionपिछले वर्ष का प्रश्न
Five friends A, B, C, D, and E are sitting in a row. A is sitting next to B, B is sitting next to C, C is sitting next to D, and D is sitting next to E. If A is at one end, who is sitting in the middle?
पाँच दोस्त A, B, C, D और E एक पंक्ति में बैठे हैं। A, B के बगल में बैठा है, B, C के बगल में बैठा है, C, D के बगल में बैठा है और D, E के बगल में बैठा है। यदि A एक छोर पर है, तो बीच में कौन बैठा है?
  1. A
  2. B
  3. C
  4. D
  1. A
  2. B
  3. C
  4. D
Solutionसमाधान
Since A is at one end and everyone sits next to each other in order A-B-C-D-E, the arrangement is A, B, C, D, E. C is in the middle position.
चूंकि A एक छोर पर है और सभी एक के बाद एक A-B-C-D-E क्रम में बैठे हैं, व्यवस्था A, B, C, D, E है। C मध्य स्थान पर है।

Solving path: A is at one end. Each person is adjacent to the next in the chain A-B-C-D-E. The only valid arrangements are A-B-C-D-E (A at left end) or E-D-C-B-A (A at right end, but the clues give the same order). Position 3 (middle of 5) is C in either reading. Grid: 5 slots, anchor A at slot 1, chain fills the rest in one pass.


Why this question: Tests systematic pairing logic in a cube/spatial puzzle. Eliminates guessing by using the "three pairs" structural rule.

Previous Year Questionपिछले वर्ष का प्रश्न
A cube has six faces numbered 1, 2, 3, 4, 5, and 6. If face 1 is opposite to face 6, face 2 is opposite to face 5, then which face is opposite to face 3?
एक घन के छह फलक हैं जिन पर 1, 2, 3, 4, 5 और 6 लिखे हैं। यदि फलक 1 के विपरीत फलक 6 है, फलक 2 के विपरीत फलक 5 है, तो फलक 3 के विपरीत कौन सा फलक होगा?
  1. Face 1
  2. Face 2
  3. Face 4
  4. Face 6
  1. फलक 1
  2. फलक 2
  3. फलक 4
  4. फलक 6
Solutionसमाधान
In a cube, there are three pairs of opposite faces. Given that 1 is opposite to 6, and 2 is opposite to 5, the remaining pair must be 3 opposite to 4.
एक घन में तीन जोड़े विपरीत फलक होते हैं। दिया गया है कि 1, 6 के विपरीत है और 2, 5 के विपरीत है, तो शेष जोड़ा 3 और 4 का होगा।

Solving path: A cube has exactly 3 pairs of opposite faces. Given pairs: (1,6) and (2,5). The remaining numbers are 3 and 4 — they must form the third pair. No arithmetic needed. This is pure elimination on a set of 6 numbers after two pairs are removed.


Why this question: Blood-relation chain puzzle. Tests whether you draw a family tree or try to hold relationships in working memory (the latter fails consistently).

Previous Year Questionपिछले वर्ष का प्रश्न
In a family, A is the brother of B. B is the sister of C. C is the father of D. What is the relationship between A and D?
एक परिवार में, A, B का भाई है। B, C की बहन है। C, D का पिता है। तो A और D के बीच क्या रिश्ता है?
  1. Father
  2. Uncle
  3. Grandfather
  4. Brother
  1. पिता
  2. चाचा/मामा
  3. दादा/नाना
  4. भाई
Solutionसमाधान
A is brother of B, B is sister of C (so A, B, C are siblings). C is father of D. Therefore, A is the uncle of D.
A, B का भाई है। B, C की बहन है (इसलिए A, B, C भाई-बहन हैं)। C, D का पिता है। इसलिए A, D का चाचा/मामा है।

Solving path: Draw: A—B—C (siblings). C is father of D. A is male (brother). C is male (father). A and C are brothers. A is D's uncle by definition (father's brother). Two-node family tree, one inference step.


Why this question: Coding-decoding with alphabet-position mapping. Tests whether you apply the pattern consistently rather than misremembering letter positions.

Previous Year Questionपिछले वर्ष का प्रश्न
In a code language, if CHAIR is written as 3-8-1-9-18, then how will TABLE be written?
एक कोड भाषा में, यदि CHAIR को 3-8-1-9-18 लिखा जाता है, तो TABLE को कैसे लिखा जाएगा?
  1. 20-1-2-12-5
  2. 19-1-2-12-5
  3. 20-1-3-12-5
  4. 20-2-1-12-5
  1. 20-1-2-12-5
  2. 19-1-2-12-5
  3. 20-1-3-12-5
  4. 20-2-1-12-5
Solutionसमाधान
Each letter is replaced by its position in the alphabet. T=20, A=1, B=2, L=12, E=5. So TABLE = 20-1-2-12-5.
प्रत्येक अक्षर को वर्णमाला में उसकी स्थिति से बदला जाता है। T=20, A=1, B=2, L=12, E=5। इसलिए TABLE = 20-1-2-12-5।

Solving path: The code is straightforward alphabetic position: A=1, B=2, ... Z=26. Verify on CHAIR: C=3, H=8, A=1, I=9, R=18. Confirmed. Apply to TABLE: T=20, A=1, B=2, L=12, E=5. Answer: 20-1-2-12-5. Trap: option B uses 19 for T, which would be S. Don't miscount T — T is the 20th letter (S is 19th).


Why this question: Day calculation with "day before yesterday / day after tomorrow" framing. Tests whether you can map relative day references without losing track.

Previous Year Questionपिछले वर्ष का प्रश्न
If the day before yesterday was Thursday, what day will it be the day after tomorrow?
यदि परसों (दो दिन पहले) गुरुवार था, तो परसों (दो दिन बाद) कौन सा दिन होगा?
  1. Sunday
  2. Monday
  3. Tuesday
  4. Wednesday
  1. रविवार
  2. सोमवार
  3. मंगलवार
  4. बुधवार
Solutionसमाधान
If day before yesterday was Thursday, then yesterday was Friday and today is Saturday. Day after tomorrow will be Monday.
यदि परसों बृहस्पतिवार था, तो कल शुक्रवार था और आज शनिवार है। परसों सोमवार होगा।

Solving path: Use the number-offset method. Day before yesterday = Thursday. Today = Thursday + 2 days = Saturday. Day after tomorrow = Saturday + 2 = Monday. Total offset from Thursday to answer: +4 days. Thursday → Friday → Saturday → Sunday → Monday.


Common Mistakes


Related Topics

Practice on SarkariRise

Sign up + get 3 free mocks →