← Informatica questions

Maximum sum subset and palindromic substrings

Filed under Informatica

The question

Write programs to find a subset of a given array whose sum is maximum, and find all palindromic substrings for a given string.

No write-up yet. Related questions below have one.

Related Informatica questions

Collected from public candidate posts and coding forums. Updated Nov 2026.