How Reading Problem Constraints Can Instantly Reveal the Right Algorithm

A competitive programmer shares a practical framework for decoding algorithmic problems by interpreting numerical constraints rather than guessing solutions blindly. The core insight is that constraint values such as n ≤ 2·10⁵ or m ≤ 10³ directly signal which complexity class an algorithm must fall within, effectively ruling out entire families of approaches. A reference table maps common constraint patterns to suitable algorithm families, including prefix sums, segment trees, Dijkstra's algorithm, and dynamic programming. The author illustrates the method with a static range-sum query problem, showing how constraints guide the choice of prefix sums for an O(n+q) solution. The framework shifts problem-solving from memorizing techniques to first asking what the maximum affordable runtime is given the stated limits.