Add search algorithms for rotated array, 2D matrix, and unknown size …

[Balaviknesh]

…array

[super30admin]

Strengths:

• The solution correctly implements the binary search algorithm for a rotated sorted array.
• The time and space complexity are optimal.
• The code is clean and well-commented.

Areas for Improvement:

• While the solution is correct, it's important to note that the problem requires a solution for a specific problem. The submission includes multiple classes for different problems. In a real scenario, you should submit only the solution for the problem at hand. However, since this is an evaluation, we are only considering the relevant class.
• The condition in the right sorted part: if (target > nums[mid] && target <= nums[right]) is correct, but note that the reference solution uses the same logic. However, in Kotlin, we can write it exactly as in the reference.

One minor point: the problem states that the array has distinct values, so we don't have to worry about duplicates. The solution leverages this.

Overall, the solution is excellent.

[super30admin]

Your solution for the rotated sorted array search is excellent. It correctly identifies which half of the array is sorted and adjusts the search range accordingly. The time and space complexity are optimal. The code is clean and well-commented. However, please note that when submitting solutions, you should only include the relevant code for the problem at hand. Including unrelated problems (like Search2DMatrix and SearchArrayUnknownSize) in the same file or submission might cause confusion. For future submissions, focus on the specific problem being evaluated.