Lead Developer → Future Professor: Why I Enrolled in BITS Pilani MTech at 31 Most developers plan for the next job or the next promotion. "But what's your plan for after 45?" If you can't confidently answer that — this post will make you think. After 10+ years of writing Java in Banking & Fintech, I enrolled in BITS Pilani's Work Integrated MTech program — Data Science & Engineering, April 2026 batch. Not for a salary hike. Not for a job switch. For a 15-year plan . Watch Full Video Explanation Why MTech After 10+ Years of Coding? My long-term goal is to become an Engineering Professor in Delhi-NCR around 2040 — after I retire from corporate. After a decade of building production systems, I genuinely believe that experienced developers make the best teachers . A fresh PhD holder might explain a database index using mathematical proofs. I've debugged a query that brought down a payments system because someone forgot an index. T...
Master Arrays & Strings Without Memorizing A simple way to actually understand DSA instead of getting stuck. You know arrays. You know strings. But can you solve this quickly? [2, 7, 11, 15], target = 9 Most developers struggle here — not because it’s hard, but because they don’t think the right way. Understanding Arrays (The Right Way) Think of an array like a row of boxes in memory. [10] [20] [30] [40] Index: 0 1 2 3 You can directly jump to any index. That’s why access is extremely fast. Access → O(1) Insert/Delete → O(n) Add your array visualization image here Where Arrays Become Slow [10, 20, 30, 40] Insert 15 at index 1 → [10, 15, 20, 30, 40] Everything shifts → that’s the cost. Let’s Solve a Problem [2, 7, 11, 15], target = 9 The beginner approach is brute force — try all pairs. It works… but it’s slow. The real question is: Can we avoid repeating work? Two Pointer Thinking If the array...