More Problems

• Check if two strings can be made palindrome by deleting exactly one character using two pointers.
• Find the longest subarray that contains no duplicate elements using two pointers.
• Check if two arrays can be merged to form a sorted sequence with no duplicates using two pointers.
• Find the smallest subarray where the sum of elements is a prime number using two pointers.
• Check if a string can be rearranged to form two identical palindrome substrings using two pointers.
• Find the longest subarray where the difference between adjacent elements is less than or equal to a target using two pointers.
• Check if two strings are rearrangements of each other by swapping one character using two pointers.
• Find the maximum sum of a subarray where the sum of elements is divisible by a prime number using two pointers.