Updated Pr for BS1

[sindhoorpalla]

No description provided.

[super30admin]

• Matrixd.java:
  • Fix syntax errors: use == for comparison, correct variable names, and remove return statements inside the loop.
  • Ensure the loop condition is l <= r instead of l < r to handle edge cases.
• SearchRS.java:
  • Initialize l properly (should be int l = 0).
  • Correct nums.length() to nums.length.
  • Move the binarySearch method outside the search method.
  • Fix the logic for finding the pivot in a rotated sorted array.
• SearchUnknownSizeArray.java:
  • This is the best implementation among the three. Good job!
• General:
  • Use consistent and descriptive variable names.
  • Ensure proper method structure and avoid nesting methods.
  • Test your code with edge cases to catch logical errors.