Leetcode 2983. Palindrome Rearrangement Queries

Given an even-length string s and queries that allow arbitrary rearrangement of one substring in the left half and one in the right half per query, determine for each query whether those allowed rearrangements can make s a palindrome. The core challenge is to decide quickly, for many queries, whether character counts in the affected segments can resolve all mismatched character pairs across the two halves.