More Problems

• Check if a string can be rearranged to form a palindrome by deleting exactly one character using two pointers.
• Find the longest subarray where the difference between consecutive elements is less than or equal to a target using two pointers.
• Check if two strings are equivalent by reversing at most one substring using two pointers.
• Find the smallest subarray with a sum greater than or equal to a target, containing only even numbers, using two pointers.
• Check if a string can be segmented into three palindrome substrings using two pointers.
• Find the longest subarray that contains only odd numbers using two pointers.
• Check if a given string can be made into a palindrome by removing exactly two characters using two pointers.
• Find the maximum sum of a subarray containing at least one negative number using two pointers.