Completed Problem 1, 2 and 3

[sarvesh-gaurishankar-sawant]

No description provided.

[super30admin]

• Strengths:
  • The student demonstrates a strong understanding of binary search and its variations.
  • The code is clean, well-organized, and follows best practices.
  • Edge cases are handled correctly, and the logic is sound.
• Areas for Improvement:
  • In ProblemOne, the variable names lowerBound and upperBound could be more descriptive, such as firstOccurrence and lastOccurrencePlusOne, to better reflect their purpose.
  • In ProblemThree, the return of Integer.MAX_VALUE is unnecessary since the problem guarantees a peak exists. The loop will always find a peak, so this line can be removed.
  • Adding comments to explain the logic in more detail could further enhance readability, especially for someone new to binary search.