Day 2 of my LeetCode Journey

Today I solved these Easy level problems:

• Find the Highest Altitude
• Find Pivot Index
• Guess Number Higher or Lower

I solved first one by my own at my first try, but I used extra space to solve this problem and once I saw the solution video, I understand that I can solve this problem with constant O(1) space, so I learned the algorithm and approach and tried it and it worked!

For the second one also I tried and I solved but the main issue was, my solution was the “Brute Force” approach so it took O(n²) for Time and it took linear space. Once I saw the explanation video, I understand that I can do better so I watched that video and understand the approach and I implemented it by myself, overall I ended up with constant space and linear Time complexities.

Last but not least, this problem was somehow familiar for me, cause I played this kind of games a lot when I was in school, so main ideas is selecting the middle number out of all possibilities and we will end up destroying one side or eliminating one side completely. In a sum of I used Binary Search algorithm to find the picked number and we ended up with logarithmic time and constant space complexity.

That is preety much it for today and now I need to apply at least 20 companies, it includes internships and new grad roles.

All the best and see you tomorrow for my daily update

-Mirakbar