Can I Solve a LeetCode Medium First Try? (Unfiltered) | Partition Array According to Given Pivot

No scripts. No pre-solved code. Just the raw, unfiltered reality of tackling a LeetCode Medium problem. Today, I’m jumping into LeetCode 2161: "Partition Array According to Given Pivot". Instead of showing you a perfectly polished, 5-minute solution, I wanted to show the actual thought process, the logic dead-ends, and how to debug a medium-level array problem in real-time. Whether you're prepping for interviews or just grinding DSA, hopefully seeing the struggle helps you with your own coding journey! 🕒 Timestamps: 0:00 - Introduction 0:50 - Reading the Problem & Initial Logic 11:49 - Writing the First Solution 21:13: Submitting the solution (probably buggy) 21:32: Let's Optimize it 31:10: Giving Up! Let's see Leetcode Solution 33:20: Explaining the Second Solution If you want to see more unfiltered DSA sessions, drop a comment letting me know what problem I should tackle next. Don't forget to like and subscribe! #leetcode #datastructures #algorithms #codinginterview #unfiltered #softwareengineer #faang #programming #coding