Complexity: O(n) per loop, total still linear — IITM BS previous year questions

Complexity: O(n) per loop, total still linear is part of Multiple Iterations (Non-nested), Week 3 in Computational Thinking. Prasnya files every IIT Madras BS previous year question from this subtopic here, each one with a worked explanation. Take the whole set as a timed mock and you get accuracy, pacing and per-question analysis back.