Solved Binarsearch 2 problems

[aahiawasthee]

No description provided.

[super30admin]

Strengths:

• Good understanding of binary search concepts.
• Correct time and space complexity analysis.
• Generally clean and readable code structure.

Areas for Improvement:

• Pay attention to small details like operator typos (low <+ high should be low <= high).
• Consider adding comments to explain the logic, especially for edge cases.
• Ensure consistent formatting throughout the code (e.g., spacing around operators).
• For the "find-first-and-last-pos.java" solution, the condition nums[mid] > nums[mid - 1] could be simplified to nums[mid - 1] != target for better clarity.