Binary-Search-2 Complete

[PrasiddhShah]

No description provided.

[super30admin]

• The solution is well-implemented and correct. Good job on handling edge cases and using binary search effectively.
• The comment about time complexity could be clarified to avoid confusion. It's better to state it as O(log n) for both searches, as the second search is still within the bounds of the array.
• The variable names like inital should be corrected to initial for better readability.
• The approach is sound, and the code is clean. Keep up the good work!