Binary-search 2 done

[neelp1025]

No description provided.

[super30admin]

Strengths:

• The student has correctly implemented the binary search to find the first and last occurrences of the target.
• The code is well-commented, making it easy to understand the logic.
• The solution handles edge cases, such as when the target is not found in the array.

Areas for Improvement:

• The method names findFirstOccurrence and findSecondOccurrence could be more descriptive. For example, findFirstOccurrence could be renamed to binarySearchFirst and findSecondOccurrence to binarySearchLast to align with the reference solution's naming convention.
• The comment "unreachable since we found the first match" in the findSecondOccurrence method is correct but could be omitted as it is implied by the logic.