More Problems

• Check if two strings can be made palindrome by deleting exactly one pair of adjacent characters using two pointers.
• Find the longest subarray where all elements are divisible by a given prime number using two pointers.
• Check if two strings are reverse of each other after swapping two characters using two pointers.
• Find the smallest subarray where all elements are greater than or equal to a target using two pointers.
• Check if two arrays can be split into subarrays with equal sums after swapping two adjacent elements using two pointers.
• Find the longest subarray where the sum of elements is greater than or equal to a target using two pointers.
• Check if two strings are rearrangements of each other after changing two characters using two pointers.
• Find the maximum sum of a subarray where the sum of elements is divisible by a prime number using two pointers.