Facebook Coding Interview Question - First and Last Position in Sorted Array (LeetCode)

🎧 Join the community Discord: https://discord.gg/aVWsAaaCtT
💰 Support me on Patreon: https://www.patreon.com/michaelmuinos
🔗Follow me on LinkedIn: https://www.linkedin.com/in/michael-muinos
📂Follow me on Github: https://github.com/MichaelMuinos

Here is a step by step explanation of a binary search question asked at Facebook.

This problem is primarily asked at Facebook, but other companies include Uber, Google, and LinkedIn. The idea behind the problem is we must perform two binary searches, the first searching for the left most index of our target and the second searching for the right most index of our target.

The binary searches we perform are very similar to a typical binary search when we are simply searching to see if a target is present; however, we must also keep track of an integer representing the index that our target was found at.

Видео Facebook Coding Interview Question - First and Last Position in Sorted Array (LeetCode) канала Michael Muinos