Add comments

algorithms-and-data-structures/src/main/java/com/xtenzq/arrays/TwoPointers.java

@@ -2,6 +2,13 @@
 
 public class TwoPointers {
 
+    /**
+     * Checks if the given string is a palindrome.
+     *
+     * @param input the string to check for palindrome properties
+     * @return {@code true} if the input string is a palindrome, false otherwise
+     * @implNote This method runs in {@code O(n)} time complexity and {@code O(1)} space complexity, where n is the length of the input string.
+     */
     public static boolean isPalindrome(String input) {
         int start = 0;
         int end = input.length() - 1;
@@ -15,6 +22,14 @@ public static boolean isPalindrome(String input) {
         return true;
     }
 
+    /**
+     * Checks if there are two distinct elements in the sorted array that sum up to the given target.
+     *
+     * @param sortedArray an array of integers that is already sorted in ascending order
+     * @param target      the sum to find in the array
+     * @return {@code true} if there are two distinct elements in the array whose sum is equal to the target, {@code false} otherwise
+     * @implNote This method runs in {@code O(n)} time complexity and {@code O(1)} space complexity, where n is the length of the sortedArray.
+     */
     public static boolean canBeSummed(int[] sortedArray, int target) {
         int start = 0;
         int end = sortedArray.length - 1;