completed binarysearh2

[DhanyasriG]

No description provided.

[super30admin]

Strengths:

• The solutions correctly implement binary search logic for all three problems.
• The time and space complexity are optimal.
• The code is generally clean and follows good practices.

Areas for Improvement:

• Improve variable naming for better readability (e.g., f in binarySearch could be findFirst).
• Consider combining the first and last search logic in Problem1 into a single function to reduce redundancy.
• Add comments to explain the logic, especially the use of boolean flags in binarySearch.
• Ensure consistent formatting (e.g., spacing around operators and braces).