Mathematics, Competitive Programming, Philosophy, Discrete Mathematics.
with data structures and skims over some details. Part 1: A Colourful Challenge 1.0 Problem statement Start with a unicoloured 1*n strip having n cells. In one stroke, paint any contiguous segment of cells with any single colour, repainting over previous segments. Make any m such strokes. Over all