Recursive Function to find the length of longest subset from given array of strings with at most A 0 s and B 1 s
int solve ( vector < string > vec , int A , int B , int idx , vector < vector < vector < int > > > & dp ) {