Data Structures & Algorithms: Competitive Programming Foundations

<p>Meera Iyer has forty-five days before her campus placement drive, and a rejection email already behind her -- she solved half the online assessment and timed out on the rest. Mentored by Kabir Rathore, the campus's competitive-programming veteran, and pushed along by her rival Naina Deshpande, she rebuilds her problem-solving instincts from scratch across six timed, contest-style sessions: arrays and strings with real time and space complexity intuition, hashing and hash maps, two pointers, sliding window, and recursion with memoization. Every technique is introduced through an actual problem solved under a clock, not a lecture delivered before practice -- and every session ends with a timed round and runnable Python code, building toward a full mock placement-drive contest that mirrors the real thing. By the end, you won't just know the five techniques; you'll have the pattern-recognition habit of asking what an input size implies about the shape of algorithm a problem actually needs.</p>

Tools: Arrays & Strings, Hashing, Two Pointers, Sliding Window, Recursion, Big-O Analysis