2026 Jan OPPE 1 - Set 3

Section 1 · Question 1

Nearest Multiple

Return the multiple of k closest to n. Covers floor division, distance comparison, and the tie-breaking >= rule.

Solved

Section 1 · Question 2

Encode by Shifting Ends

Shift first and last characters by ±1 in ASCII with guards for 'z' and 'a'. Covers ord(), chr(), and edge cases for length-1 strings.

Solved

Section 1 · Question 3

Repeat Second Half of a Tuple

Same as 2025 May Set 5 - S1Q3. Covers (n+1)//2 ceiling division and tuple concatenation.

Solved

Section 2 · Question 1

Process Orders Aggregation

Aggregate customer order data with a minimum quantity threshold. Covers list comprehensions, setdefault(), and walrus operator filtering.

Solved

Section 2 · Question 2

Snakes and Ladders - Next Position

Compute the next board position given dice, snakes, and ladders. Full I/O - covers dict.get(pos, pos) and the >100 boundary rule.

Solved

Section 3 · Question 1

Inventory Stock Analytics

Four functions on warehouse inventory - reorder alerts, totals, stock classification, transfer simulation. Covers next(..., None), reuse of helper functions, and multi-condition guards.

Solved

Section 3 · Question 2

Dual Pattern Printing

Print a symmetric concatenation pattern and a triangular sequential number pattern. Full I/O - covers running counters and two-loop symmetric patterns.

Solved

📁 All slides for this set (GitHub)