Completed Binary-Search-2

[vidyasreekumar]

No description provided.

[super30admin]

• The student's solution for Problem-1 is excellent and matches the reference solution in terms of correctness, time complexity, and space complexity.
• The code is clean and well-organized, making it easy to understand.
• For Problem-2 and Problem-3, the student has demonstrated a good understanding of binary search applications in different scenarios.
• One minor suggestion: in Problem-1, the condition if(target < nums[0] || target > nums[n-1]) could be moved inside the binarySearchFirst function to avoid redundant checks, but this is a minor optimization and does not affect the overall correctness or efficiency.