Trying to figure out how to solve this problem. I\'m not quite sure what technique to use / if there is an existing Leetcode problem that this is in.\n```\n/*\nGiven two strings s1 and s2 of same length and each character appears only once in a string. \nFind the maximum sized bag in the substring.\nA Bag = same set of characters that appear together in both strings\n\ns1 = "abcdef" \ns2 =  "apecdq" \n\nIn this example,\nfunction maxBag(s1, s2) should return 3 because "cde" and "ecd" is the largest bag of size 3\n\n */\n```\n\nApparently there are various ways to do this, DP, Sliding Window.

Trying to figure out how to solve this problem. I\'m not quite sure what technique to use / if there is an existing Leetcode problem that this is in.\n\n/*\nGiv