More Problems

• Check if a given array can be sorted in a single swap using two pointers.
• Find the maximum number of distinct elements in any subarray of size k using two pointers.
• Check if two sorted arrays can be combined into a single sorted array using two pointers.
• Find the minimum number of operations required to make a string palindrome using two pointers.
• Find the smallest subarray where the product of elements is less than a given value using two pointers.
• Check if a string is a palindrome by removing at most one character using two pointers.
• Find the longest subarray with an equal number of 1s and 0s using two pointers.
• Find the maximum sum of a subarray with at least one odd number using two pointers.