Palantir 2026-February| Hard CP | Tries & Manacher's Algorithm | On-campus

Question 1: Maximum XOR Subarray Problem Statement Given an array A of N integers, find the contiguous subarray that yields the maximum possible Bitwise XOR sum. Print the maximum XOR sum. Constraints 1 <= N <= 105 0 <= A[i] <= 109 Example Input: 4 1 2 3 4 Output: 7 Explanation The subarray [3, 4] gives the maximum XOR sum: 3 ^ 4 = 7. Question 2: Longest Palindromic Substring O(N) Problem Statement Given a string S, return the ...