More Problems

• Check if two strings can be made identical by swapping exactly one pair of adjacent characters using two pointers.
• Find the maximum sum of a subarray that contains exactly k distinct elements using two pointers.
• Check if a string can be split into two parts where each part is a palindrome using two pointers.
• Find the longest subarray that contains at least two distinct numbers using two pointers.
• Check if two arrays are subsets of each other using two pointers.
• Find the smallest subarray where the sum of elements is a prime number using two pointers.
• Check if two strings can be made palindrome by changing exactly one character using two pointers.
• Find the longest subarray where the product of elements is less than or equal to a target using two pointers.