Aaj ke live stream me maine Codeforces Round-111 (Div-2) ke Problem A, B, C solve kiye—bilkul educational mode me, step-by-step soch ke. Start me thoda setup + usual reminder (subscribe/like/share) aur phir seedha A pe gaya. Problem A me main idea ye tha ki “beautiful array” banane ke liye 1 ka present hona almost mandatory feel hota hai, aur phir main greedy angle se sochta hoon: next element hamesha maximum possible add karo taaki size minimum rahe. Maine small sums ke examples (2,3,4…) se pattern build karke intuition banayi—yeh wali approach contests me fast nikalti hai. Problem B me maine string deletion operations ko score maximize karne ke lens se simplify kiya. Observation ye nikla ki total score ko essentially operations count X pe depend kara ke dekho: agar b positive hai to X maximize (single characters delete), aur agar b negative hai to X minimize (groups/blocks me delete). Yahi reason hai ki main groups ki length nikal ke formula apply karta hoon—coding simple, thinking important. Problem C (Manhattan distance) me honestly mujhe time laga. Core logic mujhe mil gaya tha, but ek condition miss ho rahi thi, aur pressure me last minutes me submit hua. Takeaway: DP/geometry type questions me conditions ka “both directions” check karna zaroori hai—sirf ek side assume karoge to fas jaoge. Aur haan—1 year complete on YouTube, 50-60 log bhi genuinely benefit le rahe hain to mere liye kaafi hai.