More Problems

• Find the smallest subarray that contains at least one negative number using two pointers.
• Check if a string can be made into a palindrome by changing exactly one pair of adjacent characters using two pointers.
• Find the maximum number of distinct pairs in an array whose sum is less than or equal to a given value using two pointers.
• Check if two arrays can be rearranged to form a common subsequence using two pointers.
• Find the longest subarray where the sum of elements is a prime number using two pointers.
• Check if a string can be split into two parts with equal sums using two pointers.
• Find the smallest subarray where all elements are greater than or equal to a given value using two pointers.
• Check if two strings are valid anagrams by deleting exactly one character using two pointers.