Struggling to Solve LeetCode 35: A Realistic Beginner's Attempt at 'Search Insert Position'

Watch an unscripted and genuine attempt at solving LeetCode problem #35: Search Insert Position. This video captures the raw thought process, mistakes, and struggles of an average person tackling the problem for the first time. It's not a polished tutorial—it's an honest reflection of the learning process. If you've ever felt stuck or overwhelmed while solving coding challenges, you're not alone! Join me on this journey of trial, error, and discovery.

Problem Description:
Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

Can you solve it faster than I did (or didn't)?

➡️ Let me know in the comments how you approach coding challenges and what you think I could have done better!