Study guide

6.2 Box-Based Puzzles & Vertical Stacks

SBI Clerk Junior Associate

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Structure, Eligibility, Selection & Winning Strategy

1.1 SBI Clerk Overview, Eligibility & Two-Stage Selection 1.2 Exam Pattern, Sectional Timing & Negative Marking Mechanics 1.3 Time Allocation, Question Selection & Cutoff Strategy 1.4 Final Selection, Local Language Proficiency Test & Joining Formalities

2 Chapter 2: Reasoning — Coding, Series, Relations & Input-Output

2.1 Alphanumeric, Symbol & Number Sequences 2.2 Coding-Decoding Techniques 2.3 Blood Relations 2.4 Input-Output (Machine Input) Arrangements

3 Chapter 3: Reasoning — Direction, Ranking, Inequalities & Miscellaneous

3.1 Direction Sense & Distance 3.2 Order, Ranking & Comparison Tests 3.3 Coded and Direct Inequalities 3.4 Alphabet Test, Word Formation, Calendar & Clock

4 Chapter 4: Reasoning — Syllogisms, Critical Deduction & Data Sufficiency

4.1 Standard Syllogisms & Venn Diagram Foundations 4.2 Advanced Syllogism Cases: Only a Few & Possibility Models 4.3 Critical Reasoning for Mains Examination 4.4 Reasoning Data Sufficiency

5 Chapter 5: Reasoning — Seating Arrangements

5.1 Linear Seating Arrangements 5.2 Parallel Row Seating Arrangements 5.3 Circular & Square/Rectangular Seating Arrangements

6 Chapter 6: Reasoning — Puzzles & Complex Enigmas

6.1 Floor and Flat-Based Puzzles 6.2 Box-Based Puzzles & Vertical Stacks 6.3 Scheduling, Month-Date & Multi-Variable Matrix Puzzles

7 Chapter 7: Quantitative Aptitude: Speed Math & Number Foundations

7.1 Speed Math, Vedic Shortcuts & BODMAS Simplification 7.2 Approximation Strategies for High-Speed Calculations 7.3 Missing and Wrong Number Series

8 Chapter 8: Quantitative Aptitude: Equations & Percentage Mathematics

8.1 Quadratic Equations & Root Comparison 8.2 Percentages, Base Conversions & Successive Changes 8.3 Profit, Loss, Marked Price, Discount & Dishonest Seller Traps

9 Chapter 9: Quantitative Aptitude: Interest, Ratio & Partnership

9.1 Simple & Compound Interest Mechanics 9.2 Ratio, Proportion & Variation Techniques 9.3 Partnership Mathematics

10 Chapter 10: Quantitative Aptitude: Averages, Mixtures & Time-Work

10.1 Averages, Weighted Averages & Age Problems 10.2 Alligation Method & Solution Replacement Problems 10.3 Time & Work, Efficiency Ratios & Pipes and Cisterns

11 Chapter 11: Quantitative Aptitude: Speed, Motion & Applied Mathematics

11.1 Speed, Time & Distance Principles 11.2 Problems on Trains, Platforms, and Boats & Streams 11.3 2D/3D Mensuration & Banking Permutation, Combination, Probability

12 Chapter 12: Quantitative Aptitude: Data Interpretation & Sufficiency

12.1 Tabular, Bar & Line Graph Data Interpretation 12.2 Pie Charts & Paragraph-Based Caselet DI 12.3 Advanced Mains DI & Quantitative Data Sufficiency

13 Chapter 13: English Language: Grammar & Usage

13.1 Core Grammar Rules for Banking Exams 13.2 Tenses, Prepositional Usages & Conditional Clauses 13.3 Error Spotting & Sentence Correction Strategies

14 Chapter 14: English Language: Comprehension, Vocabulary, Idioms & Discourse

14.1 Phrase Replacement, Single/Double Fillers & Sentence Improvement 14.2 Reading Comprehension Mastery 14.3 Cloze Tests, Para Jumbles & Discourse Connectors 14.4 Vocabulary: Synonyms, Antonyms, One-Word Substitution & Word Usage 14.5 Idioms, Phrasal Verbs, Spelling & Odd Sentence Out

15 Chapter 15: General & Financial Awareness: Banking System, RBI & Capital Regulation

15.1 Structure of the Indian Banking System 15.2 Reserve Bank of India & Monetary Policy Framework 15.3 Banking Operations, Negotiable Instruments & KYC/AML 15.4 Basel III Capital Framework, Prompt Corrective Action & D-SIBs

16 Chapter 16: General & Financial Awareness: Digital Banking & Financial Inclusion

16.1 Payment Systems, NPCI & Digital Banking 16.2 Priority Sector Lending & Financial Inclusion Initiatives 16.3 Non-Performing Assets & Debt Recovery Mechanisms

17 Chapter 17: General & Financial Awareness: Financial Markets, Economy, Schemes & Current Affairs

17.1 Money Market & Capital Market Instruments 17.2 Flagship Government Social Security Schemes & Union Budget 17.3 Static Banking GK, Financial Regulators & Current Affairs Mastery 17.4 Indian Economy Essentials: National Income, Inflation, Fiscal Indicators, GST & External Sector

18 Chapter 18: Computer Aptitude

18.1 Computer Fundamentals: Hardware Architecture, Memory & OS 18.2 Networking Protocols, Cybersecurity & Microsoft Office 18.3 Number Systems, Logic Gates, Flowcharts & Computer Basics

6.2 Box-Based Puzzles & Vertical Stacks

Key Takeaways Explain This Topic AI

Box stack puzzles differ from floor puzzles because coordinates are initially relative rather than fixed; the absolute positions (1 to N) are established by anchoring the longest rigid chains.

The gap constraint 'k boxes are kept between Box P and Box Q' translates to a positional coordinate difference of k + 1 (|Index(P) - Index(Q)| = k + 1).

The symmetrical boundary constraint 'as many boxes are kept above Box T as below Box U' enforces the mathematical invariant Index(T) + Index(U) = N + 1 in an N-box stack.

In unknown-capacity box stacks, evaluating whether fixed-position boundary items overlap or remain disjoint bounds the minimum and maximum total stack size.

The case elimination protocol relies on creating parallel bounding anchors from extreme candidate positions, systematically discarding branches upon cell collisions.

Last updated: September 2026

6.2 Box-Based Puzzles & Vertical Stacks

Vertical box-stack puzzles are a fundamental component of the Reasoning Ability section in both the Preliminary and Main phases of the SBI Clerk Examination . While floor puzzles provide a rigid architectural skeleton with numbered storeys firmly established at the outset, vertical box puzzles present a floating relative order . A collection of distinct boxes (typically 7 to 9 boxes in Prelims, expanding to 10 to 12 boxes or stacks of unknown total height in Mains) are stacked one above another.

Candidates must determine the absolute vertical coordinates—traditionally numbered from Position 1 at the bottom of the stack up to Position N N N at the top —by interpreting relative distance clues, symmetrical boundary conditions, and rigid adjacency pairs. A single miscalculated gap will derail the entire 5-question puzzle cluster, making mathematical rigor essential.

Deciphering Critical Box-Stack Terminology

Precision in box puzzle solving begins with converting linguistic clue phrases into exact algebraic equations.

1. The Gap-to-Index Conversion Formula

When a clue specifies an intervening gap between two boxes: "Exactly k boxes are kept between Box P and Box Q" \text{"Exactly } k \text{ boxes are kept between Box P and Box Q"} "Exactly k boxes are kept between Box P and Box Q"

This means there are k k k physical boxes separating P P P and Q Q Q . In terms of stack index numbers: ∣ Index ( P ) − Index ( Q ) ∣ = k + 1 |\text{Index}(P) - \text{Index}(Q)| = k + 1 ∣ Index ( P ) − Index ( Q ) ∣ = k + 1

Warning

The Common Off-by-One Trap: If three boxes are kept between Box P P P and Box Q Q Q , and Box Q Q Q is at Position 2, the position of Box P P P is NOT 2 + 3 = 5 2 + 3 = 5 2 + 3 = 5 . The correct position is 2 + ( 3 + 1 ) = 6 2 + (3 + 1) = \mathbf{6} 2 + ( 3 + 1 ) = 6 . Positions 3, 4, and 5 contain the three intervening boxes. Forgetting to add 1 to the gap size is the most common clerical exam error.

2. Immediate Adjacency vs. Open Precedence

Immediate Adjacency: "Box R is kept immediately above Box S" forms an unbreakable, rigid 2-box block: Index ( R ) = Index ( S ) + 1 ⟹ [ R S ] \text{Index}(R) = \text{Index}(S) + 1 \quad \implies \quad \begin{bmatrix} R \\ S \end{bmatrix} Index ( R ) = Index ( S ) + 1 ⟹ [ R S ​ ]

Open Precedence: "Box R is kept above Box S" indicates general superiority without fixed distance: Index ( R ) > Index ( S ) \text{Index}(R) > \text{Index}(S) Index ( R ) > Index ( S ) Any number of boxes (from zero intervening boxes up to N − 2 N-2 N − 2 boxes) may lie between them.

3. The Symmetrical Inversion Invariant

Clues establishing symmetrical balance across stack boundaries appear in nearly every SBI Clerk box set: "As many boxes are kept above Box T as below Box U" \text{"As many boxes are kept above Box T as below Box U"} "As many boxes are kept above Box T as below Box U"

In a stack containing N N N total boxes numbered 1 (bottom) to N N N (top):

Number of boxes above T = N − Index ( T ) T = N - \text{Index}(T) T = N − Index ( T )

Number of boxes below U = Index ( U ) − 1 U = \text{Index}(U) - 1 U = Index ( U ) − 1 Equating the two quantities yields the Symmetry Invariant Formula : N − Index ( T ) = Index ( U ) − 1 ⟹ Index ( T ) + Index ( U ) = N + 1 N - \text{Index}(T) = \text{Index}(U) - 1 \implies \mathbf{\text{Index}(T) + \text{Index}(U) = N + 1} N − Index ( T ) = Index ( U ) − 1 ⟹ Index ( T ) + Index ( U ) = N + 1

  • Total Stack Height ( N N N ) Position of Box T Boxes Above T Position of Box U Boxes Below U
  • N = 8 N = 8 N = 8 Position 8 (Top) 0 Position 1 (Bottom) 0
  • N = 8 N = 8 N = 8 Position 7 1 (Pos 8) Position 2 1 (Pos 1)
  • N = 8 N = 8 N = 8 Position 6 2 (Pos 7, 8) Position 3 2 (Pos 1, 2)
  • N = 8 N = 8 N = 8 Position 5 3 (Pos 6, 7, 8) Position 4 3 (Pos 1, 2, 3)

This mathematical rule allows candidates to immediately place Box U U U the instant Box T T T is identified, bypassing manual counting.

4. Unknown Total Boxes in a Stack

In SBI Clerk Mains, puzzles often withhold the total count N N N , giving clues like:

  • "Box X is 4th from the top."
  • "Box Y is 5th from the bottom."
  • "Two boxes are kept between Box X and Box Y."

To resolve N N N , analyze whether the segments are disjoint or overlapping:

Disjoint Arrangement ( X X X is above Y Y Y ): N = ( Rank from Top ) + ( Gap ) + ( Rank from Bottom ) = 4 + 2 + 5 = 11 boxes N = (\text{Rank from Top}) + (\text{Gap}) + (\text{Rank from Bottom}) = 4 + 2 + 5 = \mathbf{11 \text{ boxes}} N = ( Rank from Top ) + ( Gap ) + ( Rank from Bottom ) = 4 + 2 + 5 = 11 boxes

Overlapping Arrangement ( Y Y Y is above X X X ): N = ( Rank from Top ) + ( Rank from Bottom ) − ( Gap ) − 2 = 4 + 5 − 2 − 2 = 5 boxes N = (\text{Rank from Top}) + (\text{Rank from Bottom}) - (\text{Gap}) - 2 = 4 + 5 - 2 - 2 = \mathbf{5 \text{ boxes}} N = ( Rank from Top ) + ( Rank from Bottom ) − ( Gap ) − 2 = 4 + 5 − 2 − 2 = 5 boxes If other clues state "at least 8 boxes are in the stack," the overlapping possibility is ruled out instantly, fixing N = 11 N = 11 N = 11 .

The Bounding Anchor Method

When attacking an 8-box puzzle under time constraints, follow this structured execution pipeline:

Locate the Widest Rigid Span (The Bounding Anchor): Scan the clue list for the largest gap. A statement like "Three boxes between Box P and Box K, where K is at an odd position" binds 5 consecutive slots ( P , − , − , − , K P, -, -, -, K P , − , − , − , K ).

Determine Finite Placements: In an 8-slot stack, a 5-slot span has very few valid configurations. If K K K is on an odd position, K K K can only be at Position 1 (forcing P P P to 5) or Position 3 (forcing P P P to 7). Position 5 would place P P P at 5 + 4 = 9 5 + 4 = 9 5 + 4 = 9 , exceeding the 8-box ceiling.

Spin Off Parallel Cases: Set up Case 1 ( K = 1 , P = 5 K=1, P=5 K = 1 , P = 5 ) and Case 2 ( K = 3 , P = 7 K=3, P=7 K = 3 , P = 7 ) .

Attach Compound Rigid Blocks: Connect secondary clues that bind directly to P P P or K K K (e.g., "Box M is immediately above Box P" ).

Apply Boundary Inversions: Use symmetrical conditions ( "as many above M as below O" ) to fix outer coordinates.

Execute Case Termination: When an incoming clue requires a position that is already occupied by another box, immediately terminate that branch.

  • Step-by-Step Worked 8-Box Stack Puzzle
  • Problem Statement

Eight boxes— J, K, L, M, N, O, P, and Q —are stacked one above another in a vertical rack, but not necessarily in the same order. The bottommost position is numbered 1, and the topmost position is numbered 8.

Clues:

Exactly three boxes are kept between Box P P P and Box K K K , where Box P P P is kept above Box K K K .

Box K K K is kept on an odd-numbered position.

Box M M M is kept immediately above Box P P P .

As many boxes are kept above Box M M M as below Box O O O .

Box J J J is kept immediately above Box O O O .

Box N N N is kept immediately above Box Q Q Q .

Box Q Q Q is kept immediately above Box K K K .

Box L L L occupies the remaining position in the stack.

  • Step-by-Step Deduction and Case Resolution
  • Step 1: Anchor the Widest Span (Clues 1 and 2)

Clue 1 states: 3 boxes between P P P and K K K , with P P P above K K K . Mathematically: Index ( P ) − Index ( K ) = 4 \text{Index}(P) - \text{Index}(K) = 4 Index ( P ) − Index ( K ) = 4 .

Clue 2 states: K K K is on an odd-numbered position ( { 1 , 3 , 5 , 7 } \{1, 3, 5, 7\} { 1 , 3 , 5 , 7 } ).

If K = 1 K = 1 K = 1 : Index ( P ) = 1 + 4 = 5 \text{Index}(P) = 1 + 4 = 5 Index ( P ) = 1 + 4 = 5 .

If K = 3 K = 3 K = 3 : Index ( P ) = 3 + 4 = 7 \text{Index}(P) = 3 + 4 = 7 Index ( P ) = 3 + 4 = 7 .

If K = 5 K = 5 K = 5 : Index ( P ) = 5 + 4 = 9 \text{Index}(P) = 5 + 4 = 9 Index ( P ) = 5 + 4 = 9 (Exceeds stack limit of 8; invalid).

This produces two viable starting cases:

Case 1: K = Position 1 K = \text{Position } 1 K = Position 1 , P = Position 5 P = \text{Position } 5 P = Position 5 .

Case 2: K = Position 3 K = \text{Position } 3 K = Position 3 , P = Position 7 P = \text{Position } 7 P = Position 7 .

Step 2: Integrate Clue 3 (Immediate Adjacency)

Clue 3 states: Box M M M is kept immediately above Box P P P ( Index ( M ) = Index ( P ) + 1 \text{Index}(M) = \text{Index}(P) + 1 Index ( M ) = Index ( P ) + 1 ):

In Case 1: P = 5 ⟹ M = Position 6 P = 5 \implies M = \text{Position } 6 P = 5 ⟹ M = Position 6 .

In Case 2: P = 7 ⟹ M = Position 8 P = 7 \implies M = \text{Position } 8 P = 7 ⟹ M = Position 8 .

Step 3: Apply Symmetrical Inversion (Clue 4)

Clue 4 states: As many boxes are kept above Box M M M as below Box O O O ( Index ( M ) + Index ( O ) = 8 + 1 = 9 \text{Index}(M) + \text{Index}(O) = 8 + 1 = 9 Index ( M ) + Index ( O ) = 8 + 1 = 9 ):

In Case 1: M = 6 M = 6 M = 6 . Boxes above M = 8 − 6 = 2 M = 8 - 6 = 2 M = 8 − 6 = 2 . Therefore, boxes below O O O must be 2, placing O = Position 3 O = \text{Position } 3 O = Position 3 (Check: 6 + 3 = 9 6 + 3 = 9 6 + 3 = 9 ).

In Case 2: M = 8 M = 8 M = 8 . Boxes above M = 8 − 8 = 0 M = 8 - 8 = 0 M = 8 − 8 = 0 . Therefore, boxes below O O O must be 0, placing O = Position 1 O = \text{Position } 1 O = Position 1 (Check: 8 + 1 = 9 8 + 1 = 9 8 + 1 = 9 ).

Step 4: Attach Clue 5 (Immediate Adjacency)

Clue 5 states: Box J J J is kept immediately above Box O O O ( Index ( J ) = Index ( O ) + 1 \text{Index}(J) = \text{Index}(O) + 1 Index ( J ) = Index ( O ) + 1 ):

In Case 1: O = 3 ⟹ J = Position 4 O = 3 \implies J = \text{Position } 4 O = 3 ⟹ J = Position 4 .

In Case 2: O = 1 ⟹ J = Position 2 O = 1 \implies J = \text{Position } 2 O = 1 ⟹ J = Position 2 .

Step 5: Test Rigid Block Clues 6 and 7 (Case Elimination)

Clue 7 states: Box Q Q Q is kept immediately above Box K K K ( Index ( Q ) = Index ( K ) + 1 \text{Index}(Q) = \text{Index}(K) + 1 Index ( Q ) = Index ( K ) + 1 ).

Clue 6 states: Box N N N is kept immediately above Box Q Q Q ( Index ( N ) = Index ( Q ) + 1 \text{Index}(N) = \text{Index}(Q) + 1 Index ( N ) = Index ( Q ) + 1 ).

Combining Clues 6 and 7 yields a rigid 3-box vertical sequence: [ N / Q / K ] [N / Q / K] [ N / Q / K ] where: Index ( Q ) = Index ( K ) + 1 and Index ( N ) = Index ( K ) + 2 \text{Index}(Q) = \text{Index}(K) + 1 \quad \text{and} \quad \text{Index}(N) = \text{Index}(K) + 2 Index ( Q ) = Index ( K ) + 1 and Index ( N ) = Index ( K ) + 2

Now test this rigid sequence against both cases:

Testing Case 1:

In Case 1, K = Position 1 K = \text{Position } 1 K = Position 1 .

Thus, Q Q Q must be at Position 2, and N N N must be at Position 3.

However, look at Case 1 coordinates from Step 3: Position 3 is already occupied by Box O O O !

A cell collision occurs: Box N N N and Box O O O cannot both occupy Position 3.

Case 1 is definitively contradictory and eliminated.

Testing Case 2:

In Case 2, K = Position 3 K = \text{Position } 3 K = Position 3 .

Thus, Q Q Q must be at Position 3 + 1 = 4 \text{Position } 3 + 1 = \mathbf{4} Position 3 + 1 = 4 .

N N N must be at Position 3 + 2 = 5 \text{Position } 3 + 2 = \mathbf{5} Position 3 + 2 = 5 .

Let us verify if Positions 4 and 5 are vacant in Case 2:

  • Position 8: Box M M M
  • Position 7: Box P P P
  • Position 5: Vacant ⟹ \implies ⟹ Box N N N placed
  • Position 4: Vacant ⟹ \implies ⟹ Box Q Q Q placed
  • Position 3: Box K K K
  • Position 2: Box J J J
  • Position 1: Box O O O

Positions 4 and 5 accommodate Box Q Q Q and Box N N N perfectly without conflict!

Step 6: Finalize Remaining Box (Clue 8)

In Case 2, the only unoccupied coordinate is Position 6 .

Clue 8 states that Box L L L occupies the remaining position.

Therefore, Box L = Position 6 L = \text{Position } 6 L = Position 6 .

Final Verified Box Stack Order

  • Position Index Box Identity Verification of Relative Constraints
  • Position 8 (Top) Box M Immediately above Box P; 0 boxes above (matches 0 below Box O)
  • Position 7 Box P 3 boxes (L, N, Q) between Box P and Box K (7 - 3 = 4)
  • Position 6 Box L Occupies remaining slot
  • Position 5 Box N Immediately above Box Q
  • Position 4 Box Q Immediately above Box K
  • Position 3 Box K Odd-numbered position; 3 boxes below Box P
  • Position 2 Box J Immediately above Box O
  • Position 1 (Bottom) Box O 0 boxes below (matches 0 above Box M)

Loading diagram... Vertical Box Stack and Relative Distance Architecture