Detect palindrome in array

Last updated: September 28, 2025

Quick Overview

Given an array of integers, write a function to detect all unique palindromic subarrays within the array. The function should return a list of these palindromic subarrays, where each subarray is represented as an array of integers. The solution should efficiently identify palindromic patterns while considering the constraints of the input size.

Uber
Coding & Algorithms
Software Engineer
Uber
September 28, 2025
Software Engineer
Phone Screen
Coding & Algorithms
Medium

45

15

2,789 solved


Given an array of integers, write a function to detect all unique palindromic subarrays within the array. The function should return a list of these palindromic subarrays, where each subarray is represented as an array of integers. The solution should efficiently identify palindromic patterns while considering the constraints of the input size.

This coding problem is frequently asked during Phone Screen at Uber. The interviewer is testing your ability to translate a problem into clean, working code while discussing time and space complexity. Uber expects candidates to write production-quality code, not just solve the puzzle.

What the Interviewer Expects
  • Recognize the underlying problem pattern (sliding window, two pointers, BFS/DFS, etc.)
  • Discuss multiple approaches and trade-offs before coding
  • Implement an optimal solution with clean, production-quality code
  • Handle all edge cases including boundary conditions and invalid input
  • Optimize both time and space complexity with clear justification
  • Test your solution systematically with well-chosen examples
Key Topics to Cover
Binary search and divide and conquer
Edge cases and input validation
Common algorithm patterns (sliding window, two pointers, BFS/DFS)
Time and space complexity analysis
Data structure selection and trade-offs
Dynamic programming and memoization
How to Approach This
  1. Clarify input constraints and edge cases before writing code.
  2. Walk through your approach verbally and confirm with the interviewer before coding.
  3. Start with a brute force solution, then optimize. Mention time and space complexity.
  4. Test your solution with examples, including edge cases like empty input or duplicates.
  5. Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Possible Follow-up Questions
  • How would you modify your solution to handle streaming input?
  • What is the worst-case input for your solution?
  • How would your solution change if the input was sorted?
Sharpen Your Skills on Codemia

Practice similar problems with our interactive workspace, get AI feedback, and track your progress.

Practice DSA Problems
Sample Answer
Problem Analysis

To detect all unique palindromic subarrays within an array of integers, we can recognize that this problem can leverage a two-pointer technique. A palindromic array is one that reads the same forwards...

Approach
  1. Iterate through the array, treating each element and each pair of consecutive elements as potential centers for palindromes.
  2. For each center, use two pointers to expand outward as long as the ...

Submit Your Answer
Markdown supported

Related Questions