Second Largest Element in Array | Brute → Better → Optimal | Python DSA #2

If you watched Video #1, you'll remember the most common bug there was initializing largest = 0 — and how it silently broke the code for negative arrays. This one is sneakier. 😅 "Find the second largest element in an array" sounds like a beginner problem. But every batch I've taught, the same thing happens — students write a solution that works for [3, 7, 2, 9, 4], feel confident, and then crash the moment the array becomes [10, 10, 5]. That's why I didn't want to jump straight to the optimal trick. Instead, this video walks through the problem the way a real interview actually goes: → Brute force first — sort the array and pick the second-last. It works, but it's O(n log n), and we'll see why interviewers don't love it. → Better approach — two passes. Find the largest, then find the largest element that isn't equal to it. Handles duplicates cleanly. → Optimal — single pass, O(n), the version that wins points in the interview room. Each step builds on the previous one. If you follow the reasoning, you won't need to memorize this problem — you'll just know how to think about it. That's the goal of the whole series. One small ask: please code along, don't just watch. DSA is something your fingers have to learn, not just your eyes. ⏱️ Chapters: 0:00 The problem (and why it's trickier than it looks) 0:45 Brute force — sort and pick the second-last 2:30 Why brute force fails for [10, 10, 5] 3:15 Better approach — two-pass solution 5:40 The hidden bug 80% of students miss 7:00 Optimal single-pass O(n) solution 9:20 Dry run on a tricky test case 11:00 Time & space complexity comparison 12:00 Common interview follow-ups 🔗 Useful links: Full Python DSA playlist → [INSERT PLAYLIST LINK] Previous video — Largest Element in Array → [INSERT LINK] Source code on GitHub → [INSERT LINK] Practice problem (GFG / LeetCode) → [INSERT LINK] If you're prepping for placements, we also have IIT/IIIT senior interview stories on the channel — real people who cracked Google, Microsoft, Amazon, and yes, even Oracle (back when offers weren't getting revoked 😅). Real prep, real conversations, no fluff. Drop a comment if this clicked for you. And honestly — drop one if it didn't. I read every single comment, and your doubts directly shape the next videos. Subscribe to WeGrad → https://www.youtube.com/@WeGradschool Visit us → https://www.wegrad.in Reach out → +91 93103 39438 See you in Video #3 — same time, same series. Until then, keep coding. 💚 — Mohan Co-founder, WeGrad #PythonDSA #DSAinPython #SecondLargestInArray #CodingInterview #PlacementPreparation #ArrayProblems #WeGrad #PythonForBeginners