Questions: given you are a consultanct who need to travel to two cities and need to get most profit. given two array of Integer, CityA and CityB where CityA(i) -> is earnings of consultant on day i, see what path consultant should take to get maximum earningas.\n\nif Consultant is travelling from city A to city B -> earnings =0\nyou can start from either CityA or CityB\n\nexam: \nCityA : [23,4,5,10}\nCityB : [21,1,10,100]\n\nanswer: "ATBB"\n\nSimilar to : https://leetcode.com/discuss/interview-question/762690/google-telephone-interview-coding-question

Questions: given you are a consultanct who need to travel to two cities and need to get most profit. given two array of Integer, CityA and CityB where CityA(i) 