How to use dynamic programming for a backtracking problem

Question

I am solving this problem:

Given an array of strings arr. String s is a concatenation of a sub-sequence of arr which have unique characters. Return the maxim