Quick Overview

Determine whether an input string can be divided into exactly three nonempty contiguous palindromes that cover every character without overlap or reordering.

Split a String into Exactly Three Palindromes

Company: Oracle

Role: Backend Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Determine whether an input string can be divided into exactly three nonempty contiguous palindromes that cover every character without overlap or reordering.

Read the full Oracle Backend Engineer interview experience this question came from

Loading…