question
stringlengths 142
9.56k
| solutions
stringlengths 2
867k
| starter_code
stringlengths 0
1.47k
| input_output
stringlengths 29
74M
| difficulty
stringclasses 5
values | raw_tags
stringlengths 2
276
| name
stringclasses 503
values | source
stringclasses 9
values | tags
stringlengths 2
171
| skill_types
stringclasses 114
values | url
stringlengths 36
165
⌀ | Expected Auxiliary Space
stringclasses 179
values | time_limit
stringclasses 57
values | date
stringclasses 638
values | picture_num
stringclasses 7
values | memory_limit
stringclasses 12
values | Expected Time Complexity
stringclasses 337
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Given a string 's'. The task is to find the smallest window length that contains all the characters of the given string at least one time.
For eg. A = aabcbcdbca, then the result would be 4 as of the smallest window will be dbca.
Example 1:
Input : "AABBBCBBAC"
Output : 3
Explanation : Sub-string -> "BAC"
Example 2:
Input : "aaab"
Output : 2
Explanation : Sub-string -> "ab"
Example 3:
Input : "GEEKSGEEKSFOR"
Output : 8
Explanation : Sub-string -> "GEEKSFOR"
Your Task:
You don't need to read input or print anything. Your task is to complete the function findSubString() which takes the string S as input and returns the length of the smallest such window of the string.
Expected Time Complexity: O(256.N)
Expected Auxiliary Space: O(256)
Constraints:
1 ≤ |S| ≤ 10^{5}
String may contain both type of English Alphabets.
|
["class Solution:\n\n\tdef findSubString(self, str):\n\t\tdict = {}\n\t\tans = float('inf')\n\t\tj = 0\n\t\tfor i in str:\n\t\t\tif i not in dict:\n\t\t\t\tdict[i] = 0\n\t\tlength = len(dict)\n\t\tfor i in range(len(str)):\n\t\t\tdict[str[i]] += 1\n\t\t\tif dict[str[i]] == 1:\n\t\t\t\tlength -= 1\n\t\t\twhile length == 0:\n\t\t\t\tans = min(ans, i - j + 1)\n\t\t\t\tdict[str[j]] -= 1\n\t\t\t\tif dict[str[j]] == 0:\n\t\t\t\t\tlength += 1\n\t\t\t\tj += 1\n\t\treturn ans\n", "from collections import defaultdict\n\nclass Solution:\n\n\tdef findSubString(self, s):\n\t\tn = len(s)\n\t\tdist_count = len(set([x for x in s]))\n\t\tm = defaultdict(int)\n\t\tstart = 0\n\t\tmin_len = float('inf')\n\t\tcount = 0\n\t\tfor j in range(n):\n\t\t\tm[s[j]] += 1\n\t\t\tif m[s[j]] == 1:\n\t\t\t\tcount += 1\n\t\t\tif count == dist_count:\n\t\t\t\twhile m[s[start]] > 1:\n\t\t\t\t\tif m[s[start]] > 1:\n\t\t\t\t\t\tm[s[start]] -= 1\n\t\t\t\t\tstart += 1\n\t\t\t\tlen_window = j - start + 1\n\t\t\t\tif min_len > len_window:\n\t\t\t\t\tmin_len = len_window\n\t\treturn min_len\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tfrom collections import defaultdict\n\t\tn = len(str)\n\t\tif n <= 1:\n\t\t\treturn 1\n\t\tdist_count = len(set([x for x in str]))\n\t\tcurr_count = defaultdict(lambda : 0)\n\t\tcount = 0\n\t\tstart = 0\n\t\tmin_len = n\n\t\tfor j in range(n):\n\t\t\tcurr_count[str[j]] += 1\n\t\t\tif curr_count[str[j]] == 1:\n\t\t\t\tcount += 1\n\t\t\tif count == dist_count:\n\t\t\t\twhile curr_count[str[start]] > 1:\n\t\t\t\t\tif curr_count[str[start]] > 1:\n\t\t\t\t\t\tcurr_count[str[start]] -= 1\n\t\t\t\t\tstart += 1\n\t\t\t\tlen_window = j - start + 1\n\t\t\t\tmin_len = min(min_len, len_window)\n\t\t\t\tstart_index = start\n\t\treturn min_len\n", "class Solution:\n\n\tdef findSubString(self, s):\n\t\tD = {}\n\t\tfor i in s:\n\t\t\tif i in D:\n\t\t\t\tpass\n\t\t\telse:\n\t\t\t\tD[i] = 1\n\t\tn = len(s)\n\t\t(i, j) = (0, 0)\n\t\tcount = len(D)\n\t\tmini = 9999\n\t\twhile j < n:\n\t\t\tif s[j] in D:\n\t\t\t\tD[s[j]] -= 1\n\t\t\t\tif D[s[j]] == 0:\n\t\t\t\t\tcount -= 1\n\t\t\twhile count == 0:\n\t\t\t\tmini = min(mini, j - i + 1)\n\t\t\t\tif s[i] in D:\n\t\t\t\t\tD[s[i]] += 1\n\t\t\t\t\tif D[s[i]] > 0:\n\t\t\t\t\t\tcount += 1\n\t\t\t\ti += 1\n\t\t\tj += 1\n\t\treturn mini\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tmp = {}\n\t\tcnt = 0\n\t\tfor i in range(len(str)):\n\t\t\tif str[i] not in mp:\n\t\t\t\tmp[str[i]] = 0\n\t\t\t\tcnt += 1\n\t\tcnt1 = 0\n\t\tj = 0\n\t\tmn = len(str)\n\t\tfor i in range(len(str)):\n\t\t\tif mp[str[i]] == 0:\n\t\t\t\tmp[str[i]] += 1\n\t\t\t\tcnt1 += 1\n\t\t\telse:\n\t\t\t\tmp[str[i]] += 1\n\t\t\twhile cnt == cnt1:\n\t\t\t\tmn = min(mn, i - j + 1)\n\t\t\t\tif mp[str[j]] == 1:\n\t\t\t\t\tmp[str[j]] -= 1\n\t\t\t\t\tcnt1 -= 1\n\t\t\t\t\tj = j + 1\n\t\t\t\telse:\n\t\t\t\t\tmp[str[j]] -= 1\n\t\t\t\t\tj = j + 1\n\t\treturn mn\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tdict = {}\n\t\ta = 1000000000.0\n\t\tj = 0\n\t\tfor i in str:\n\t\t\tif i not in dict:\n\t\t\t\tdict[i] = 0\n\t\tl = len(dict)\n\t\tfor i in range(len(str)):\n\t\t\tdict[str[i]] += 1\n\t\t\tif dict[str[i]] == 1:\n\t\t\t\tl -= 1\n\t\t\twhile l == 0:\n\t\t\t\ta = min(a, i - j + 1)\n\t\t\t\tdict[str[j]] -= 1\n\t\t\t\tif dict[str[j]] == 0:\n\t\t\t\t\tl += 1\n\t\t\t\tj += 1\n\t\treturn a\n", "class Solution:\n\n\tdef findSubString(self, s):\n\t\tdistinct = len(set(s))\n\t\td = dict()\n\t\tsi = -1\n\t\tLen = 100000.0\n\t\tstart = 0\n\t\tfor i in range(len(s)):\n\t\t\tif s[i] not in d:\n\t\t\t\td[s[i]] = 1\n\t\t\telse:\n\t\t\t\td[s[i]] += 1\n\t\t\tif len(d) == distinct:\n\t\t\t\twhile d[s[start]] > 1:\n\t\t\t\t\td[s[start]] -= 1\n\t\t\t\t\tstart += 1\n\t\t\t\tclen = i - start + 1\n\t\t\t\tif Len > clen:\n\t\t\t\t\tLen = clen\n\t\t\t\t\tsi = start\n\t\treturn len(s[si:si + Len])\n", "from collections import defaultdict\n\nclass Solution:\n\n\tdef findSubString(self, str):\n\t\tleng = len(str)\n\t\t(start, end) = (0, leng - 1)\n\t\tct = 0\n\t\tt_dist = len(set([e for e in str]))\n\t\tchr_map = defaultdict(lambda : 0)\n\t\tmin_wind = leng\n\t\tfor i in range(leng):\n\t\t\tx = str[i]\n\t\t\tchr_map[x] += 1\n\t\t\tif chr_map[x] == 1:\n\t\t\t\tct += 1\n\t\t\tif ct == t_dist:\n\t\t\t\twhile chr_map[str[start]] > 1:\n\t\t\t\t\tchr_map[str[start]] -= 1\n\t\t\t\t\tstart += 1\n\t\t\t\tmin_wind = min(i - start + 1, min_wind)\n\t\treturn min_wind\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tn = len(str)\n\t\t(dic, vic) = ({}, {})\n\t\tfor a in str:\n\t\t\tif a not in dic:\n\t\t\t\tdic[a] = 0\n\t\t\tdic[a] += 1\n\t\t(i, j, ans) = (0, 0, 10000000000)\n\t\twhile j < n:\n\t\t\tif str[j] not in vic:\n\t\t\t\tvic[str[j]] = 0\n\t\t\tvic[str[j]] += 1\n\t\t\tif len(vic) == len(dic):\n\t\t\t\twhile len(vic) == len(dic):\n\t\t\t\t\tvic[str[i]] -= 1\n\t\t\t\t\tif vic[str[i]] == 0:\n\t\t\t\t\t\tdel vic[str[i]]\n\t\t\t\t\ti += 1\n\t\t\t\tans = min(ans, 2 + j - i)\n\t\t\tj += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tdict = {}\n\t\tans = 1000000000.0\n\t\tfor i in str:\n\t\t\tif i not in dict:\n\t\t\t\tdict[i] = 0\n\t\tlength = len(dict)\n\t\tcount = 0\n\t\tj = 0\n\t\tfor i in range(len(str)):\n\t\t\tdict[str[i]] += 1\n\t\t\tif dict[str[i]] == 1:\n\t\t\t\tcount += 1\n\t\t\twhile count == length:\n\t\t\t\tans = min(ans, i - j + 1)\n\t\t\t\tdict[str[j]] -= 1\n\t\t\t\tif dict[str[j]] == 0:\n\t\t\t\t\tcount -= 1\n\t\t\t\tj += 1\n\t\treturn ans\n", "from collections import Counter\n\nclass Solution:\n\n\tdef findSubString(self, str1):\n\t\tlength = len(str1)\n\t\tdict1 = Counter(str1)\n\t\tk = len(dict1)\n\t\tdict2 = dict()\n\t\tcount = 0\n\t\tstart = 0\n\t\tminimum = 99999\n\t\tfor i in range(length):\n\t\t\tif count < k:\n\t\t\t\tj = start\n\t\t\t\twhile j < length:\n\t\t\t\t\tif str1[j] not in dict2:\n\t\t\t\t\t\tdict2[str1[j]] = 1\n\t\t\t\t\t\tcount += 1\n\t\t\t\t\telse:\n\t\t\t\t\t\tdict2[str1[j]] += 1\n\t\t\t\t\tif count == k:\n\t\t\t\t\t\tbreak\n\t\t\t\t\tj += 1\n\t\t\tif count == k:\n\t\t\t\tminimum = min(minimum, j - i + 1)\n\t\t\t\tstart = j + 1\n\t\t\tdict2[str1[i]] -= 1\n\t\t\tif dict2[str1[i]] == 0:\n\t\t\t\tdict2.pop(str1[i])\n\t\t\t\tcount -= 1\n\t\treturn minimum\n", "from collections import Counter, defaultdict\n\nclass Solution:\n\n\tdef findSubString(self, str_):\n\t\tset_of_string = set()\n\t\tlen_set_of_string = len(set(str_))\n\t\tanswer = float('inf')\n\t\tleft = 0\n\t\tright = 0\n\t\tfreq = defaultdict(int)\n\t\twhile right < len(str_):\n\t\t\tfreq[str_[right]] += 1\n\t\t\twhile left <= right and len(freq) == len_set_of_string:\n\t\t\t\tanswer = min(answer, right - left + 1)\n\t\t\t\tfreq[str_[left]] -= 1\n\t\t\t\tif freq[str_[left]] == 0:\n\t\t\t\t\tdel freq[str_[left]]\n\t\t\t\tleft += 1\n\t\t\tright += 1\n\t\treturn answer\n", "class Solution:\n\n\tdef findSubString(self, a):\n\t\tdict = {}\n\t\tn = len(set(a))\n\t\tleft = 0\n\t\tright = 0\n\t\tans = len(a)\n\t\twhile right < len(a):\n\t\t\tif a[right] not in dict:\n\t\t\t\tdict[a[right]] = 1\n\t\t\telse:\n\t\t\t\tdict[a[right]] += 1\n\t\t\tif len(dict) == n:\n\t\t\t\twhile dict[a[left]] > 1:\n\t\t\t\t\tdict[a[left]] -= 1\n\t\t\t\t\tleft += 1\n\t\t\t\tans = min(ans, right - left + 1)\n\t\t\tright += 1\n\t\treturn ans\n", "import math\n\nclass Solution:\n\n\tdef findSubString(self, s):\n\t\tdicti = {}\n\t\tmini = math.inf\n\t\tk = len(set(s))\n\t\tn = len(s)\n\t\t(i, j) = (0, 0)\n\t\twhile j < n:\n\t\t\tif s[j] not in dicti:\n\t\t\t\tdicti[s[j]] = 1\n\t\t\telse:\n\t\t\t\tdicti[s[j]] += 1\n\t\t\tif len(dicti) < k:\n\t\t\t\tj += 1\n\t\t\telif len(dicti) == k:\n\t\t\t\twhile len(dicti) == k:\n\t\t\t\t\tmini = min(mini, j - i + 1)\n\t\t\t\t\tif s[i] in dicti:\n\t\t\t\t\t\tdicti[s[i]] -= 1\n\t\t\t\t\t\tif dicti[s[i]] == 0:\n\t\t\t\t\t\t\tdel dicti[s[i]]\n\t\t\t\t\ti += 1\n\t\t\t\tj += 1\n\t\treturn mini\n", "from collections import defaultdict\n\nclass Solution:\n\n\tdef findSubString(self, arr):\n\t\tdic = defaultdict(lambda : 0)\n\t\ti = 0\n\t\tj = 0\n\t\tn = len(set(arr))\n\t\tans = len(arr)\n\t\twhile j < len(arr):\n\t\t\tdic[arr[j]] += 1\n\t\t\tif len(dic) < n:\n\t\t\t\tj += 1\n\t\t\tif len(dic) == n:\n\t\t\t\twhile dic[arr[i]] > 1:\n\t\t\t\t\tdic[arr[i]] -= 1\n\t\t\t\t\ti += 1\n\t\t\t\tans = min(ans, j - i + 1)\n\t\t\t\tj += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\td = {}\n\t\tfor i in str:\n\t\t\td[i] = 0\n\t\ti = 0\n\t\tj = 0\n\t\tans = len(str)\n\t\tcount = len(d)\n\t\ttemp = 0\n\t\twhile j < len(str):\n\t\t\twhile temp < count and j < len(str):\n\t\t\t\tif d[str[j]] == 0:\n\t\t\t\t\ttemp += 1\n\t\t\t\td[str[j]] += 1\n\t\t\t\tj += 1\n\t\t\twhile temp >= count:\n\t\t\t\td[str[i]] -= 1\n\t\t\t\tif d[str[i]] == 0:\n\t\t\t\t\ttemp -= 1\n\t\t\t\ti += 1\n\t\t\tans = min(ans, j - i + 1)\n\t\treturn ans\n", "from collections import deque\n\nclass Solution:\n\n\tdef findSubString(self, stre):\n\t\ts = set(stre)\n\t\tset_len = len(s)\n\t\tj = 0\n\t\tminlen = 1000000000.0\n\t\tmp = {}\n\t\tn = len(stre)\n\t\tfor i in range(n):\n\t\t\tif stre[i] not in mp:\n\t\t\t\tmp[stre[i]] = 1\n\t\t\telse:\n\t\t\t\tmp[stre[i]] += 1\n\t\t\twhile j <= i and len(mp) == set_len:\n\t\t\t\tif minlen > i - j + 1:\n\t\t\t\t\tminlen = i - j + 1\n\t\t\t\tmp[stre[j]] -= 1\n\t\t\t\tif mp[stre[j]] == 0:\n\t\t\t\t\tdel mp[stre[j]]\n\t\t\t\tj += 1\n\t\treturn minlen\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tm = {}\n\t\tn = len(set(str))\n\t\tlength = float('inf')\n\t\tj = 0\n\t\tfor i in range(len(str)):\n\t\t\tm[str[i]] = m.get(str[i], 0) + 1\n\t\t\tif len(m) == n:\n\t\t\t\twhile m[str[j]] > 1:\n\t\t\t\t\tm[str[j]] -= 1\n\t\t\t\t\tj += 1\n\t\t\t\tlength = min(length, i - j + 1)\n\t\treturn length\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tdict = {}\n\t\tans = 1000000000.0\n\t\tfor i in str:\n\t\t\tif i not in dict:\n\t\t\t\tdict[i] = 1\n\t\tdict2 = {}\n\t\tj = 0\n\t\tfor i in range(len(str)):\n\t\t\tif str[i] not in dict2:\n\t\t\t\tdict2[str[i]] = 1\n\t\t\telse:\n\t\t\t\tdict2[str[i]] += 1\n\t\t\twhile len(dict) == len(dict2):\n\t\t\t\tans = min(ans, i - j + 1)\n\t\t\t\tif dict2[str[j]] > 1:\n\t\t\t\t\tdict2[str[j]] -= 1\n\t\t\t\telif dict2[str[j]] == 1:\n\t\t\t\t\tdict2.pop(str[j])\n\t\t\t\tj += 1\n\t\treturn ans\n", "from collections import defaultdict\n\nclass Solution:\n\n\tdef findSubString(self, s):\n\t\ta = set(s)\n\t\ti = 0\n\t\tt = {}\n\t\tmin_len = float('inf')\n\t\tfor j in range(len(s)):\n\t\t\tif s[j] not in t:\n\t\t\t\tt[s[j]] = 0\n\t\t\tt[s[j]] += 1\n\t\t\twhile len(t) == len(a):\n\t\t\t\tmin_len = min(min_len, j - i + 1)\n\t\t\t\tt[s[i]] -= 1\n\t\t\t\tif t[s[i]] == 0:\n\t\t\t\t\tdel t[s[i]]\n\t\t\t\ti += 1\n\t\treturn min_len\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tfrom collections import defaultdict\n\t\tcurr_count = defaultdict(lambda : 0)\n\t\tdist_count = len(set([x for x in str]))\n\t\tif len(str) <= 1:\n\t\t\treturn 1\n\t\tcounter = 0\n\t\tstart = 0\n\t\tmin_len = len(str)\n\t\tfor i in range(len(str)):\n\t\t\tcurr_count[str[i]] += 1\n\t\t\tif curr_count[str[i]] == 1:\n\t\t\t\tcounter += 1\n\t\t\tif counter == dist_count:\n\t\t\t\twhile curr_count[str[start]] > 1:\n\t\t\t\t\tif curr_count[str[start]] > 1:\n\t\t\t\t\t\tcurr_count[str[start]] -= 1\n\t\t\t\t\tstart += 1\n\t\t\t\twindow_len = i - start + 1\n\t\t\t\tif window_len < min_len:\n\t\t\t\t\tmin_len = window_len\n\t\t\t\t\tstart_index = start\n\t\ta = min_len\n\t\treturn a\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\td = {}\n\t\tfor i in str:\n\t\t\tif i not in d:\n\t\t\t\td[i] = 0\n\t\t(i, j) = (0, float('inf'))\n\t\t(count, out) = (0, float('inf'))\n\t\tfor j in range(len(str)):\n\t\t\tif d[str[j]] == 0:\n\t\t\t\tcount += 1\n\t\t\td[str[j]] += 1\n\t\t\tif count == len(d):\n\t\t\t\twhile i < j:\n\t\t\t\t\td[str[i]] -= 1\n\t\t\t\t\tif d[str[i]] == 0:\n\t\t\t\t\t\tout = min(out, j - i + 1)\n\t\t\t\t\t\tcount -= 1\n\t\t\t\t\t\ti += 1\n\t\t\t\t\t\tbreak\n\t\t\t\t\ti += 1\n\t\treturn out if out != float('inf') else 1\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tk = len(set(str))\n\t\tmemo = {}\n\t\tans = len(str)\n\t\t(i, j) = (0, 0)\n\t\twhile j < len(str):\n\t\t\tmemo[str[j]] = memo.get(str[j], 0) + 1\n\t\t\tif len(memo) < k:\n\t\t\t\tj += 1\n\t\t\telif len(memo) == k:\n\t\t\t\twhile len(memo) == k:\n\t\t\t\t\tmemo[str[i]] -= 1\n\t\t\t\t\tif memo[str[i]] == 0:\n\t\t\t\t\t\tdel memo[str[i]]\n\t\t\t\t\ti += 1\n\t\t\t\tans = min(ans, j - i + 2)\n\t\t\t\tj += 1\n\t\t\telif len(memo) > k:\n\t\t\t\twhile len(memo) > k:\n\t\t\t\t\tmemo[str[i]] -= 1\n\t\t\t\t\tif memo[str[i]] == 0:\n\t\t\t\t\t\tdel memo[str[i]]\n\t\t\t\t\ti += 1\n\t\t\t\tj += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tres = 100000\n\t\td = {}\n\t\tfor i in range(len(str)):\n\t\t\tif str[i] not in d:\n\t\t\t\td[str[i]] = 0\n\t\ts1 = set()\n\t\tcount = len(d)\n\t\tl = 0\n\t\tfor i in range(len(str)):\n\t\t\ts1.add(str[i])\n\t\t\td[str[i]] = d[str[i]] + 1\n\t\t\twhile count == len(s1) and d[str[l]] != 0:\n\t\t\t\td[str[l]] = d[str[l]] - 1\n\t\t\t\tif d[str[l]] == 0:\n\t\t\t\t\ts1.remove(str[l])\n\t\t\t\t\tres = min(res, i - l + 1)\n\t\t\t\tl = l + 1\n\t\treturn res\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tans = len(str)\n\t\tN = len(str)\n\t\tn = len(set(str))\n\t\t(i, j) = (0, 0)\n\t\td = {}\n\t\twhile i < N:\n\t\t\tif str[i] not in d:\n\t\t\t\td[str[i]] = 1\n\t\t\telse:\n\t\t\t\td[str[i]] += 1\n\t\t\tif len(d) == n:\n\t\t\t\twhile d[str[j]] > 1:\n\t\t\t\t\td[str[j]] -= 1\n\t\t\t\t\tj += 1\n\t\t\t\tans = min(ans, i - j + 1)\n\t\t\ti += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, s):\n\t\tfreq = {}\n\t\tfor c in s:\n\t\t\tfreq[c] = 0\n\t\tunique_chars = len(freq)\n\t\tleft = 0\n\t\tright = 0\n\t\tcount = 0\n\t\tmin_length = float('inf')\n\t\twhile right < len(s):\n\t\t\tif s[right] in freq:\n\t\t\t\tfreq[s[right]] += 1\n\t\t\t\tif freq[s[right]] == 1:\n\t\t\t\t\tcount += 1\n\t\t\tright += 1\n\t\t\twhile count == unique_chars:\n\t\t\t\tif right - left < min_length:\n\t\t\t\t\tmin_length = right - left\n\t\t\t\tif s[left] in freq:\n\t\t\t\t\tfreq[s[left]] -= 1\n\t\t\t\t\tif freq[s[left]] == 0:\n\t\t\t\t\t\tcount -= 1\n\t\t\t\tleft += 1\n\t\treturn min_length\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\td = {}\n\t\tfor i in str:\n\t\t\tif i not in d:\n\t\t\t\td[i] = 0\n\t\tx = len(d)\n\t\tans = 999999\n\t\ti = 0\n\t\tj = 0\n\t\tc = 0\n\t\twhile i < len(str):\n\t\t\tif d[str[i]] == 0:\n\t\t\t\tc += 1\n\t\t\td[str[i]] += 1\n\t\t\tif c == x:\n\t\t\t\tf = True\n\t\t\t\twhile c == x:\n\t\t\t\t\tans = min(ans, i - j + 1)\n\t\t\t\t\td[str[j]] -= 1\n\t\t\t\t\tif d[str[j]] == 0:\n\t\t\t\t\t\tc -= 1\n\t\t\t\t\tj += 1\n\t\t\ti += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\treslen = len(str)\n\t\ts = set()\n\t\td = dict()\n\t\tfor i in range(len(str)):\n\t\t\ts.add(str[i])\n\t\ti = 0\n\t\tcount = 0\n\t\tfor j in range(len(str)):\n\t\t\td[str[j]] = d.get(str[j], 0) + 1\n\t\t\tif d[str[j]] == 1:\n\t\t\t\tcount += 1\n\t\t\tif count == len(s):\n\t\t\t\twhile d[str[i]] > 1:\n\t\t\t\t\tif d[str[i]] > 1:\n\t\t\t\t\t\td[str[i]] -= 1\n\t\t\t\t\ti += 1\n\t\t\t\tif reslen > j - i + 1:\n\t\t\t\t\treslen = j - i + 1\n\t\treturn reslen\n", "from collections import defaultdict\n\nclass Solution:\n\n\tdef findSubString(self, strr):\n\t\tn = len(strr)\n\t\tdist_count = len(set([x for x in strr]))\n\t\tif n == dist_count:\n\t\t\treturn n\n\t\tcurr_count = dict()\n\t\tcount = 0\n\t\tstart = 0\n\t\tmin_len = n\n\t\tfor i in range(n):\n\t\t\tcurr_count[strr[i]] = curr_count.get(strr[i], 0) + 1\n\t\t\tif curr_count[strr[i]] == 1:\n\t\t\t\tcount += 1\n\t\t\tif count == dist_count:\n\t\t\t\twhile curr_count[strr[start]] > 1:\n\t\t\t\t\tif curr_count[strr[start]] > 1:\n\t\t\t\t\t\tcurr_count[strr[start]] -= 1\n\t\t\t\t\tstart += 1\n\t\t\t\tif min_len > i - start + 1:\n\t\t\t\t\tmin_len = i - start + 1\n\t\treturn min_len\n", "class Solution:\n\n\tdef findSubString(self, s):\n\t\tn = len(s)\n\t\tres = n\n\t\ti = 0\n\t\tuniq = set(list(s))\n\t\tfound = {}\n\t\tfor j in range(n):\n\t\t\tif s[j] in found:\n\t\t\t\tfound[s[j]] += 1\n\t\t\telse:\n\t\t\t\tfound[s[j]] = 1\n\t\t\twhile i < j:\n\t\t\t\tif found[s[i]] > 1:\n\t\t\t\t\tfound[s[i]] -= 1\n\t\t\t\t\ti += 1\n\t\t\t\telse:\n\t\t\t\t\tbreak\n\t\t\tif len(found) == len(uniq):\n\t\t\t\tres = min(res, j - i + 1)\n\t\treturn res\n", "from collections import defaultdict\n\nclass Solution:\n\n\tdef findSubString(self, s):\n\t\tn = len(s)\n\t\tif n <= 1:\n\t\t\treturn len(s)\n\t\tdis_char = len(set(list(s)))\n\t\tcurr = defaultdict(lambda : 0)\n\t\tcnt = 0\n\t\tminlen = n\n\t\tstart = 0\n\t\tfor j in range(n):\n\t\t\tcurr[s[j]] += 1\n\t\t\tif curr[s[j]] == 1:\n\t\t\t\tcnt += 1\n\t\t\tif cnt == dis_char:\n\t\t\t\twhile curr[s[start]] > 1:\n\t\t\t\t\tcurr[s[start]] -= 1\n\t\t\t\t\tstart += 1\n\t\t\t\tlength = j - start + 1\n\t\t\t\tif length < minlen:\n\t\t\t\t\tminlen = length\n\t\t\t\t\tstartind = start\n\t\treturn minlen\n", "class Solution:\n\n\tdef findSubString(self, S):\n\t\tdistinct_chars = set(S)\n\t\tn = len(S)\n\t\tleft = 0\n\t\tmin_length = n\n\t\tcount = [0] * 256\n\t\tdistinct = 0\n\t\tfor right in range(n):\n\t\t\tcount[ord(S[right])] += 1\n\t\t\tif count[ord(S[right])] == 1:\n\t\t\t\tdistinct += 1\n\t\t\tif distinct == len(distinct_chars):\n\t\t\t\twhile count[ord(S[left])] > 1:\n\t\t\t\t\tcount[ord(S[left])] -= 1\n\t\t\t\t\tleft += 1\n\t\t\t\tmin_length = min(min_length, right - left + 1)\n\t\t\t\tcount[ord(S[left])] -= 1\n\t\t\t\tleft += 1\n\t\t\t\tdistinct -= 1\n\t\treturn min_length\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tmaxi = len(str)\n\t\tsets = set(str)\n\t\ti = 0\n\t\tj = 0\n\t\tm = {}\n\t\twhile i < len(str):\n\t\t\tm[str[i]] = 1 + m.get(str[i], 0)\n\t\t\tif len(m) >= len(sets):\n\t\t\t\twhile m[str[j]] > 1:\n\t\t\t\t\tm[str[j]] -= 1\n\t\t\t\t\tj += 1\n\t\t\t\tmaxi = min(maxi, i - j + 1)\n\t\t\ti += 1\n\t\treturn maxi\n", "class Solution:\n\n\tdef findSubString(self, input_string):\n\t\tstart = 0\n\t\tend = 1\n\t\talphabet_dict = {}\n\t\tdistinct_list = list(set(input_string))\n\t\tfor i in range(0, len(distinct_list)):\n\t\t\talphabet_dict[distinct_list[i]] = 0\n\t\tn = len(distinct_list)\n\t\tcount = 1\n\t\talphabet_dict[input_string[0]] = 1\n\t\tanswer = len(input_string)\n\t\twhile start <= end < len(input_string):\n\t\t\tif count < n:\n\t\t\t\telement = input_string[end]\n\t\t\t\tif alphabet_dict[element] == 0:\n\t\t\t\t\talphabet_dict[element] = 1\n\t\t\t\t\tcount = count + 1\n\t\t\t\telse:\n\t\t\t\t\talphabet_dict[element] = alphabet_dict[element] + 1\n\t\t\t\tend = end + 1\n\t\t\telif count == n:\n\t\t\t\tanswer = min(answer, end - start)\n\t\t\t\telement = input_string[start]\n\t\t\t\tif element in alphabet_dict and alphabet_dict[element] == 1:\n\t\t\t\t\tcount = count - 1\n\t\t\t\talphabet_dict[element] = alphabet_dict[element] - 1\n\t\t\t\tstart = start + 1\n\t\twhile count == n:\n\t\t\tanswer = min(answer, end - start)\n\t\t\telement = input_string[start]\n\t\t\tif element in alphabet_dict and alphabet_dict[element] == 1:\n\t\t\t\tcount = count - 1\n\t\t\talphabet_dict[element] = alphabet_dict[element] - 1\n\t\t\tstart = start + 1\n\t\treturn answer\n", "from collections import Counter\n\nclass Solution:\n\n\tdef findSubString(self, str):\n\t\tdic1 = Counter(str)\n\t\tdic2 = dict()\n\t\t(i, j) = (0, 0)\n\t\tres = 10000000000\n\t\twhile j < len(str):\n\t\t\tif str[j] in dic2:\n\t\t\t\tdic2[str[j]] += 1\n\t\t\telse:\n\t\t\t\tdic2[str[j]] = 1\n\t\t\tif len(dic1) == len(dic2):\n\t\t\t\twhile len(dic1) == len(dic2):\n\t\t\t\t\tres = min(res, j - i + 1)\n\t\t\t\t\tdic2[str[i]] -= 1\n\t\t\t\t\tif dic2[str[i]] == 0:\n\t\t\t\t\t\tdel dic2[str[i]]\n\t\t\t\t\ti += 1\n\t\t\tj += 1\n\t\treturn res\n", "import math\n\nclass Solution:\n\n\tdef findSubString(self, s):\n\t\tfreq = {}\n\t\tfor c in s:\n\t\t\tfreq[c] = 0\n\t\t(b, d, ans) = (0, 0, math.inf)\n\t\tfor (i, c) in enumerate(s):\n\t\t\twhile d == len(freq.keys()):\n\t\t\t\tfreq[s[b]] -= 1\n\t\t\t\tif freq[s[b]] == 0:\n\t\t\t\t\tans = min(ans, i - b)\n\t\t\t\t\td -= 1\n\t\t\t\tb += 1\n\t\t\tfreq[c] += 1\n\t\t\tif freq[c] == 1:\n\t\t\t\td += 1\n\t\twhile d == len(freq.keys()):\n\t\t\tfreq[s[b]] -= 1\n\t\t\tif freq[s[b]] == 0:\n\t\t\t\tans = min(ans, i - b + 1)\n\t\t\t\td -= 1\n\t\t\tb += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tn = len(str)\n\t\tans = 0\n\t\tlength = n\n\t\ts = list(set(str))\n\t\td = dict()\n\t\tcount = 0\n\t\tstart = 0\n\t\tfor i in range(n):\n\t\t\tif str[i] not in d.keys():\n\t\t\t\td[str[i]] = 1\n\t\t\t\tcount += 1\n\t\t\telse:\n\t\t\t\td[str[i]] += 1\n\t\t\tif count == len(s):\n\t\t\t\twhile d[str[start]] > 1:\n\t\t\t\t\td[str[start]] -= 1\n\t\t\t\t\tstart += 1\n\t\t\t\tans = i - start + 1\n\t\t\t\tif length > ans:\n\t\t\t\t\tlength = ans\n\t\treturn length\n", "from collections import defaultdict\n\nclass Solution:\n\n\tdef findSubString(self, s):\n\t\tcontrol = set(s)\n\t\tm = len(control)\n\t\tn = len(s)\n\t\ttest = defaultdict(lambda : 0)\n\t\tmini = float('inf')\n\t\ti = 0\n\t\tfor j in range(n):\n\t\t\twhile len(test) < m and i < n:\n\t\t\t\ttest[s[i]] += 1\n\t\t\t\ti += 1\n\t\t\tif len(test) < m:\n\t\t\t\tbreak\n\t\t\tmini = min(mini, i - j)\n\t\t\ttest[s[j]] -= 1\n\t\t\tif test[s[j]] == 0:\n\t\t\t\tdel test[s[j]]\n\t\treturn mini\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\ti = 0\n\t\tj = 0\n\t\ts = len(set(str))\n\t\tn = len(str)\n\t\tans = n\n\t\tdic = {}\n\t\twhile i < n:\n\t\t\tif str[i] not in dic:\n\t\t\t\tdic[str[i]] = 1\n\t\t\telse:\n\t\t\t\tdic[str[i]] += 1\n\t\t\tif len(dic) == s:\n\t\t\t\twhile dic[str[j]] > 1:\n\t\t\t\t\tdic[str[j]] -= 1\n\t\t\t\t\tj += 1\n\t\t\t\tans = min(ans, i - j + 1)\n\t\t\ti += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, s):\n\t\tn = len(s)\n\t\tdistinct_chars = len(set(s))\n\t\tfreq = [0] * 256\n\t\tleft = 0\n\t\tright = 0\n\t\tcount = 0\n\t\tmin_len = n\n\t\twhile right < n:\n\t\t\tch = ord(s[right])\n\t\t\tif freq[ch] == 0:\n\t\t\t\tcount += 1\n\t\t\tfreq[ch] += 1\n\t\t\tright += 1\n\t\t\twhile count == distinct_chars:\n\t\t\t\tmin_len = min(min_len, right - left)\n\t\t\t\tch = ord(s[left])\n\t\t\t\tfreq[ch] -= 1\n\t\t\t\tif freq[ch] == 0:\n\t\t\t\t\tcount -= 1\n\t\t\t\tleft += 1\n\t\treturn min_len\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tnd = len(set(str))\n\t\ti = 0\n\t\tj = 0\n\t\tres = len(str)\n\t\tdic = {}\n\t\twhile i < len(str):\n\t\t\tif str[i] in dic:\n\t\t\t\tdic[str[i]] = dic[str[i]] + 1\n\t\t\telse:\n\t\t\t\tdic[str[i]] = 1\n\t\t\tif len(dic) == nd:\n\t\t\t\twhile dic[str[j]] > 1:\n\t\t\t\t\tdic[str[j]] = dic[str[j]] - 1\n\t\t\t\t\tj = j + 1\n\t\t\t\tres = min(res, i - j + 1)\n\t\t\ti = i + 1\n\t\treturn res\n", "from collections import Counter\n\nclass Solution:\n\n\tdef findSubString(self, str1):\n\t\tdict1 = dict()\n\t\tcount = 0\n\t\tdistinct = len(Counter(str1))\n\t\tn = len(str1)\n\t\tj = 0\n\t\tminimum = n\n\t\tfor i in range(n):\n\t\t\tif count < distinct:\n\t\t\t\twhile j < n:\n\t\t\t\t\tif str1[j] not in dict1:\n\t\t\t\t\t\tdict1[str1[j]] = 1\n\t\t\t\t\t\tcount += 1\n\t\t\t\t\telse:\n\t\t\t\t\t\tdict1[str1[j]] += 1\n\t\t\t\t\tif count == distinct:\n\t\t\t\t\t\tj += 1\n\t\t\t\t\t\tbreak\n\t\t\t\t\tj += 1\n\t\t\tif count == distinct:\n\t\t\t\tminimum = min(minimum, j - i)\n\t\t\tdict1[str1[i]] -= 1\n\t\t\tif dict1[str1[i]] == 0:\n\t\t\t\tdict1.pop(str1[i])\n\t\t\t\tcount -= 1\n\t\treturn minimum\n", "class Solution:\n\n\tdef findSubString(self, a):\n\t\ts = ''\n\t\ta1 = {}\n\t\tfor i in a:\n\t\t\ta1[i] = 1\n\t\tc1 = len(a1)\n\t\ti = 0\n\t\tj = 0\n\t\ta2 = {}\n\t\tc = 0\n\t\tres = len(a)\n\t\twhile j < len(a):\n\t\t\tif a[j] not in a2:\n\t\t\t\ta2[a[j]] = 0\n\t\t\t\tc += 1\n\t\t\ta2[a[j]] += 1\n\t\t\twhile i <= j and c == c1:\n\t\t\t\tres = min(res, j - i + 1)\n\t\t\t\ta2[a[i]] -= 1\n\t\t\t\tif a2[a[i]] == 0:\n\t\t\t\t\tdel a2[a[i]]\n\t\t\t\t\tc -= 1\n\t\t\t\ti += 1\n\t\t\tj += 1\n\t\treturn res\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tans_len = len(set(str))\n\t\td = {}\n\t\tws = 0\n\t\tans = 10 ** 6\n\t\tfor we in range(0, len(str)):\n\t\t\td[str[we]] = d.get(str[we], 0) + 1\n\t\t\tif len(d) == ans_len:\n\t\t\t\twhile d[str[ws]] > 1:\n\t\t\t\t\td[str[ws]] -= 1\n\t\t\t\t\tws += 1\n\t\t\t\tans = min(ans, we - ws + 1)\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tunique = set(str)\n\t\tres = len(str)\n\t\tj = 0\n\t\tmap = dict()\n\t\tfor i in range(0, len(str)):\n\t\t\tif str[i] in map.keys():\n\t\t\t\tmap[str[i]] += 1\n\t\t\telse:\n\t\t\t\tmap[str[i]] = 1\n\t\t\tif len(unique) == len(map):\n\t\t\t\twhile map[str[j]] > 1:\n\t\t\t\t\tmap[str[j]] -= 1\n\t\t\t\t\tj += 1\n\t\t\t\tres = min(res, i - j + 1)\n\t\treturn res\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tl = len(str)\n\t\ts = set()\n\t\tfor i in range(len(str)):\n\t\t\ts.add(str[i])\n\t\tn = len(s)\n\t\thead = 0\n\t\ttail = 0\n\t\thmap = {}\n\t\tans = l\n\t\twhile head < l:\n\t\t\tif str[head] in hmap:\n\t\t\t\thmap[str[head]] += 1\n\t\t\telse:\n\t\t\t\thmap[str[head]] = 1\n\t\t\tif len(hmap) == n:\n\t\t\t\twhile hmap[str[tail]] > 1:\n\t\t\t\t\thmap[str[tail]] -= 1\n\t\t\t\t\ttail += 1\n\t\t\t\tans = min(ans, head - tail + 1)\n\t\t\thead += 1\n\t\treturn ans\n", "from collections import defaultdict, Counter\nfrom sys import maxsize\n\nclass Solution:\n\n\tdef findSubString(self, str):\n\t\tcnt = Counter(str)\n\t\tcur = defaultdict(int)\n\t\tk = 0\n\t\tans = maxsize\n\t\ti = 0\n\t\tfor (j, ch) in enumerate(str):\n\t\t\tcur[ch] += 1\n\t\t\tif cur[ch] == 1:\n\t\t\t\tk += 1\n\t\t\tif k == len(cnt):\n\t\t\t\twhile i < j:\n\t\t\t\t\tif cur[str[i]] == 1:\n\t\t\t\t\t\tbreak\n\t\t\t\t\tcur[str[i]] -= 1\n\t\t\t\t\ti += 1\n\t\t\t\tans = min(ans, j - i + 1)\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tres = float('inf')\n\t\t(i, j) = (0, 0)\n\t\tmaxLen = len(set(list(str)))\n\t\thashmap = {}\n\t\twhile j < len(str):\n\t\t\tif str[j] not in hashmap:\n\t\t\t\thashmap[str[j]] = 1\n\t\t\telse:\n\t\t\t\thashmap[str[j]] += 1\n\t\t\tj += 1\n\t\t\tif len(hashmap) == maxLen:\n\t\t\t\twhile i < j and hashmap[str[i]] > 1:\n\t\t\t\t\thashmap[str[i]] -= 1\n\t\t\t\t\ti += 1\n\t\t\t\tres = min(res, j - i)\n\t\treturn res\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\td = {}\n\t\tfor ch in str:\n\t\t\tif ch not in d:\n\t\t\t\td[ch] = 1\n\t\tn = len(d)\n\t\td.clear()\n\t\ti = 0\n\t\tj = 0\n\t\tcount = 0\n\t\tmini = len(str)\n\t\twhile j < len(str):\n\t\t\tif str[j] not in d:\n\t\t\t\td[str[j]] = 1\n\t\t\t\tcount = count + 1\n\t\t\telse:\n\t\t\t\td[str[j]] = d[str[j]] + 1\n\t\t\tif count == n:\n\t\t\t\twhile d[str[i]] != 1:\n\t\t\t\t\td[str[i]] = d[str[i]] - 1\n\t\t\t\t\ti = i + 1\n\t\t\t\tmini = min(mini, j - i + 1)\n\t\t\tj = j + 1\n\t\treturn mini\n", "class Solution:\n\n\tdef findSubString(self, s):\n\t\tn = len(s)\n\t\td = {}\n\t\tcount = 0\n\t\tfor i in range(n):\n\t\t\td[s[i]] = 0\n\t\ti = 0\n\t\tj = 0\n\t\tans = n\n\t\twhile i < n:\n\t\t\tif d[s[i]] == 0:\n\t\t\t\tcount += 1\n\t\t\td[s[i]] += 1\n\t\t\tif count == len(d):\n\t\t\t\twhile j < n and d[s[j]] > 1:\n\t\t\t\t\td[s[j]] -= 1\n\t\t\t\t\tj += 1\n\t\t\t\tif ans > i - j + 1:\n\t\t\t\t\tans = i - j + 1\n\t\t\ti += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tp = len(set(str))\n\t\tj = 0\n\t\ti = 0\n\t\td = {}\n\t\tmn = 100000\n\t\twhile j < len(str):\n\t\t\tif str[j] in d:\n\t\t\t\td[str[j]] += 1\n\t\t\telse:\n\t\t\t\td[str[j]] = 1\n\t\t\tif len(d) == p:\n\t\t\t\twhile len(d) == p:\n\t\t\t\t\tmn = min(mn, j - i + 1)\n\t\t\t\t\td[str[i]] -= 1\n\t\t\t\t\tif d[str[i]] == 0:\n\t\t\t\t\t\tdel d[str[i]]\n\t\t\t\t\ti += 1\n\t\t\tj += 1\n\t\treturn mn\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\td = {}\n\t\ti = 0\n\t\tj = 0\n\t\tsw = 100000000\n\t\tn = len(set(str))\n\t\twhile j < len(str):\n\t\t\tif str[j] not in d:\n\t\t\t\td[str[j]] = 1\n\t\t\telse:\n\t\t\t\td[str[j]] += 1\n\t\t\tif len(d) == n:\n\t\t\t\twhile len(d) == n:\n\t\t\t\t\tsw = min(sw, j - i + 1)\n\t\t\t\t\td[str[i]] -= 1\n\t\t\t\t\tif d[str[i]] == 0:\n\t\t\t\t\t\tdel d[str[i]]\n\t\t\t\t\ti += 1\n\t\t\tj += 1\n\t\treturn sw\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\tdict = {}\n\t\tfor i in str:\n\t\t\tif i in dict:\n\t\t\t\tdict[i] += 1\n\t\t\telse:\n\t\t\t\tdict[i] = 1\n\t\tcount = len(list(dict.keys()))\n\t\ti = j = 0\n\t\tans = len(str)\n\t\tc = 0\n\t\tdict = {}\n\t\tfor i in range(len(str)):\n\t\t\tif str[i] in dict:\n\t\t\t\tdict[str[i]] += 1\n\t\t\telse:\n\t\t\t\tdict[str[i]] = 1\n\t\t\t\tc += 1\n\t\t\tif c == count:\n\t\t\t\tans = min(ans, i - j + 1)\n\t\t\t\twhile c == count and j <= i:\n\t\t\t\t\tdict[str[j]] -= 1\n\t\t\t\t\tif dict[str[j]] == 0:\n\t\t\t\t\t\tdel dict[str[j]]\n\t\t\t\t\t\tc -= 1\n\t\t\t\t\tans = min(ans, i - j + 1)\n\t\t\t\t\tj += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef findSubString(self, str):\n\t\ts = set(str)\n\t\tn = len(s)\n\t\tss = set()\n\t\tind = 0\n\t\td = {}\n\t\tmini = 10 ** 9\n\t\tfor i in range(len(str)):\n\t\t\tif str[i] not in ss:\n\t\t\t\tss.add(str[i])\n\t\t\td[str[i]] = d.get(str[i], 0) + 1\n\t\t\tif len(ss) == n:\n\t\t\t\tind = i + 1\n\t\t\t\tmini = min(mini, i + 1)\n\t\t\t\tbreak\n\t\tindex = 0\n\t\twhile d[str[index]] > 1:\n\t\t\td[str[index]] -= 1\n\t\t\tindex += 1\n\t\t\tmini = min(mini, i - index + 1)\n\t\tfor i in range(ind, len(str)):\n\t\t\td[str[i]] = d.get(str[i], 0) + 1\n\t\t\twhile d[str[index]] > 1:\n\t\t\t\td[str[index]] -= 1\n\t\t\t\tindex += 1\n\t\t\t\tmini = min(mini, i - index + 1)\n\t\twhile d[str[index]] > 1:\n\t\t\td[str[index]] -= 1\n\t\t\tindex += 1\n\t\t\tmini = min(mini, i - index + 1)\n\t\treturn mini\n"]
|
#User function Template for python3
class Solution:
def findSubString(self, str):
# Your code goes here
|
{"inputs": ["\"AABBBCBBAC\"", "\"aaab\"", "\"GEEKSGEEKSFOR\""], "outputs": ["3", "2", "8"]}
|
MEDIUM
|
['Algorithms', 'Hash', 'sliding-window', 'Strings', 'Data Structures', 'Arrays']
| null |
geeksforgeeks
|
['String algorithms', 'Data structures', 'Amortized analysis']
|
['Amortized analysis', 'Data structures']
|
https://practice.geeksforgeeks.org/problems/smallest-distant-window3132/1
|
O(256)
| null | null |
0
| null |
O(256.N)
|
Given an array arr[] which contains data of N nodes of Complete Binary tree in level order fashion. The task is to print the level order traversal in sorted order.
Example 1:
Input:
N = 7
arr[] = {7 6 5 4 3 2 1}
Output:
7
5 6
1 2 3 4
Explanation: The formed Binary Tree is:
7
/ \
6 5
/ \ / \
4 3 2 1
Example 2:
Input:
N = 6
arr[] = {5 6 4 9 2 1}
Output:
5
4 6
1 2 9
Explanation: The formed Binary Tree is:
5
/ \
6 4
/ \ /
9 2 1
Your Task:
You don't need to read input or print anything. Your task is to complete the function binTreeSortedLevels() which takes the array arr[] and its size N as inputs and returns a 2D array where the i-th array denotes the nodes of the i-th level in sorted order.
Expected Time Complexity: O(NlogN).
Expected Auxiliary Space: O(N).
Constraints:
1 <= N <= 10^{4}
|
["class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tli = []\n\t\ti = 0\n\t\tlevel = 0\n\t\twhile i < n:\n\t\t\tdumm = []\n\t\t\tif level == 0:\n\t\t\t\tli.append([arr[i]])\n\t\t\t\ti += 1\n\t\t\t\tlevel += 1\n\t\t\telse:\n\t\t\t\tsize = 2 ** level\n\t\t\t\tif i + size < n:\n\t\t\t\t\tdumm.extend(arr[i:i + size])\n\t\t\t\t\tdumm.sort()\n\t\t\t\t\tli.append(dumm)\n\t\t\t\t\ti += size\n\t\t\t\t\tlevel += 1\n\t\t\t\telse:\n\t\t\t\t\tdumm.extend(arr[i:])\n\t\t\t\t\tdumm.sort()\n\t\t\t\t\tli.append(dumm)\n\t\t\t\t\tbreak\n\t\treturn li\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tans = []\n\t\tm = 1\n\t\tlevel = []\n\t\tj = 0\n\t\tfor i in range(n):\n\t\t\tif j < m:\n\t\t\t\tlevel.append(arr[i])\n\t\t\t\tj += 1\n\t\t\telse:\n\t\t\t\tlevel.sort()\n\t\t\t\tans.append(level.copy())\n\t\t\t\tlevel.clear()\n\t\t\t\tm += m\n\t\t\t\tj = 1\n\t\t\t\tlevel.append(arr[i])\n\t\tlevel.sort()\n\t\tans.append(level)\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tres = []\n\t\ti = 0\n\t\tls = 1\n\t\twhile i < n:\n\t\t\tt = (1 << ls) - 1\n\t\t\tt = min(t, n)\n\t\t\ttemp = sorted(arr[i:t])\n\t\t\ti = t\n\t\t\tls += 1\n\t\t\tres.append(temp)\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tres = []\n\t\t(i, total) = (0, 0)\n\t\twhile total < n:\n\t\t\ttemp = []\n\t\t\tfor j in range(2 ** i):\n\t\t\t\tif total < n:\n\t\t\t\t\ttemp.append(arr[total])\n\t\t\t\t\ttotal += 1\n\t\t\t\telse:\n\t\t\t\t\tbreak\n\t\t\ttemp.sort()\n\t\t\tres.append(temp)\n\t\t\ti += 1\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tn = len(arr)\n\t\tlist2 = [[arr[0]]]\n\t\tc = 0\n\t\tj = 1\n\t\tlist3 = []\n\t\tfor x in range(1, n):\n\t\t\tif c == 2 ** j - 1:\n\t\t\t\tlist3.append(arr[x])\n\t\t\t\tlist3.sort()\n\t\t\t\tlist2.append(list3)\n\t\t\t\tlist3 = []\n\t\t\t\tj += 1\n\t\t\t\tc = 0\n\t\t\telse:\n\t\t\t\tlist3.append(arr[x])\n\t\t\t\tc += 1\n\t\tif len(list3) != 0:\n\t\t\tlist3.sort()\n\t\t\tlist2.append(list3)\n\t\treturn list2\n", "from collections import deque\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tdq = deque()\n\t\tdq.append(0)\n\t\tres = []\n\t\twhile len(dq) > 0:\n\t\t\tcurrsize = len(dq)\n\t\t\tt = []\n\t\t\tfor i in range(currsize):\n\t\t\t\ttemp = dq.popleft()\n\t\t\t\tt.append(arr[temp])\n\t\t\t\tif 2 * temp + 1 < n:\n\t\t\t\t\tdq.append(2 * temp + 1)\n\t\t\t\tif 2 * temp + 2 < n:\n\t\t\t\t\tdq.append(2 * temp + 2)\n\t\t\tt.sort()\n\t\t\tres.append(t)\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tfinal = []\n\t\tl = [1]\n\t\tfinal.append([arr[0]])\n\t\ti = 0\n\t\twhile True:\n\t\t\tli = len(l)\n\t\t\tl = []\n\t\t\tfor j in range(li):\n\t\t\t\tif 2 * i + 1 < n:\n\t\t\t\t\tl.append(arr[2 * i + 1])\n\t\t\t\tif 2 * i + 2 < n:\n\t\t\t\t\tl.append(arr[2 * i + 2])\n\t\t\t\ti += 1\n\t\t\tif len(l):\n\t\t\t\tfinal.append(sorted(l))\n\t\t\telse:\n\t\t\t\tbreak\n\t\treturn final\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\toutput = []\n\t\ti = 0\n\t\twhile 2 ** i <= n:\n\t\t\tj = 2 ** i\n\t\t\tk = 2 ** (i + 1)\n\t\t\ti += 1\n\t\t\toutput.append(sorted(arr[j - 1:k - 1]))\n\t\treturn output\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\ta1 = {}\n\t\tqueue = [0]\n\t\tqueue1 = [0]\n\t\twhile len(queue) > 0:\n\t\t\tx = queue.pop(0)\n\t\t\ty = queue1.pop(0)\n\t\t\tif y not in a1:\n\t\t\t\ta1[y] = []\n\t\t\ta1[y].append(arr[x])\n\t\t\tif 2 * x + 1 < len(arr):\n\t\t\t\tqueue.append(2 * x + 1)\n\t\t\t\tqueue1.append(y + 1)\n\t\t\tif 2 * x + 2 < len(arr):\n\t\t\t\tqueue.append(2 * x + 2)\n\t\t\t\tqueue1.append(y + 1)\n\t\te = []\n\t\tfor i in range(max(a1) + 1):\n\t\t\te.append(sorted(a1[i]))\n\t\treturn e\n", "from collections import deque\nfrom sortedcontainers import SortedList\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tq = deque([0])\n\t\tres = []\n\t\twhile q:\n\t\t\tt = SortedList()\n\t\t\tfor _ in range(len(q)):\n\t\t\t\tcur = q.popleft()\n\t\t\t\tt.add(arr[cur])\n\t\t\t\tfor i in [2 * cur + 1, 2 * cur + 2]:\n\t\t\t\t\tif i < len(arr):\n\t\t\t\t\t\tq.append(i)\n\t\t\tres.append(t)\n\t\treturn res\n", "from collections import deque\nfrom heapq import heappush, heappop\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tq = deque([0])\n\t\tres = []\n\t\twhile q:\n\t\t\thp = []\n\t\t\tfor _ in range(len(q)):\n\t\t\t\tcur = q.popleft()\n\t\t\t\theappush(hp, arr[cur])\n\t\t\t\tfor i in [2 * cur + 1, 2 * cur + 2]:\n\t\t\t\t\tif i < len(arr):\n\t\t\t\t\t\tq.append(i)\n\t\t\tt = []\n\t\t\twhile hp:\n\t\t\t\tt.append(heappop(hp))\n\t\t\tres.append(t)\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\t(res, start, end, len1) = ([], 0, 1, 1)\n\t\twhile start < n:\n\t\t\tres.append(sorted(arr[start:end]))\n\t\t\tlen1 *= 2\n\t\t\tstart = end\n\t\t\tend = start + len1\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\ti = 1\n\t\tans = []\n\t\twhile len(arr):\n\t\t\tans.append(sorted(arr[:i]))\n\t\t\tarr = arr[i:]\n\t\t\ti <<= 1\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\ti = 0\n\t\tk = 1\n\t\tres = []\n\t\twhile i < n:\n\t\t\ttemp = arr[i:i + k]\n\t\t\ttemp.sort()\n\t\t\tres.append(temp)\n\t\t\ti += k\n\t\t\tk *= 2\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\t_list = []\n\t\ta = 1\n\t\tcurr = 0\n\t\twhile curr < n:\n\t\t\t_list.append(sorted(arr[curr:curr + a]))\n\t\t\tcurr += a\n\t\t\ta *= 2\n\t\treturn _list\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tif n == 1:\n\t\t\treturn [[arr[0]]]\n\t\telse:\n\t\t\tl = [[arr[0]]]\n\t\t\ti = 1\n\t\t\tc = 1\n\t\t\twhile i < n:\n\t\t\t\tsize = 2 ** c\n\t\t\t\tif i + size < n:\n\t\t\t\t\ta = arr[i:i + size]\n\t\t\t\t\ta.sort()\n\t\t\t\t\tl.append(a)\n\t\t\t\t\ti += size\n\t\t\t\t\tc += 1\n\t\t\t\telse:\n\t\t\t\t\ta = arr[i:]\n\t\t\t\t\ta.sort()\n\t\t\t\t\tl.append(a)\n\t\t\t\t\tbreak\n\t\t\treturn l\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tstart = 0\n\t\ti = 0\n\t\tincrement = 2 ** i\n\t\tlist1 = []\n\t\twhile start < n:\n\t\t\tlist1.append(sorted(arr[start:start + increment]))\n\t\t\tstart += increment\n\t\t\ti += 1\n\t\t\tincrement = 2 ** i\n\t\treturn list1\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tres = []\n\t\ti = 0\n\t\tcount = 0\n\t\tlevel = 0\n\t\twhile True:\n\t\t\tcount = 2 ** level\n\t\t\tt = []\n\t\t\twhile count != 0 and i < n:\n\t\t\t\tt.append(arr[i])\n\t\t\t\ti += 1\n\t\t\t\tcount -= 1\n\t\t\tres.append(sorted(t))\n\t\t\tif i >= n:\n\t\t\t\tbreak\n\t\t\tlevel += 1\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tres = []\n\t\tl = 0\n\t\ti = 0\n\t\twhile True:\n\t\t\tcount = int(2 ** l)\n\t\t\ttmp = []\n\t\t\twhile count != 0 and i < n:\n\t\t\t\ttmp.append(arr[i])\n\t\t\t\ti += 1\n\t\t\t\tcount -= 1\n\t\t\tres.append(sorted(tmp))\n\t\t\tif i >= n:\n\t\t\t\tbreak\n\t\t\tl += 1\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\ti = 0\n\t\ta = []\n\t\twhile 2 ** i <= n:\n\t\t\ta.append(sorted(arr[:2 ** i]))\n\t\t\tarr[:] = arr[2 ** i:]\n\t\t\ti = i + 1\n\t\treturn a\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tans = []\n\t\ti = 0\n\t\tlevel = 0\n\t\twhile True:\n\t\t\tcount = int(2 ** level)\n\t\t\ttmp = []\n\t\t\twhile count != 0 and i < n:\n\t\t\t\ttmp.append(arr[i])\n\t\t\t\ti += 1\n\t\t\t\tcount -= 1\n\t\t\tans.append(sorted(tmp))\n\t\t\tif i >= n:\n\t\t\t\tbreak\n\t\t\tlevel += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tfrom math import exp\n\t\tlevel = 0\n\t\tprevLevelEnd = 0\n\t\tout = []\n\t\twhile prevLevelEnd < n:\n\t\t\tnAtLevel = pow(2, level)\n\t\t\tout.append(list(sorted(arr[prevLevelEnd:prevLevelEnd + nAtLevel])))\n\t\t\tprevLevelEnd += nAtLevel\n\t\t\tlevel += 1\n\t\treturn out\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tre = []\n\t\tlevel = 0\n\t\ti = 0\n\t\twhile i < n:\n\t\t\tans = []\n\t\t\tif level == 0:\n\t\t\t\tre.append([arr[i]])\n\t\t\t\ti += 1\n\t\t\t\tlevel += 1\n\t\t\telse:\n\t\t\t\tsize = 2 ** level\n\t\t\t\tif i + size < n:\n\t\t\t\t\tans.extend(arr[i:i + size])\n\t\t\t\t\tans.sort()\n\t\t\t\t\tre.append(ans)\n\t\t\t\t\ti += size\n\t\t\t\t\tlevel += 1\n\t\t\t\telse:\n\t\t\t\t\tans.extend(arr[i:])\n\t\t\t\t\tans.sort()\n\t\t\t\t\tre.append(ans)\n\t\t\t\t\tbreak\n\t\treturn re\n", "import heapq\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tlst = []\n\t\tx = 0\n\t\ty = 1\n\t\twhile True:\n\t\t\tll = []\n\t\t\tfor j in range(x, min(x + y, n)):\n\t\t\t\tll.append(arr[j])\n\t\t\tlst.append(sorted(ll))\n\t\t\tx = x + y\n\t\t\ty = 2 * y\n\t\t\tif x >= n:\n\t\t\t\tbreak\n\t\treturn lst\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, x, n):\n\t\tres = []\n\t\ti = 0\n\t\tj = 1\n\t\twhile i < n:\n\t\t\tres.append(sorted(x[i:i + j]))\n\t\t\ti = i + j\n\t\t\tj = j * 2\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tans = []\n\t\tsi = 0\n\t\tk = 0\n\t\twhile si < n:\n\t\t\tsize = 2 ** k\n\t\t\tk += 1\n\t\t\tif si + size >= n:\n\t\t\t\ttans = arr[si:]\n\t\t\telse:\n\t\t\t\ttans = arr[si:si + size]\n\t\t\ttans.sort()\n\t\t\tans.append(tans)\n\t\t\tsi += size\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tlst = []\n\t\tlevel = 0\n\t\ti = 0\n\t\twhile i < n:\n\t\t\tl = []\n\t\t\tif level == 0:\n\t\t\t\tl.append(arr[i])\n\t\t\t\tlst.append(l)\n\t\t\t\ti = i + 1\n\t\t\t\tlevel = level + 1\n\t\t\telse:\n\t\t\t\tsize = 2 ** level\n\t\t\t\tif i + size < n:\n\t\t\t\t\tl.extend(arr[i:i + size])\n\t\t\t\t\tl.sort()\n\t\t\t\t\tlst.append(l)\n\t\t\t\t\ti = i + size\n\t\t\t\t\tlevel = level + 1\n\t\t\t\telse:\n\t\t\t\t\tl.extend(arr[i:])\n\t\t\t\t\tl.sort()\n\t\t\t\t\tlst.append(l)\n\t\t\t\t\tbreak\n\t\treturn lst\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\ta = [[arr[0]]]\n\t\ti = 1\n\t\twhile i < n:\n\t\t\tb = arr[i:2 * i + 1]\n\t\t\tb.sort()\n\t\t\ta.append(b)\n\t\t\ti = 2 * i + 1\n\t\treturn a\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tc = 0\n\t\ti = 0\n\t\tans = []\n\t\twhile c < n:\n\t\t\tl = []\n\t\t\tx = pow(2, i)\n\t\t\twhile x > 0 and c < n:\n\t\t\t\tl.append(arr[c])\n\t\t\t\tc += 1\n\t\t\t\tx -= 1\n\t\t\ti += 1\n\t\t\tl.sort()\n\t\t\tans.append(l)\n\t\treturn ans\n", "from collections import deque\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tlqc = deque()\n\t\tlqc.append(0)\n\t\tlqn = deque()\n\t\tlsrl = deque()\n\t\trslt = deque()\n\t\twhile len(lqc) > 0:\n\t\t\tidx = lqc.popleft()\n\t\t\tlsrl.append(arr[idx])\n\t\t\tif 2 * idx + 1 < n:\n\t\t\t\tlqn.append(2 * idx + 1)\n\t\t\tif 2 * idx + 2 < n:\n\t\t\t\tlqn.append(2 * idx + 2)\n\t\t\tif len(lqc) == 0:\n\t\t\t\tlqc = lqn.copy()\n\t\t\t\tlqn = deque()\n\t\t\t\tlsrl = list(lsrl)\n\t\t\t\tlsrl.sort()\n\t\t\t\trslt.append(lsrl)\n\t\t\t\tlsrl = deque()\n\t\treturn rslt\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tmm = 0\n\t\tx = 0\n\t\tb = []\n\t\tif n == 1:\n\t\t\treturn [arr]\n\t\t\texit()\n\t\twhile x < n:\n\t\t\te = 2 ** mm\n\t\t\tt = []\n\t\t\tfor k in range(e):\n\t\t\t\tif x < n:\n\t\t\t\t\tt.append(arr[x])\n\t\t\t\tx = x + 1\n\t\t\tt.sort()\n\t\t\tmm = mm + 1\n\t\t\tb.append(t)\n\t\treturn b\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\ti = 0\n\t\tc = 0\n\t\tb = []\n\t\twhile i < n:\n\t\t\te = 2 ** c\n\t\t\tk = []\n\t\t\tfor j in range(e):\n\t\t\t\tif i < n:\n\t\t\t\t\tk.append(arr[i])\n\t\t\t\ti += 1\n\t\t\tk.sort()\n\t\t\tc += 1\n\t\t\tb.append(k)\n\t\treturn b\nt = int(input())\nfor tc in range(t):\n\tn = int(input())\n\tarr = list(map(int, input().split()))\n\tob = Solution()\n\tres = ob.binTreeSortedLevels(arr, n)\n\tfor i in range(len(res)):\n\t\tfor j in range(len(res[i])):\n\t\t\tprint(res[i][j], end=' ')\n\t\tprint()\n", "import heapq\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tif len(arr) == 1:\n\t\t\ttemp = []\n\t\t\ttemp.append([arr[0]])\n\t\t\treturn temp\n\t\tif len(arr) == 2:\n\t\t\ttemp = []\n\t\t\ttemp.append([arr[0]])\n\t\t\ttemp.append([arr[1]])\n\t\t\treturn temp\n\t\tq1 = []\n\t\tindex = 0\n\t\tans = []\n\t\tq1.append([arr[0], 0])\n\t\tq2 = []\n\t\tflag = 1\n\t\twhile True:\n\t\t\ttemp = []\n\t\t\tif flag == 1:\n\t\t\t\theapq.heapify(q1)\n\t\t\t\twhile q1:\n\t\t\t\t\tp = heapq.heappop(q1)\n\t\t\t\t\ttemp.append(p[0])\n\t\t\t\t\tif p[1] * 2 + 1 < n:\n\t\t\t\t\t\tq2.append([arr[p[1] * 2 + 1], p[1] * 2 + 1])\n\t\t\t\t\tif p[1] * 2 + 2 < n:\n\t\t\t\t\t\tq2.append([arr[p[1] * 2 + 2], p[1] * 2 + 2])\n\t\t\t\tflag = 0\n\t\t\t\tans.append(temp)\n\t\t\t\tif len(q2) == 0:\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\theapq.heapify(q2)\n\t\t\t\twhile q2:\n\t\t\t\t\tp = heapq.heappop(q2)\n\t\t\t\t\ttemp.append(p[0])\n\t\t\t\t\tif p[1] * 2 + 1 < n:\n\t\t\t\t\t\tq1.append([arr[p[1] * 2 + 1], p[1] * 2 + 1])\n\t\t\t\t\tif p[1] * 2 + 2 < n:\n\t\t\t\t\t\tq1.append([arr[p[1] * 2 + 2], p[1] * 2 + 2])\n\t\t\t\tans.append(temp)\n\t\t\t\tflag = 1\n\t\t\t\tif len(q1) == 0:\n\t\t\t\t\tbreak\n\t\treturn ans\nt = int(input())\nfor tc in range(t):\n\tn = int(input())\n\tarr = list(map(int, input().split()))\n\tob = Solution()\n\tres = ob.binTreeSortedLevels(arr, n)\n\tfor i in range(len(res)):\n\t\tfor j in range(len(res[i])):\n\t\t\tprint(res[i][j], end=' ')\n\t\tprint()\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\ta = []\n\t\ti = p = 0\n\t\twhile i < len(arr):\n\t\t\ta.append(sorted(arr[i:i + 2 ** p]))\n\t\t\ti += 2 ** p\n\t\t\tp += 1\n\t\treturn a\nt = int(input())\nfor tc in range(t):\n\tn = int(input())\n\tarr = list(map(int, input().split()))\n\tob = Solution()\n\tres = ob.binTreeSortedLevels(arr, n)\n\tfor i in range(len(res)):\n\t\tfor j in range(len(res[i])):\n\t\t\tprint(res[i][j], end=' ')\n\t\tprint()\n", "from collections import defaultdict\nimport queue\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tq = queue.deque()\n\t\tdic = defaultdict(list)\n\t\tq.append([arr[0], 0, 0])\n\t\twhile q:\n\t\t\tele = q.popleft()\n\t\t\tdic[ele[1]].append(ele[0])\n\t\t\tval = 2 * ele[2]\n\t\t\tif val + 1 < n:\n\t\t\t\tq.append([arr[val + 1], ele[1] + 1, val + 1])\n\t\t\tif val + 2 < n:\n\t\t\t\tq.append([arr[val + 2], ele[1] + 1, val + 2])\n\t\tfor i in dic:\n\t\t\tdic[i].sort()\n\t\treturn dic\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tl = 0\n\t\tel = 1\n\t\tr = l + el\n\t\tans = []\n\t\twhile r <= len(arr):\n\t\t\tbrr = arr[l:r]\n\t\t\tbrr.sort()\n\t\t\tans.append(brr)\n\t\t\tel *= 2\n\t\t\tif r < len(arr):\n\t\t\t\tl = r\n\t\t\t\tif l + el <= len(arr):\n\t\t\t\t\tr = l + el\n\t\t\t\telse:\n\t\t\t\t\tr = len(arr)\n\t\t\telif r == len(arr):\n\t\t\t\tbreak\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tif not arr:\n\t\t\treturn\n\t\tres = [[arr[0]]]\n\t\tlevel = 1\n\t\ti = 1\n\t\tl = len(arr)\n\t\twhile i < l:\n\t\t\ttmp = []\n\t\t\tj = 0\n\t\t\twhile i < l and j < 2 ** level:\n\t\t\t\ttmp.append(arr[i])\n\t\t\t\ti += 1\n\t\t\t\tj += 1\n\t\t\tlevel += 1\n\t\t\ttmp.sort()\n\t\t\tres.append(tmp)\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tind = 0\n\t\tans = []\n\t\tq = [arr[ind]]\n\t\twhile q:\n\t\t\tb = sorted(q)\n\t\t\tans.append(b)\n\t\t\tnn = len(q)\n\t\t\tfor i in range(nn):\n\t\t\t\tp = q.pop(0)\n\t\t\t\tif ind + 1 < n:\n\t\t\t\t\tq.append(arr[ind + 1])\n\t\t\t\tif ind + 2 < n:\n\t\t\t\t\tq.append(arr[ind + 2])\n\t\t\t\tind += 2\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tlvl = -1\n\t\tans = []\n\t\twhile len(arr) > 0:\n\t\t\tlvl += 1\n\t\t\ts = pow(2, lvl)\n\t\t\tif s > len(arr):\n\t\t\t\ts = len(arr)\n\t\t\tarr[0:s].sort()\n\t\t\tans.append([])\n\t\t\twhile s > 0:\n\t\t\t\tans[lvl].append(arr.pop(0))\n\t\t\t\ts -= 1\n\t\t\tfor i in range(lvl + 1):\n\t\t\t\tans[i].sort()\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tj = 0\n\t\tl = []\n\t\twhile j < n:\n\t\t\ti = 2 * j + 1\n\t\t\tl1 = arr[j:i]\n\t\t\tl1.sort()\n\t\t\tl.append(l1)\n\t\t\tj = i\n\t\treturn l\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tc = 0\n\t\tp = 0\n\t\tl = []\n\t\twhile p < n:\n\t\t\ts = 2 ** c\n\t\t\tk = arr[p:p + s]\n\t\t\tc = c + 1\n\t\t\tp = p + s\n\t\t\tk.sort()\n\t\t\tl.append(k)\n\t\treturn l\n", "from collections import deque\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\t(i, j, k) = (0, 0, 0)\n\t\tans = []\n\t\twhile j < n:\n\t\t\tst = []\n\t\t\ti = 2 ** k\n\t\t\twhile i > 0 and j < n:\n\t\t\t\tst.append(arr[j])\n\t\t\t\tj += 1\n\t\t\t\ti -= 1\n\t\t\tans.append(sorted(st))\n\t\t\tk += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, l, n):\n\t\tstart = 0\n\t\tend = 0\n\t\tcount = 0\n\t\tresult_list = []\n\t\twhile True:\n\t\t\tend = 2 ** count\n\t\t\tif end > len(l):\n\t\t\t\tbreak\n\t\t\tresult_list.append(sorted(l[start:end + start]))\n\t\t\tcount += 1\n\t\t\tstart += end\n\t\treturn result_list\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tans = []\n\t\tif n == 0:\n\t\t\treturn ans\n\t\tsize = 1\n\t\tstart = 0\n\t\twhile True:\n\t\t\tif start + size > n:\n\t\t\t\tlevel = arr[start:n]\n\t\t\t\tif level:\n\t\t\t\t\tans.append(sorted(level))\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tlevel = arr[start:start + size]\n\t\t\t\tans.append(sorted(level))\n\t\t\t\tstart += size\n\t\t\t\tsize *= 2\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tif n == 0:\n\t\t\treturn []\n\t\tans = [[arr[0]]]\n\t\tl = 0\n\t\tr = 1\n\t\twhile r < n:\n\t\t\tl = min(l * 2 + 1, n - 1)\n\t\t\tr = min(r * 2 + 1, n)\n\t\t\tans.append(sorted(arr[l:r]))\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tcurr = 1\n\t\ti = 0\n\t\tj = 0\n\t\tfinal_ans = []\n\t\tans = []\n\t\twhile i < n:\n\t\t\tans.append(arr[i])\n\t\t\ti += 1\n\t\t\tj += 1\n\t\t\tif j == curr:\n\t\t\t\tj = 0\n\t\t\t\tcurr *= 2\n\t\t\t\tans.sort()\n\t\t\t\tfinal_ans.append(ans)\n\t\t\t\tans = []\n\t\tif len(ans):\n\t\t\tans.sort()\n\t\t\tfinal_ans.append(ans)\n\t\treturn final_ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tif not arr:\n\t\t\treturn []\n\t\tres = []\n\t\tq = [arr[0]]\n\t\tpointer = 1\n\t\twhile q:\n\t\t\ttempQ = []\n\t\t\tdata = []\n\t\t\twhile q:\n\t\t\t\tdata.append(q.pop(0))\n\t\t\t\tif pointer < len(arr):\n\t\t\t\t\ttempQ.append(arr[pointer])\n\t\t\t\tpointer += 1\n\t\t\t\tif pointer < len(arr):\n\t\t\t\t\ttempQ.append(arr[pointer])\n\t\t\t\tpointer += 1\n\t\t\tres.append(sorted(data))\n\t\t\tq = tempQ\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tres = []\n\t\ti = 0\n\t\tk = 0\n\t\twhile i < n:\n\t\t\ttmp = []\n\t\t\tlvl = 2 ** k\n\t\t\twhile lvl > 0 and i < n:\n\t\t\t\ttmp.append(arr[i])\n\t\t\t\ti += 1\n\t\t\t\tlvl -= 1\n\t\t\ttmp.sort()\n\t\t\tres.append(tmp)\n\t\t\tk += 1\n\t\treturn res\n", "import math\n\nclass Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tres = []\n\t\t(j, k) = (0, 0)\n\t\twhile j < n:\n\t\t\ttmp = []\n\t\t\tlvl = math.pow(2, k)\n\t\t\twhile lvl > 0 and j < n:\n\t\t\t\ttmp.append(arr[j])\n\t\t\t\tlvl -= 1\n\t\t\t\tj += 1\n\t\t\ttmp.sort()\n\t\t\tres.append(tmp)\n\t\t\tk += 1\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tlevel = 0\n\t\tindex = 0\n\t\tans = list()\n\t\twhile index < n:\n\t\t\tnodesCurrLevel = pow(2, level) - 1\n\t\t\tlastindex = min(index + nodesCurrLevel, n - 1)\n\t\t\tarr = arr[:index] + sorted(arr[index:lastindex + 1]) + arr[lastindex + 1:]\n\t\t\tlst = list()\n\t\t\twhile index <= lastindex:\n\t\t\t\tlst.append(arr[index])\n\t\t\t\tindex += 1\n\t\t\tans.append(lst)\n\t\t\tlevel += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\t(k, i) = (0, 1)\n\t\tans = []\n\t\tz = []\n\t\ttot = 0\n\t\tfor x in arr:\n\t\t\tif k < i:\n\t\t\t\tz.append(x)\n\t\t\t\tk += 1\n\t\t\telse:\n\t\t\t\tans.append(sorted(z))\n\t\t\t\ttot += k\n\t\t\t\tk = 0\n\t\t\t\ti *= 2\n\t\t\t\tz = []\n\t\t\t\tz.append(x)\n\t\t\t\tk += 1\n\t\tif tot != n:\n\t\t\tans.append(sorted(z))\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tans = []\n\t\ti = 1\n\t\twhile i <= n:\n\t\t\ttemp = []\n\t\t\tfor j in range(i):\n\t\t\t\tif not arr:\n\t\t\t\t\tbreak\n\t\t\t\ttemp.append(arr.pop(0))\n\t\t\ttemp.sort()\n\t\t\tans.append(temp)\n\t\t\ti *= 2\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tl = 0\n\t\ti = 0\n\t\ts = []\n\t\twhile i < n:\n\t\t\tcln = 2 ** l\n\t\t\tj = min(i + cln - 1, n - 1)\n\t\t\ts.append(sorted(arr[i:j + 1]))\n\t\t\ti = j + 1\n\t\t\tl += 1\n\t\treturn s\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tans = []\n\t\tc = 0\n\t\ti = 1\n\t\twhile True:\n\t\t\tv = []\n\t\t\tj = 0\n\t\t\twhile j < i and c < n:\n\t\t\t\tv.append(arr[c])\n\t\t\t\tc += 1\n\t\t\t\tj += 1\n\t\t\tans.append(sorted(v))\n\t\t\ti = 2 * i\n\t\t\tif c == n:\n\t\t\t\tbreak\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tans = []\n\t\ti = 0\n\t\twhile arr:\n\t\t\ttemp = []\n\t\t\tc = 0\n\t\t\twhile c < 2 ** i and arr:\n\t\t\t\ttemp.append(arr.pop(0))\n\t\t\t\tc += 1\n\t\t\tans.append(sorted(list(temp)))\n\t\t\ti += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, a, n):\n\t\tl = []\n\t\tq = [0]\n\t\twhile q:\n\t\t\tt = a[q[0]:q[-1] + 1]\n\t\t\tt.sort()\n\t\t\tl.append(t)\n\t\t\tt = q.copy()\n\t\t\tq.clear()\n\t\t\tfor e in t:\n\t\t\t\tr1 = 2 * e + 1\n\t\t\t\tr2 = 2 * e + 2\n\t\t\t\tif r1 < n:\n\t\t\t\t\tq.append(r1)\n\t\t\t\tif r2 < n:\n\t\t\t\t\tq.append(r2)\n\t\treturn l\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tres = []\n\t\tlevel = 0\n\t\ti = 0\n\t\twhile i < len(arr):\n\t\t\tres.append([])\n\t\t\tj = min(len(arr), i + pow(2, level)) - 1\n\t\t\tfor k in range(j, i - 1, -1):\n\t\t\t\tres[-1].append(arr[k])\n\t\t\ti = j + 1\n\t\t\tlevel += 1\n\t\t\tres[-1].sort()\n\t\treturn res\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tans = []\n\t\ti = 0\n\t\tc = 0\n\t\tj = 2 ** c\n\t\twhile i < n and j < n:\n\t\t\tt = arr[i:j]\n\t\t\tans.append(sorted(t))\n\t\t\ti = j\n\t\t\tc += 1\n\t\t\tj = min(n, i + 2 ** c)\n\t\tans.append(sorted(arr[i:j]))\n\t\treturn ans\n", "class Solution:\n\n\tdef binTreeSortedLevels(self, arr, n):\n\t\tj = 0\n\t\tlevel = []\n\t\tresult = []\n\t\tfor i in range(n):\n\t\t\tif len(level) < 2 ** j:\n\t\t\t\tlevel.append(arr[i])\n\t\t\t\tif len(level) == 2 ** j or i == n - 1:\n\t\t\t\t\tresult.append(sorted(level.copy()))\n\t\t\t\t\tlevel.clear()\n\t\t\t\t\tj += 1\n\t\t\t\t\ti += 1\n\t\treturn result\n"]
|
class Solution:
def binTreeSortedLevels (self,arr, n):
#code here.
|
{"inputs": ["N = 7\narr[] = {7 6 5 4 3 2 1}", "N = 6\narr[] = {5 6 4 9 2 1}"], "outputs": ["7\n5 6\n1 2 3 4", "5\n4 6\n1 2 9"]}
|
MEDIUM
|
['Algorithms', 'Tree', 'Sorting', 'Queue', 'Data Structures', 'priority-queue']
| null |
geeksforgeeks
|
['Tree algorithms', 'Sorting', 'Data structures']
|
['Sorting', 'Data structures']
|
https://practice.geeksforgeeks.org/problems/print-binary-tree-levels-in-sorted-order3241/1
|
O(N).
| null | null |
0
| null |
O(NlogN).
|
You are given the prices of stock for n number of days. every ith day tell the price of the stock on that day.find the maximum profit that you can make by buying and selling stock any number of times as you can't proceed with other transactions if you hold any transaction.
Example:
Input:
n = 7
prices = [1,2,3,4,5,6,7]
Output:
6
Explaination:
We can make the maximum profit by buying the stock on the first day and selling it on the last day.
Your Task:
You don't have to read input or print anything. Your task is to complete the function maximizeProfit() which takes the integer n and array prices and returns the maximum profit that can earn.
Expected Time Complexity: O(n)
Expected Space Complexity: O(n^{2})
NOTE: can you solve this in less space complexity?
Constraint:
1<=n<=10^{5}
1<=prices[i]<=10^{5}
|
["class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tn = len(prices)\n\t\tcurr = [0 for i in range(2)]\n\t\tnex = [0 for i in range(2)]\n\t\tprofit = 0\n\t\tfor ind in range(n - 1, -1, -1):\n\t\t\tfor buy in range(0, 2):\n\t\t\t\tif buy:\n\t\t\t\t\tbuynow = -prices[ind] + nex[0]\n\t\t\t\t\tnotbuy = 0 + nex[1]\n\t\t\t\t\tprofit = max(buynow, notbuy)\n\t\t\t\telse:\n\t\t\t\t\tsellnow = prices[ind] + nex[1]\n\t\t\t\t\tnotsell = 0 + nex[0]\n\t\t\t\t\tprofit = max(sellnow, notsell)\n\t\t\t\tcurr[buy] = profit\n\t\t\tnex = curr\n\t\treturn nex[1]\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tans = 0\n\t\tprev = 0\n\t\tfor i in range(1, n):\n\t\t\tif prices[i] > prices[prev]:\n\t\t\t\tans += prices[i] - prices[prev]\n\t\t\tprev = i\n\t\treturn ans\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tMax = 0\n\t\tfor i in range(1, len(prices)):\n\t\t\tif prices[i] > prices[i - 1]:\n\t\t\t\tMax += prices[i] - prices[i - 1]\n\t\treturn Max\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tprofit = 0\n\t\tfor i in range(n - 1):\n\t\t\tx = prices[i + 1] - prices[i]\n\t\t\tif x < 0:\n\t\t\t\tcontinue\n\t\t\tprofit += x\n\t\tif profit < 0:\n\t\t\treturn 0\n\t\treturn profit\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tdp = [[-1 for i in range(2)] for j in range(n + 1)]\n\t\tdp[n][0] = dp[n][1] = 0\n\t\tfor ind in range(n - 1, -1, -1):\n\t\t\tfor buy in range(2):\n\t\t\t\tif buy:\n\t\t\t\t\tprofit = max(-prices[ind] + dp[ind + 1][0], dp[ind + 1][1])\n\t\t\t\telse:\n\t\t\t\t\tprofit = max(prices[ind] + dp[ind + 1][1], dp[ind + 1][0])\n\t\t\t\tdp[ind][buy] = profit\n\t\treturn dp[0][1]\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tprev = [-1 for i in range(2)]\n\t\tfor i in range(1, -1, -1):\n\t\t\tprev[i] = 0\n\t\tfor ind in range(n - 1, -1, -1):\n\t\t\ttemp = [-1 for i in range(2)]\n\t\t\tfor buy in range(1, -1, -1):\n\t\t\t\tif buy == 1:\n\t\t\t\t\ttemp[buy] = max(-prices[ind] + prev[0], 0 + prev[1])\n\t\t\t\telse:\n\t\t\t\t\ttemp[buy] = max(prices[ind] + prev[1], 0 + prev[0])\n\t\t\tprev = temp\n\t\treturn prev[1]\n", "class Solution:\n\n\tdef maximumProfit(self, A, n):\n\t\ti = 0\n\t\tans = 0\n\t\twhile i < n:\n\t\t\twhile i + 1 < n and A[i] >= A[i + 1]:\n\t\t\t\ti += 1\n\t\t\tl = A[i]\n\t\t\twhile i + 1 < n and A[i] <= A[i + 1]:\n\t\t\t\ti += 1\n\t\t\tr = A[i]\n\t\t\tif l == r:\n\t\t\t\treturn ans\n\t\t\tans += r - l\n\t\t\ti += 1\n\t\treturn ans\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tminm = prices[0]\n\t\tprofit = 0\n\t\tfor i in range(1, n):\n\t\t\tif prices[i] > minm:\n\t\t\t\tprofit += prices[i] - minm\n\t\t\t\tminm = prices[i]\n\t\t\telse:\n\t\t\t\tminm = prices[i]\n\t\treturn profit\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tn = len(prices)\n\t\tdp = [[0 for _ in range(3)] for _ in range(n + 1)]\n\t\tfor i in range(n - 1, -1, -1):\n\t\t\tfor buy in range(2):\n\t\t\t\tif buy == 1:\n\t\t\t\t\tdp[i][buy] = max(-prices[i] + dp[i + 1][0], dp[i + 1][1])\n\t\t\t\telse:\n\t\t\t\t\tdp[i][buy] = max(prices[i] + dp[i + 1][1], dp[i + 1][0])\n\t\treturn dp[0][1]\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\t(profit, A) = (0, prices)\n\t\tfor i in range(n - 1):\n\t\t\tif A[i + 1] > A[i]:\n\t\t\t\tprofit += A[i + 1] - A[i]\n\t\treturn profit\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tdp = [[0 for i in range(2)] for i in range(n + 1)]\n\t\tans = 0\n\t\tfor j in range(1, len(prices)):\n\t\t\tif prices[j - 1] < prices[j]:\n\t\t\t\tans += prices[j] - prices[j - 1]\n\t\treturn ans\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tmax_profit = 0\n\t\tfor i in range(1, n):\n\t\t\tif prices[i] > prices[i - 1]:\n\t\t\t\tmax_profit += prices[i] - prices[i - 1]\n\t\treturn max_profit\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tafter = [0 for i in range(2)]\n\t\tfor i in range(2):\n\t\t\tafter[i] = 0\n\t\tfor ind in range(n - 1, -1, -1):\n\t\t\tcurr = [0 for i in range(2)]\n\t\t\tcurr[1] = max(-prices[ind] + after[0], after[1])\n\t\t\tcurr[0] = max(prices[ind] + after[1], after[0])\n\t\t\tafter = curr\n\t\treturn after[1]\n", "class Solution:\n\n\tdef maximumProfit(self, arr, n):\n\t\tdp = [[0 for i in range(2)] for j in range(n + 1)]\n\t\tdp[n][0] = 0\n\t\tdp[n][1] = 0\n\t\tfor idx in range(n - 1, -1, -1):\n\t\t\tfor buy in range(2):\n\t\t\t\tprofit = 0\n\t\t\t\tif buy:\n\t\t\t\t\tp = -arr[idx] + dp[idx + 1][0]\n\t\t\t\t\tnp = 0 + dp[idx + 1][1]\n\t\t\t\t\tprofit = max(profit, max(p, np))\n\t\t\t\telse:\n\t\t\t\t\ts = arr[idx] + dp[idx + 1][1]\n\t\t\t\t\tns = 0 + dp[idx + 1][0]\n\t\t\t\t\tprofit = max(profit, max(s, ns))\n\t\t\t\tdp[idx][buy] = profit\n\t\treturn dp[0][1]\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tprofit = 0\n\t\ti = 1\n\t\twhile i < n:\n\t\t\tbuy = i - 1\n\t\t\twhile i < n and prices[i] > prices[i - 1]:\n\t\t\t\ti += 1\n\t\t\tsell = i - 1\n\t\t\tprofit += prices[sell] - prices[buy]\n\t\t\ti += 1\n\t\treturn profit\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tdp = [[0] * 2 for _ in range(n + 1)]\n\t\tprofit = 0\n\t\tfor i in range(n - 1, -1, -1):\n\t\t\tfor j in range(2):\n\t\t\t\tif j == 0:\n\t\t\t\t\tprofit = max(dp[i + 1][0], dp[i + 1][1] - prices[i])\n\t\t\t\tif j == 1:\n\t\t\t\t\tprofit = max(dp[i + 1][1], dp[i + 1][0] + prices[i])\n\t\t\t\tdp[i][j] = profit\n\t\treturn dp[0][0]\n", "class Solution:\n\n\tdef maximumProfit(self, arr, n):\n\t\ti = 0\n\t\tfinal_ans = []\n\t\twhile i < n - 1:\n\t\t\tif arr[i] <= arr[i + 1]:\n\t\t\t\tans = []\n\t\t\t\tans.append(arr[i])\n\t\t\t\twhile i < n - 1 and arr[i] <= arr[i + 1]:\n\t\t\t\t\ti += 1\n\t\t\t\tans.append(arr[i])\n\t\t\t\tfinal_ans.append(ans)\n\t\t\telse:\n\t\t\t\ti += 1\n\t\tanswer = 0\n\t\tfor res in final_ans:\n\t\t\tanswer = answer + (res[1] - res[0])\n\t\treturn answer\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tans = 0\n\t\tfor i in range(1, n):\n\t\t\tans += max(0, prices[i] - prices[i - 1])\n\t\treturn ans\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tn = len(prices)\n\t\tdp = [[0] * 2 for i in range(n + 1)]\n\t\tdp[n][0] = dp[n][1] = 0\n\t\tfor idx in range(n - 1, -1, -1):\n\t\t\tfor buy in range(0, 2):\n\t\t\t\tprofit = 0\n\t\t\t\tif buy:\n\t\t\t\t\tprofit = max(-prices[idx] + dp[idx + 1][0], 0 + dp[idx + 1][1])\n\t\t\t\telse:\n\t\t\t\t\tprofit = max(prices[idx] + dp[idx + 1][1], 0 + dp[idx + 1][0])\n\t\t\t\tdp[idx][buy] = profit\n\t\treturn dp[0][1]\n", "class Solution:\n\n\tdef maximumProfit(self, A, n):\n\t\tahead = [0, 0]\n\t\tcurr = [0, 0]\n\t\tahead[0] = ahead[1] = 0\n\t\tfor ind in range(n - 1, -1, -1):\n\t\t\tfor buy in range(2):\n\t\t\t\tif buy:\n\t\t\t\t\ttake = -A[ind] + ahead[0]\n\t\t\t\t\tnoTake = 0 + ahead[1]\n\t\t\t\t\tcurr[buy] = max(take, noTake)\n\t\t\t\telse:\n\t\t\t\t\ttake = A[ind] + ahead[1]\n\t\t\t\t\tnoTake = 0 + ahead[0]\n\t\t\t\t\tcurr[buy] = max(take, noTake)\n\t\t\tahead = curr\n\t\treturn ahead[1]\n", "class Solution:\n\n\tdef maximumProfit(self, A, n):\n\t\tdp = [[0 for _ in range(2)] for _ in range(n + 1)]\n\t\t(dp[n][0], dp[n][1]) = (0, 0)\n\t\tfor ind in range(n - 1, -1, -1):\n\t\t\tfor buy in range(2):\n\t\t\t\tif buy:\n\t\t\t\t\ttake = -A[ind] + dp[ind + 1][0]\n\t\t\t\t\tnoTake = 0 + dp[ind + 1][1]\n\t\t\t\t\tdp[ind][buy] = max(take, noTake)\n\t\t\t\telse:\n\t\t\t\t\ttake = A[ind] + dp[ind + 1][1]\n\t\t\t\t\tnoTake = 0 + dp[ind + 1][0]\n\t\t\t\t\tdp[ind][buy] = max(take, noTake)\n\t\treturn dp[0][1]\n", "import sys\nsys.setrecursionlimit(10 ** 8)\nmod = 10 ** 9\n\nclass Solution:\n\n\tdef maximumProfit(self, arr, n):\n\t\tdp = [[0 for j in range(0, 2)] for i in range(0, n + 1)]\n\t\tdp[n][0] = 0\n\t\tdp[n][1] = 0\n\t\tfor i in range(n - 1, -1, -1):\n\t\t\tfor j in range(0, 2):\n\t\t\t\tprofit = 0\n\t\t\t\tif j == 0:\n\t\t\t\t\tbuy = -arr[i] + dp[i + 1][1]\n\t\t\t\t\tnotbuy = dp[i + 1][0]\n\t\t\t\t\tprofit = max(buy, notbuy)\n\t\t\t\telif j == 1:\n\t\t\t\t\tsell = arr[i] + dp[i + 1][0]\n\t\t\t\t\tnotsell = dp[i + 1][1]\n\t\t\t\t\tprofit = max(sell, notsell)\n\t\t\t\tdp[i][j] = profit\n\t\treturn dp[0][0]\n", "class Solution:\n\n\tdef maximumProfit(self, arr, n):\n\t\t(l, r) = (0, 1)\n\t\ttotal = 0\n\t\tprev = 0\n\t\twhile r < n:\n\t\t\tcurr = arr[r] - arr[l]\n\t\t\tif curr > prev:\n\t\t\t\tprev = curr\n\t\t\t\tif r == n - 1:\n\t\t\t\t\ttotal += prev\n\t\t\telif curr < prev:\n\t\t\t\ttotal += prev\n\t\t\t\tprev = 0\n\t\t\t\tl = r\n\t\t\tr += 1\n\t\treturn total\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tahead = [0] * 2\n\t\tahead[0] = 0\n\t\tahead[1] = 0\n\t\tfor ind in range(n - 1, -1, -1):\n\t\t\tcur = [0] * 2\n\t\t\tfor buy in range(2):\n\t\t\t\tif buy:\n\t\t\t\t\tprofit = max(-1 * prices[ind] + ahead[0], ahead[1])\n\t\t\t\telse:\n\t\t\t\t\tprofit = max(prices[ind] + ahead[1], ahead[0])\n\t\t\t\tcur[buy] = profit\n\t\t\tahead = cur\n\t\treturn ahead[1]\n", "import sys\n\nclass Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\tminI = 0\n\t\tres = []\n\t\tfor i in range(n):\n\t\t\tif i == n - 1 or (i < n - 1 and prices[i] > prices[i + 1]):\n\t\t\t\tif i != minI:\n\t\t\t\t\tres.append([minI, i])\n\t\t\t\tminI = i + 1\n\t\tprof = 0\n\t\tfor p in res:\n\t\t\tprof += prices[p[1]] - prices[p[0]]\n\t\treturn prof\n", "class Solution:\n\n\tdef maximumProfit(self, prices, n):\n\t\ttotal_profit = 0\n\t\tbuy = 0\n\t\tsell = 0\n\t\tfor i in range(1, n):\n\t\t\tif prices[i] >= prices[i - 1]:\n\t\t\t\tsell += 1\n\t\t\telse:\n\t\t\t\ttotal_profit += prices[sell] - prices[buy]\n\t\t\t\tbuy = i\n\t\t\t\tsell = i\n\t\ttotal_profit += prices[sell] - prices[buy]\n\t\treturn total_profit\n"]
|
#User function Template for python3
class Solution:
def maximumProfit(self, prices, n):
#Code here
|
{"inputs": ["n = 7\nprices = [1,2,3,4,5,6,7]"], "outputs": ["6"]}
|
MEDIUM
|
[]
| null |
geeksforgeeks
|
[]
|
[]
|
https://practice.geeksforgeeks.org/problems/buy-stock-2/1
|
O(n^{2})
| null | null |
0
| null |
O(n)
|
When little Petya grew up and entered the university, he started to take part in АСМ contests. Later he realized that he doesn't like how the АСМ contests are organised: the team could only have three members (and he couldn't take all his friends to the competitions and distribute the tasks between the team members efficiently), so he decided to organize his own contests PFAST Inc. — Petr and Friends Are Solving Tasks Corporation. PFAST Inc. rules allow a team to have unlimited number of members.
To make this format of contests popular he organised his own tournament. To create the team he will prepare for the contest organised by the PFAST Inc. rules, he chose several volunteers (up to 16 people) and decided to compile a team from them. Petya understands perfectly that if a team has two people that don't get on well, then the team will perform poorly. Put together a team with as many players as possible given that all players should get on well with each other.
Input
The first line contains two integer numbers n (1 ≤ n ≤ 16) — the number of volunteers, and m (<image>) — the number of pairs that do not get on. Next n lines contain the volunteers' names (each name is a non-empty string consisting of no more than 10 uppercase and/or lowercase Latin letters). Next m lines contain two names — the names of the volunteers who do not get on. The names in pair are separated with a single space. Each pair of volunteers who do not get on occurs exactly once. The strings are case-sensitive. All n names are distinct.
Output
The first output line should contain the single number k — the number of people in the sought team. Next k lines should contain the names of the sought team's participants in the lexicographical order. If there are several variants to solve the problem, print any of them. Petya might not be a member of the sought team.
Examples
Input
3 1
Petya
Vasya
Masha
Petya Vasya
Output
2
Masha
Petya
Input
3 0
Pasha
Lesha
Vanya
Output
3
Lesha
Pasha
Vanya
|
["from sys import stdin, stdout\nfrom collections import deque\nimport sys\nfrom copy import deepcopy\nimport math\nimport collections\nfrom itertools import combinations\n\ndef check(temp):\n\tfor i in range(len(temp)):\n\t\tfor j in range(i + 1, len(temp)):\n\t\t\tif temp[i] in enemy:\n\t\t\t\tif temp[j] in enemy[temp[i]]:\n\t\t\t\t\treturn False\n\t\t\tif temp[j] in enemy:\n\t\t\t\tif temp[i] in enemy[temp[j]]:\n\t\t\t\t\treturn False\n\treturn True\n(n, m) = list(map(int, stdin.readline().split()))\nname = dict()\nback_name = dict()\narr = []\nfor i in range(n):\n\tstring = stdin.readline().strip()\n\tname[string] = i\n\tback_name[i] = string\nenemy = collections.defaultdict(dict)\nfor i in range(m):\n\t(first, second) = list(stdin.readline().split())\n\tenemy[name[first]][name[second]] = True\n\tenemy[name[second]][name[first]] = True\narr = [x for x in range(n)]\nans = []\nnum = 0\nfor i in range(1, n + 1):\n\tcomb = combinations(arr, i)\n\tfor i in comb:\n\t\ttemp = list(i)\n\t\tif check(temp):\n\t\t\tif len(temp) > num:\n\t\t\t\tans = temp\n\t\t\t\tnum = len(temp)\nprint(len(ans))\nans2 = []\nfor i in ans:\n\tans2.append(back_name[i])\nans2.sort()\nfor i in ans2:\n\tprint(i)\n", "from itertools import combinations\n\ndef solve():\n\t(n, m) = map(int, input().split())\n\tname = sorted([input().strip() for i in range(n)])\n\tbad = sorted([sorted(input().strip().split()) for i in range(m)])\n\tfor i in range(n, -1, -1):\n\t\ttemp = sorted(map(sorted, combinations(name, i)))\n\t\tfor k in temp:\n\t\t\tflag = 1\n\t\t\tfor j in map(sorted, combinations(k, 2)):\n\t\t\t\tif j in bad:\n\t\t\t\t\tflag = 0\n\t\t\t\t\tbreak\n\t\t\tif flag:\n\t\t\t\treturn k\nx = solve()\nprint(len(x))\nprint(*x, sep='\\n')\n", "from itertools import product\n(n, m) = map(int, input().split())\nvl = sorted([input() for i in range(n)])\ncm = {vl[i]: i for i in range(n)}\ncl = []\nfor i in range(m):\n\t(a, b) = input().split()\n\tcl += [[cm[a], cm[b]]]\nans = [(), 0]\nfor x in list(product([1, 0], repeat=n)):\n\tflag = 0\n\tfor c in cl:\n\t\tif x[c[0]] == 1 == x[c[1]]:\n\t\t\tflag = 1\n\t\t\tbreak\n\tif flag == 0 and ans[1] < x.count(1):\n\t\tans = [x, x.count(1)]\nprint(ans[1])\nprint('\\n'.join([vl[i] for i in range(n) if ans[0][i] == 1]))\n", "tmp = input().split(' ')\nN_ppl = int(tmp[0])\nN_cstrt = int(tmp[1])\nppl_to_id = {}\nid_ppl = [0] * N_ppl\ncstrt = [0] * N_ppl\nfor i in range(N_ppl):\n\ttmp = input()\n\tid_ppl[i] = tmp\n\tppl_to_id[tmp] = i\n\tcstrt[i] = []\nfor i in range(N_cstrt):\n\ttmp = input().split()\n\tcstrt[ppl_to_id[tmp[0]]].append(ppl_to_id[tmp[1]])\nhow_many_ones = [0] * 2 ** N_ppl\nfor N in range(2 ** N_ppl):\n\ti = 0\n\tn = N\n\twhile n > 0:\n\t\ti += n % 2\n\t\tn //= 2\n\thow_many_ones[N] = i\n\ndef test_team(n):\n\tglobal N_ppl, cstrt\n\tTeam = [0] * N_ppl\n\tfor k in range(N_ppl):\n\t\tTeam[k] = n % 2\n\t\tn //= 2\n\tfor k in range(N_ppl):\n\t\tif Team[k]:\n\t\t\tfor l in cstrt[k]:\n\t\t\t\tif Team[l]:\n\t\t\t\t\treturn False\n\treturn Team\n\ndef main():\n\tglobal N_ppl, how_many_ones\n\tfor i in range(N_ppl, 0, -1):\n\t\tfor j in range(0, 2 ** N_ppl):\n\t\t\tif how_many_ones[j] != i:\n\t\t\t\tcontinue\n\t\t\tT = test_team(j)\n\t\t\tif T:\n\t\t\t\treturn T\nT = main()\nR = []\nfor i in range(len(T)):\n\tif T[i]:\n\t\tR.append(i)\nprint(len(R))\nfor i in range(len(R)):\n\tR[i] = id_ppl[R[i]]\nR.sort()\nprint('\\n'.join(R))\n", "(n, m) = map(int, input().split())\nnames = []\nmp = {}\nfor i in range(n):\n\tname = input()\n\tmp[name] = i\n\tnames.append(name)\nmask = [0] * n\nfor i in range(m):\n\t(a, b) = map(mp.get, input().split())\n\tmask[a] |= 1 << b\n\tmask[b] |= 1 << a\nans = 0\nresult = 0\n\ndef bcnt(x):\n\treturn 0 if x == 0 else bcnt(x >> 1) + (x & 1)\nfor val in range(1 << n):\n\tif bcnt(val) <= ans:\n\t\tcontinue\n\tvalid = True\n\tfor i in range(n):\n\t\tif 1 << i & val and val & mask[i]:\n\t\t\tvalid = False\n\t\t\tbreak\n\tif valid:\n\t\tans = bcnt(val)\n\t\tresult = val\nprint(ans)\nout = []\nfor i in range(n):\n\tif 1 << i & result:\n\t\tout.append(names[i])\nfor s in sorted(out):\n\tprint(s)\n", "nums = input().split()\nnumPeople = int(nums[0])\nnumPairs = int(nums[1])\nnames = []\nfor i in range(numPeople):\n\tnames.append(input())\npair1 = []\npair2 = []\nfor i in range(numPairs):\n\tpair = input().split()\n\tpair1.append(pair[0])\n\tpair2.append(pair[1])\nnumSets = pow(2, numPeople)\nbestSet = []\nfor i in range(1, numSets):\n\tcurrSet = []\n\tfor j in range(numPeople):\n\t\tif i & 1 << j > 0:\n\t\t\tcurrSet.append(names[j])\n\tvalidSet = True\n\tfor j in range(numPairs):\n\t\tperson1 = pair1[j]\n\t\tperson2 = pair2[j]\n\t\tif person1 in currSet and person2 in currSet:\n\t\t\tvalidSet = False\n\t\t\tbreak\n\tif validSet:\n\t\tif len(currSet) > len(bestSet):\n\t\t\tbestSet = currSet\nbestSet.sort()\nprint(len(bestSet))\nfor i in bestSet:\n\tprint(i)\n", "from collections import defaultdict\ngraph = defaultdict(list)\n(n, m) = list(map(int, input().split()))\nd = {}\ncnt = 0\nfor i in range(n):\n\tx = input()\n\td[x] = cnt\n\tcnt += 1\narr = []\nfor i in range(m):\n\t(u, v) = list(map(str, input().split()))\n\tarr.append([u, v])\npossibilities = []\nfor i in range(2 ** n):\n\tx = bin(i).split('b')[1]\n\tx = '0' * (n - len(x)) + x\n\tpossibilities.append(x)\nans = []\nfor i in possibilities:\n\tf = 0\n\tfor j in arr:\n\t\tif i[d[j[0]]] == '1' and i[d[j[1]]] == '1':\n\t\t\tf = 1\n\t\t\tbreak\n\tif f == 0:\n\t\tans.append(i)\nk = -1\nu = -1\nmat = []\nfor i in ans:\n\ty = i.count('1')\n\tif k < y:\n\t\tk = y\n\t\tu = i\nfor i in range(len(u)):\n\tif u[i] == '1':\n\t\tfor j in d:\n\t\t\tif d[j] == i:\n\t\t\t\tmat.append(j)\n\t\t\t\tbreak\nmat.sort()\nprint(len(mat))\nfor i in mat:\n\tprint(i)\n", "def get_subsets(elements):\n\tif not elements:\n\t\tyield tuple()\n\telse:\n\t\tfor subset_rec in get_subsets(elements[1:]):\n\t\t\tyield subset_rec\n\t\t\tyield ((elements[0],) + subset_rec)\n\ndef is_valid_set(subset, pairs):\n\tsubset = set(subset)\n\tok = True\n\tfor pair in pairs:\n\t\tok = ok and (not (pair[0] in subset and pair[1] in subset))\n\treturn ok\n(n, m) = map(int, input().split())\nnames = tuple((input() for _ in range(n)))\npairs = [input().split() for _ in range(m)]\nok = lambda subset: is_valid_set(subset, pairs)\nteam = max(filter(ok, get_subsets(names)), key=len)\nprint(len(team))\nfor name in sorted(team):\n\tprint(name)\n", "f_in = input()\nf_in = f_in.split(' ')\nnum_members = int(f_in[0])\nnum_bad_pairs = int(f_in[1])\nmembers = []\nbad_pair = []\nbad_pair_dic = {}\nfor i in range(num_members):\n\tmembers.append(input())\nfor i in range(num_bad_pairs):\n\tbad_pair = input().split(' ')\n\tif bad_pair[0] not in bad_pair_dic:\n\t\tbad_pair_dic[bad_pair[0]] = []\n\tbad_pair_dic[bad_pair[0]].append(bad_pair[1])\n\tif bad_pair[1] not in bad_pair_dic:\n\t\tbad_pair_dic[bad_pair[1]] = []\n\tbad_pair_dic[bad_pair[1]].append(bad_pair[0])\nanswer = []\nmax_answer = []\nmax_iterations = num_members ** 2\nnum_iterations = 0\nmembers.sort()\n\ndef recursive_brute_force(members, answer):\n\tglobal max_iterations\n\tglobal num_iterations\n\tglobal max_answer\n\tnum_iterations += 1\n\tif num_iterations >= max_iterations:\n\t\treturn\n\tif members == []:\n\t\tif len(answer) > len(max_answer):\n\t\t\tmax_answer = answer[:]\n\t\t\treturn\n\telse:\n\t\tnew_members = members[:]\n\t\tfor member in members:\n\t\t\tnew_members.remove(member)\n\t\t\tflag = False\n\t\t\tfor key in answer:\n\t\t\t\tif key in bad_pair_dic:\n\t\t\t\t\tif member in bad_pair_dic[key]:\n\t\t\t\t\t\tflag = True\n\t\t\t\t\t\tbreak\n\t\t\t\telse:\n\t\t\t\t\tcontinue\n\t\t\tif flag:\n\t\t\t\tcontinue\n\t\t\tnew_answer = answer[:]\n\t\t\tnew_answer.append(member)\n\t\t\tif len(new_answer) > len(max_answer):\n\t\t\t\tmax_answer = new_answer[:]\n\t\t\trecursive_brute_force(new_members, new_answer)\n\t\treturn\nif num_bad_pairs != 0:\n\trecursive_brute_force(members, answer)\nelse:\n\tmax_answer = members[:]\nmax_answer.sort()\nprint(len(max_answer))\nfor member in max_answer:\n\tprint(member)\n", "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import ceil, floor, gcd, sqrt, trunc, inf\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\nmod = pow(10, 9) + 7\nmod2 = 998244353\n\ndef data():\n\treturn sys.stdin.readline().strip()\n\ndef out(*var, end='\\n'):\n\tsys.stdout.write(' '.join(map(str, var)) + end)\n\ndef l():\n\treturn list(sp())\n\ndef sl():\n\treturn list(ssp())\n\ndef sp():\n\treturn map(int, data().split())\n\ndef ssp():\n\treturn map(str, data().split())\n\ndef l1d(n, val=0):\n\treturn [val for i in range(n)]\n\ndef l2d(n, m, val=0):\n\treturn [l1d(n, val) for j in range(m)]\n\ndef on(a):\n\ti = n\n\tcnt = []\n\twhile i >= 0:\n\t\tif a & 1 << i:\n\t\t\tcnt.append(i)\n\t\ti -= 1\n\treturn cnt\n\ndef check(arr, index):\n\tfor i in arr:\n\t\tif names[i] in graph[names[index]] or names[index] in graph[names[i]]:\n\t\t\treturn False\n\treturn True\n\ndef recur(i=0, mask=0):\n\tglobal answer\n\tif i == n:\n\t\ttemp = on(mask)\n\t\tif len(temp) > len(answer):\n\t\t\tanswer = temp\n\t\treturn\n\tif mask & 1 << i:\n\t\treturn\n\ttemp = on(mask)\n\tif check(temp, i):\n\t\trecur(i + 1, mask | 1 << i)\n\trecur(i + 1, mask)\n(n, m) = sp()\ngraph = dd(set)\nnames = []\nfor i in range(n):\n\tnames.append(data())\nfor i in range(m):\n\t(u, v) = ssp()\n\tgraph[u].add(v)\n\tgraph[v].add(u)\nanswer = []\nrecur()\nout(len(answer))\nfor i in range(len(answer)):\n\tanswer[i] = names[answer[i]]\nfor i in sorted(answer):\n\tout(i)\n", "ii = lambda : int(input())\nkk = lambda : map(int, input().split())\nll = lambda : list(kk())\n(n, m) = kk()\nppl = [input() for _ in range(n)]\nothers = [set() for _ in range(n)]\nfor _ in range(m):\n\t(a, b) = input().split()\n\ta = ppl.index(a)\n\tb = ppl.index(b)\n\tothers[a].add(b)\n\tothers[b].add(a)\nlargest = set()\nfor i in range(2 ** n):\n\ts = set()\n\tfor j in range(n):\n\t\tif i & 2 ** j:\n\t\t\tif others[j] & s:\n\t\t\t\tbreak\n\t\t\ts.add(j)\n\telse:\n\t\tif len(s) > len(largest):\n\t\t\tlargest = s\nprint(len(largest))\nprint('\\n'.join(sorted([ppl[x] for x in largest])))\n", "def bitmask(m, array):\n\treturn [array[i] for i in range(len(array)) if m & 1 << i]\n(n, k) = map(int, input().split())\nnames = [input() for _ in range(n)]\nnames.sort()\nbads = [input().split() for _ in range(k)]\n(m_count, bb) = (-1, [])\nfor m in range(2 ** n):\n\tif bin(m).count('1') < m_count:\n\t\tcontinue\n\tb = bitmask(m, names)\n\tf = True\n\tfor (x, y) in bads:\n\t\tif x in b and y in b:\n\t\t\tf = False\n\tif f:\n\t\t(m_count, bb) = (len(b), b)\nprint(m_count)\nprint('\\n'.join(bb))\n", "def good(a, bad):\n\tfor i in bad:\n\t\tif i[0] in a and i[1] in a:\n\t\t\treturn False\n\treturn True\n\ndef f(arr, bad, d):\n\tn = len(arr)\n\tmask = 0\n\tans = []\n\twhile mask < 1 << n:\n\t\ttemp = []\n\t\tfor i in range(len(arr)):\n\t\t\tif mask & 1 << i:\n\t\t\t\ttemp.append(i)\n\t\tif good(temp, bad):\n\t\t\tans.append(temp)\n\t\tmask += 1\n\tmx = max(ans, key=lambda s: len(s))\n\tprint(len(mx))\n\tfor i in mx:\n\t\tprint(arr[i])\n\treturn ''\n(a, b) = map(int, input().strip().split())\nblanck = []\nfor i in range(a):\n\tblanck.append(input())\nd = {}\nblanck = sorted(blanck)\nfor i in range(len(blanck)):\n\td[blanck[i]] = i\nbad = []\nfor i in range(b):\n\t(x, y) = map(str, input().strip().split())\n\tk = sorted((d[x], d[y]))\n\tbad.append(k)\nprint(f(blanck, bad, d))\n", "def GSB(x):\n\tcounter = 0\n\twhile x != 0:\n\t\tcounter += 1\n\t\tx = x >> 1\n\treturn counter\n\ndef friends(checker, enemy):\n\tfor i in range(len(enemy)):\n\t\tif enemy[i][0] in checker and enemy[i][1] in checker:\n\t\t\treturn 0\n\treturn 1\n(people, conflict) = [int(x) for x in input().split()]\nperson = []\nenemy = []\nhighest = -1\nhighestarray = []\nfor i in range(people):\n\tperson.append(input())\nfor j in range(conflict):\n\tenemy.append(input().split())\ncombinations = [int(x) for x in range(2 ** people)]\nfor i in combinations:\n\tchecker = []\n\tj = 0\n\tz = GSB(i)\n\twhile j != z and i != 0:\n\t\tif i & 1 == 1:\n\t\t\tchecker.append(person[j])\n\t\ti = i >> 1\n\t\tj += 1\n\tif friends(checker, enemy):\n\t\tif len(checker) > highest:\n\t\t\thighest = len(checker)\n\t\t\thighestarray = checker\nprint(highest)\nhighestarray.sort()\nfor i in range(highest):\n\tprint(highestarray[i])\n", "import itertools as it\n(n, m) = map(int, input().split())\nedges = set()\nfriends_M = {}\nfor i in range(n):\n\tfriends_M[input()] = i\nfor _ in range(m):\n\t(a, b) = input().split()\n\t(a, b) = (friends_M[a], friends_M[b])\n\tedges.add((a, b))\n\tedges.add((b, a))\nbest = 0\nbest_vals = []\nfor subset in it.product([0, 1], repeat=n):\n\tss = list(it.compress(range(n), subset))\n\tgood = True\n\tfor i in range(len(ss)):\n\t\tfor j in range(i + 1, len(ss)):\n\t\t\tif (ss[i], ss[j]) in edges:\n\t\t\t\tgood = False\n\tif good:\n\t\tif len(ss) > best:\n\t\t\tbest = len(ss)\n\t\t\tbest_vals = ss\nprint(best)\nres = []\nfor i in range(len(best_vals)):\n\tfor (j, k) in friends_M.items():\n\t\tif k == best_vals[i]:\n\t\t\tres += [j]\n\t\t\tbreak\nfor name in sorted(res):\n\tprint(name)\n", "(n, m) = map(int, input().split())\nN = [n]\nNames = {}\nNumbers = {}\nEnemies = []\nfor i in range(n):\n\ts = input()\n\tNames[s] = i\n\tEnemies.append([])\n\tNumbers[i] = str(s)\nfor i in range(m):\n\t(a, b) = input().split()\n\tEnemies[Names[a]].append(Names[b])\n\tEnemies[Names[b]].append(Names[a])\nAns = [[]]\n\ndef dp(N, i, Taken, Forbidden):\n\tif i == N:\n\t\tif len(Taken) > len(Ans[0]):\n\t\t\tAns[0] = list(Taken)\n\t\treturn\n\tif i not in Forbidden:\n\t\tdp(N, i + 1, Taken, Forbidden)\n\t\tdp(N, i + 1, Taken + [i], Forbidden + Enemies[i])\n\telse:\n\t\tdp(N, i + 1, Taken, Forbidden)\n\treturn\ndp(n, 0, [], [])\nprint(len(Ans[0]))\nAns = Ans[0]\nfor i in range(len(Ans)):\n\tAns[i] = Numbers[Ans[i]]\nAns.sort()\nfor item in Ans:\n\tprint(item)\n", "(n, m) = map(int, input().split())\nID = {}\nname_from_ID = {}\nfor i in range(n):\n\tname = input()\n\tID[name] = i\n\tname_from_ID[i] = name\npeople_I_hate = [set() for i in range(n)]\nfor j in range(m):\n\t(name1, name2) = input().split()\n\tpeople_I_hate[ID[name1]].add(ID[name2])\n\tpeople_I_hate[ID[name2]].add(ID[name1])\n\ndef conflict(team, people_I_hate):\n\tfor guy1 in team:\n\t\tfor guy2 in team:\n\t\t\tif guy1 in people_I_hate[guy2] or guy2 in people_I_hate:\n\t\t\t\treturn True\n\treturn False\nans = []\nfor mask in range(1 << n):\n\tteam = []\n\tfor i in range(n):\n\t\tif mask & 1 << i:\n\t\t\tteam.append(i)\n\tif not conflict(team, people_I_hate) and len(team) > len(ans):\n\t\tans = [name_from_ID[x] for x in team]\nprint(len(ans))\nfor name in sorted(ans):\n\tprint(name)\n", "def moins(M, N):\n\tL = []\n\tfor i in M:\n\t\tif i not in N:\n\t\t\tL += [i]\n\treturn L\nS = str(input())\nl = S.split(' ')\n(n, m) = (int(l[0]), int(l[1]))\nd = {}\nS = str(input())\nL = [S]\nfor i in range(n - 1):\n\tS = str(input())\n\t(j, f) = (0, 0)\n\twhile f == 0:\n\t\tif j == len(L):\n\t\t\tL += [S]\n\t\t\tf = 1\n\t\telif L[j] > S:\n\t\t\tL = L[:j] + [S] + L[j:]\n\t\t\tf = 1\n\t\telse:\n\t\t\tj += 1\nT = list(L)\nP = []\nfor m in range(m):\n\tS = str(input())\n\tl = S.split(' ')\n\t(S1, S2) = (l[0], l[1])\n\tif S1 in d:\n\t\td[S1][0] += 1\n\t\td[S1] += [S2]\n\telse:\n\t\td[S1] = [1, S2]\n\t\tT.remove(S1)\n\t\tP += [S1]\n\tif S2 in d:\n\t\td[S2][0] += 1\n\t\td[S2] += [S1]\n\telse:\n\t\td[S2] = [1, S1]\n\t\tT.remove(S2)\n\t\tP += [S2]\nm = []\nO = []\nk = 0\nfor i in d:\n\tm += [[i, moins(P, d[i][1:] + [i])]]\nfor i in m:\n\tif i[-1] == []:\n\t\tif len(i[:-1]) > k:\n\t\t\tO = i[:-1]\n\t\t\tk = len(i[:-1])\n\tfor j in i[-1]:\n\t\tm += [i[:-1] + [j] + [moins(i[-1], d[j][1:] + [j])]]\nfor i in O:\n\tif T == []:\n\t\tT = [i]\n\telse:\n\t\tfor j in range(len(T)):\n\t\t\tif T[j] > i:\n\t\t\t\tT = T[:j] + [i] + T[j:]\n\t\t\t\tbreak\n\t\t\tif j == len(T) - 1:\n\t\t\t\tT += [i]\nprint(len(T))\nfor i in T:\n\tprint(i)\n", "n_m = input()\n(n, m) = [int(s) for s in n_m.split()]\nnames = []\nreverse = dict()\nentente = [[True] * n for _ in range(n)]\nfor i in range(n):\n\tname = input()\n\tnames.append(name)\n\treverse[name] = i\n\tentente[i][i] = False\nfor i in range(m):\n\t(i1, i2) = [reverse[s] for s in input().split()]\n\tentente[i2][i1] = False\n\tentente[i1][i2] = False\n\ndef rec(valides):\n\tbest = [[False] * n, 0]\n\tparticipants_restants = sum(valides)\n\tfor i in range(n):\n\t\tif valides[i] and participants_restants != sum(best[0]):\n\t\t\tres_temp = rec([valides[j] and entente[i][j] and (j > i) for j in range(n)])\n\t\t\tif best[1] <= res_temp[1]:\n\t\t\t\tbest = res_temp\n\t\t\t\tbest[0][i] = True\n\t\t\t\tbest[1] += 1\n\treturn best\nres = [names[i] for (i, b) in enumerate(rec([True] * n)[0]) if b]\nres.sort()\nprint(len(res))\nfor s in res:\n\tprint(s)\n", "(n, m) = map(int, input().split())\np = {}\nfor i in range(n):\n\tp[input()] = []\nfor i in range(m):\n\t(a, b) = input().split()\n\tp[a].append(b)\n\tp[b].append(a)\n(t, r, k) = ([], [], 0)\nfor a in p:\n\td = set(p[a])\n\tfor i in range(k):\n\t\tif a in t[i]:\n\t\t\tcontinue\n\t\tq = t[i] | d\n\t\tif len(q) == len(t[i]):\n\t\t\tr[i].append(a)\n\t\telse:\n\t\t\tt.append(q)\n\t\t\tr.append(r[i] + [a])\n\tt.append(d)\n\tr.append([a])\n\tk = len(t)\n(k, j) = (0, 0)\nfor (i, x) in enumerate(r):\n\tif len(x) > k:\n\t\t(k, j) = (len(x), i)\nprint(k)\nprint('\\n'.join(sorted(r[j])))\n", "(n, m) = map(int, input().split())\nnames = dict()\nind = dict()\nenemies = list()\nfor i in range(n):\n\tcur = input()\n\tnames[i] = cur\n\tind[cur] = i\n\tenemies.append(set())\nfor i in range(m):\n\t(nm1, nm2) = input().split()\n\tenemies[ind[nm1]].add(ind[nm2])\n\tenemies[ind[nm2]].add(ind[nm1])\nans = 0\nfor i in range(2 ** n):\n\tcur = set()\n\tfor j in range(n):\n\t\tif i & 1 << j:\n\t\t\tcur.add(j)\n\tf = True\n\tfor j in cur:\n\t\tfor jj in enemies[j]:\n\t\t\tif jj in cur:\n\t\t\t\tf = False\n\t\t\t\tbreak\n\t\tif not f:\n\t\t\tbreak\n\telse:\n\t\tif len(cur) > ans:\n\t\t\tans = len(cur)\n\t\t\tcurans = cur\nansarr = sorted([names[_] for _ in curans])\nprint(ans)\nfor i in ansarr:\n\tprint(i)\n", "def check(b):\n\tfor i in b:\n\t\tfor j in b:\n\t\t\tif (a[i], a[j]) in pair or (a[j], a[i]) in pair:\n\t\t\t\treturn False\n\treturn True\n(n, m) = map(int, input().split())\na = []\nind = {}\nfor i in range(n):\n\ta.append(input())\n\tind[a[-1]] = i\ngraph = [[] for i in range(n)]\npair = {}\nfor i in range(m):\n\t(x, y) = input().split()\n\tpair[x, y] = 1\n\tgraph[ind[x]].append(ind[y])\n\tgraph[ind[y]].append(ind[x])\nif m == 0:\n\tprint(n)\n\ta.sort()\n\tfor i in a:\n\t\tprint(i)\n\texit()\nans = 0\nstring = ''\nfor i in range(1, 2 ** n):\n\tb = bin(i)[2:]\n\tb = '0' * (n - len(b)) + b\n\ttemp = []\n\tfor j in range(n):\n\t\tif b[j] == '1':\n\t\t\ttemp.append(ind[a[j]])\n\tif check(temp):\n\t\tif len(temp) > ans:\n\t\t\tans = len(temp)\n\t\t\tstring = b\nprint(ans)\nansl = []\nfor i in range(n):\n\tif string[i] == '1':\n\t\tansl.append(a[i])\nansl.sort()\nfor i in ansl:\n\tprint(i)\n", "(n, m) = map(int, input().split())\nd1 = {}\nd2 = {}\narr = []\nfor i in range(n):\n\ts = input()\n\td1[s] = i\n\tarr.append([])\n\td2[i] = str(s)\nfor i in range(m):\n\t(a, b) = input().split()\n\tarr[d1[a]].append(d1[b])\n\tarr[d1[b]].append(d1[a])\nfrom copy import deepcopy\nans = []\n\ndef dp(n, i, f, e):\n\tglobal ans\n\tif i == n:\n\t\tif len(f) > len(ans):\n\t\t\tans = list(f)\n\t\treturn\n\tdp(n, i + 1, f, e)\n\tif i not in e:\n\t\tdp(n, i + 1, f + [i], e + arr[i])\ndp(n, 0, [], [])\nprint(len(ans))\nfor i in range(len(ans)):\n\tans[i] = d2[ans[i]]\nans.sort()\nfor i in ans:\n\tprint(i)\n", "import sys, math\n\ndef input():\n\treturn sys.stdin.readline().strip()\n\ndef iinput():\n\treturn int(input())\n\ndef tinput():\n\treturn input().split()\n\ndef rinput():\n\treturn map(int, tinput())\n\ndef rlinput():\n\treturn list(rinput())\n(n, m) = rinput()\nnames = []\nfor _ in range(n):\n\tnames.append(input())\npairs = []\nfor _ in range(m):\n\tpairs.append(list(input().split()))\ntotal_sets = int(math.pow(2, n))\nmax_set = []\nfor i in range(1, total_sets):\n\tcur_set = []\n\tfor j in range(n):\n\t\tif i & 1 << j:\n\t\t\tcur_set.append(names[j])\n\tfor p in pairs:\n\t\tif p[0] in cur_set and p[1] in cur_set:\n\t\t\tbreak\n\telse:\n\t\tif len(cur_set) > len(max_set):\n\t\t\tmax_set = cur_set\nmax_set.sort()\nprint(len(max_set))\nprint(*max_set, sep='\\n')\n", "import math\nfrom operator import itemgetter\nvar = input('')\nvar = var.split(' ')\nn = int(var[0])\nm = int(var[1])\nL = []\nfor i in range(n):\n\tname = input('')\n\tL.append(name)\nif m == 0:\n\tL.sort()\n\tprint(len(L))\n\tfor i in range(len(L)):\n\t\tprint(L[i])\nelse:\n\n\tdef diffc(A, B):\n\t\tL = []\n\t\tfor x in A:\n\t\t\tif x not in B:\n\t\t\t\tL.append(x)\n\t\treturn L\n\td = {}\n\tK = []\n\tL1 = []\n\tfor i in range(m):\n\t\tpair = input('')\n\t\tpair = pair.split(' ')\n\t\tK.append(pair)\n\t\tA = pair[0]\n\t\tB = pair[1]\n\t\tif A in d.keys():\n\t\t\td[A][0] += 1\n\t\t\td[A] += [B]\n\t\telse:\n\t\t\td[A] = [1, B]\n\t\tif B in d.keys():\n\t\t\td[B][0] += 1\n\t\t\td[B] += [A]\n\t\telse:\n\t\t\td[B] = [1, A]\n\tL1 = list(set(L) - set(list(d.keys())))\n\t(T, R, S, i) = (list(d.keys()), [], [], 0)\n\tfor x in T:\n\t\tR.append([x, diffc(T, [x] + d[x][1:])])\n\tfor y in R:\n\t\tfor f in y[len(y) - 1]:\n\t\t\tR += [y[:len(y) - 1] + [f] + [diffc(y[len(y) - 1], [f] + d[f][1:])]]\n\t\tif y[len(y) - 1] == []:\n\t\t\tif len(y[:len(y) - 1]) > i:\n\t\t\t\t(i, S) = (len(y[:len(y) - 1]), y[:len(y) - 1])\n\tL1 = L1 + S\n\tL1.sort()\n\tprint(len(L1))\n\tfor i in L1:\n\t\tprint(i)\n", "import sys\nfrom math import ceil, floor\nteam = []\nresult = []\nnok = [[0 for j in range(17)] for i in range(17)]\n\ndef check(x, sz):\n\tcomb = [0] * sz\n\tp = sz - 1\n\twhile x:\n\t\tcomb[p] = x & 1\n\t\tp -= 1\n\t\tx >>= 1\n\tfor i in range(sz):\n\t\tfor j in range(i + 1, sz):\n\t\t\tif comb[i] == 1 and comb[j] == 1 and (nok[i][j] == 1):\n\t\t\t\treturn\n\treturn comb\n\ndef main():\n\t(n, m) = [int(i) for i in input().split()]\n\tfor i in range(n):\n\t\tteam.append(input())\n\tfor i in range(m):\n\t\t(a, b) = [i for i in input().split()]\n\t\tu = team.index(a)\n\t\tv = team.index(b)\n\t\tnok[u][v] = 1\n\t\tnok[v][u] = 1\n\tmx = 1 << n\n\tfor k in range(mx):\n\t\tpossible = check(k, n)\n\t\tif possible != None:\n\t\t\tresult.append(possible)\n\tans = []\n\tcomb_ans = []\n\tln = -1\n\tfor comb in result:\n\t\tcnt = comb.count(1)\n\t\tif cnt > ln:\n\t\t\tln = cnt\n\t\t\tcomb_ans = comb\n\tprint(ln)\n\tfor num in range(len(comb)):\n\t\tif comb_ans[num] == 1:\n\t\t\tans.append(team[num])\n\tprint('\\n'.join(sorted(ans)))\nmain()\n", "def do():\n\t(n, m) = map(int, input().split(' '))\n\tban = []\n\tnames = []\n\tres = []\n\tfor _ in range(n):\n\t\tnames.append(input())\n\td = {name: i for (i, name) in enumerate(names)}\n\tfor _ in range(m):\n\t\t(x, y) = input().split(' ')\n\t\tban.append(1 << d[x] | 1 << d[y])\n\tfor state in range(1 << n):\n\t\tcan = True\n\t\tfor bs in ban:\n\t\t\tif state & bs == bs:\n\t\t\t\tcan = False\n\t\t\t\tbreak\n\t\tif can:\n\t\t\tres.append(state)\n\tif not res:\n\t\tprint(0)\n\t\treturn 0\n\tres.sort(key=lambda x: -bin(x).count('1'))\n\trt = []\n\tfor i in range(n):\n\t\tif res[0] & 1 << i:\n\t\t\trt.append(names[i])\n\trt.sort()\n\tprint(len(rt))\n\tfor w in rt:\n\t\tprint(w)\n\treturn 0\ndo()\n", "(cant_integrantes, cant_lleva_mal) = map(int, input().split(' '))\nintegrantes = []\nlleva_mal = []\nfor i in range(cant_integrantes):\n\tintegrantes.append(input())\nfor i in range(cant_lleva_mal):\n\t(n1, n2) = map(str, input().split(' '))\n\tlista = [n1, n2]\n\tlista.sort()\n\tlleva_mal.append(lista)\nif cant_lleva_mal == 0:\n\tintegrantes.sort()\n\tprint(cant_integrantes)\n\tfor nombre in integrantes:\n\t\tprint(nombre)\n\texit()\nbit = 1 << cant_integrantes\ntotal_combinaciones = []\nfor i in range(bit):\n\tcombinacion = []\n\tfor j in range(cant_integrantes):\n\t\tif 1 << j & i:\n\t\t\tcombinacion.append(integrantes[j])\n\tcombinacion.sort()\n\ttotal_combinaciones.append(tuple(combinacion))\ntotal_combinaciones.sort(key=len, reverse=True)\nfor tupla in total_combinaciones:\n\tflag = True\n\tfor (n1, n2) in lleva_mal:\n\t\tif n1 in tupla and n2 in tupla:\n\t\t\tflag = False\n\t\t\tbreak\n\tif flag:\n\t\tbreak\nprint(len(tupla))\nfor elemento in tupla:\n\tprint(elemento)\n", "global res, maxi\nres = []\nmaxi = 0\n\ndef check(op):\n\tglobal maxi, res\n\tflag = 1\n\tif len(op) > maxi:\n\t\td = {}\n\t\tfor i in op:\n\t\t\td[i] = None\n\t\tfor i in range(m):\n\t\t\tif v[i][0] in d and v[i][1] in d:\n\t\t\t\tflag = 0\n\t\t\t\tbreak\n\t\tif flag:\n\t\t\tmaxi = len(op)\n\t\t\tres = op\n\ndef func(ip, op):\n\tif len(ip) == 0:\n\t\tcheck(op)\n\t\treturn\n\top1 = op\n\top2 = op + [ip[-1]]\n\td = ip[:len(ip) - 1]\n\tfunc(d, op1)\n\tfunc(d, op2)\n(n, m) = map(int, input().split())\nc = []\nfor i in range(n):\n\tc.append(input())\nv = []\nfor i in range(m):\n\tv.append(list(map(str, input().split())))\nfunc(c, [])\nprint(maxi)\nres.sort()\nfor i in res:\n\tprint(i)\n", "(n, m) = map(int, input().split())\nnames = []\nfor i in range(n):\n\tnames.append(input())\nhate = []\nfor i in range(m):\n\thate.append(list(input().split()))\nans = set()\nfor x in range(1, (1 << n) + 1):\n\ta = set()\n\tfor i in range(n):\n\t\tif x & 1 << i:\n\t\t\ta.add(names[i])\n\tflag = True\n\tfor b in hate:\n\t\tif b[0] in a and b[1] in a:\n\t\t\tflag = False\n\t\t\tbreak\n\tif flag:\n\t\tif len(a) > len(ans):\n\t\t\tans = a\nprint(len(ans))\nprint(*sorted(list(ans)), sep='\\n')\n", "(n, m) = map(int, input().split())\nl = []\nfor i in range(n):\n\tl.append(input())\nc = []\nfor i in range(m):\n\t(s1, s2) = input().split()\n\tc.append([1 << l.index(s1), 1 << l.index(s2)])\nans = []\nfor i in range(1, 2 ** n):\n\tflag = 0\n\tfor k in c:\n\t\tif i & k[0] and i & k[1]:\n\t\t\tflag = 1\n\t\t\tbreak\n\tif flag:\n\t\tcontinue\n\tj = 0\n\tt = i\n\td = []\n\twhile t > 0:\n\t\tif t & 1:\n\t\t\td.append(l[j])\n\t\tj += 1\n\t\tt = t >> 1\n\tif len(ans) < len(d):\n\t\tans = d\nprint(len(ans))\nprint(*sorted(ans), sep='\\n')\n", "def s():\n\t[n, m] = list(map(int, input().split()))\n\ta = [input() for _ in range(n)]\n\tb = {input() for _ in range(m)}\n\tres = [[]]\n\taa = len(a) * [False]\n\n\tdef r(x=0):\n\t\tif x == n:\n\t\t\tp = [a[i] for i in range(n) if aa[i]]\n\t\t\tif len(p) <= len(res[0]):\n\t\t\t\treturn\n\t\t\tfor i in p:\n\t\t\t\tfor j in p:\n\t\t\t\t\tif i + ' ' + j in b or j + ' ' + i in b:\n\t\t\t\t\t\treturn\n\t\t\tres[0] = p\n\t\t\treturn x\n\t\telse:\n\t\t\taa[x] = True\n\t\t\tr(x + 1)\n\t\t\taa[x] = False\n\t\t\tr(x + 1)\n\tr()\n\tres = res[0]\n\tres.sort()\n\tprint(len(res))\n\tprint(*res, sep='\\n')\ns()\n"]
|
{"inputs": ["7 6\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice\nMariana\nAlena John\nAlena Alice\nOlya John\nOlya Alice\nVanya John\nVanya Alice\n", "7 6\nj\nZ\nPZNeTyY\nm\na\nUj\nsuaaSiKcK\nUj PZNeTyY\na j\nPZNeTyY Z\nPZNeTyY j\nm PZNeTyY\nm j\n", "15 3\na\nYclKFJoaIA\nhalYcB\nbLOlPzAeQ\ntckjt\noDFijpx\nb\npz\nVDLb\nlCEHPibt\noF\npzJD\nMC\nqklsX\nTAU\npzJD tckjt\nqklsX oF\nMC pzJD\n", "8 6\nU\nC\nPEElYwaxf\nVubTXNI\nJ\nIxZUHV\nhLNFnzmqFE\nDPPvwuWvmA\nhLNFnzmqFE IxZUHV\nIxZUHV C\nJ PEElYwaxf\nIxZUHV PEElYwaxf\nPEElYwaxf C\nJ VubTXNI\n", "2 0\nAndrey\nTaras\n", "4 2\nadQx\nrJGeodBycK\ntgPYZk\ncz\ncz tgPYZk\nrJGeodBycK adQx\n", "16 37\ntIWi\nq\nIEAYCq\nXozwkum\nCC\niPwfd\nS\nXEf\nWqEiwkH\nWX\ne\nltmruh\nKGx\nauTUYZRC\nmeJa\nM\nmeJa q\nKGx e\nXEf Xozwkum\ne q\nauTUYZRC KGx\ne CC\nM CC\nM meJa\nWX CC\nWqEiwkH IEAYCq\nauTUYZRC WqEiwkH\nKGx WX\nmeJa KGx\nXEf q\nauTUYZRC XEf\nauTUYZRC IEAYCq\nWX XEf\nM XEf\nWqEiwkH q\nM KGx\nKGx CC\nM e\nWqEiwkH Xozwkum\nCC q\nS Xozwkum\nKGx tIWi\nWX q\nXEf S\nauTUYZRC S\nCC IEAYCq\nKGx IEAYCq\ne WqEiwkH\nM S\nauTUYZRC q\nS tIWi\nM ltmruh\nM iPwfd\n", "16 11\ntulhZxeKgo\nbrAXY\nyQUkaihDAg\nmwjlDVaktK\nweVtBIP\nzRwb\nds\nhXPfJrL\nAdIfP\nazQeXn\nB\nJlmscIUOxO\nZuxr\nV\nOfyLIUO\nuaMl\nhXPfJrL yQUkaihDAg\nweVtBIP yQUkaihDAg\nazQeXn hXPfJrL\nV tulhZxeKgo\nzRwb yQUkaihDAg\nds mwjlDVaktK\nzRwb brAXY\nyQUkaihDAg brAXY\nB yQUkaihDAg\nAdIfP mwjlDVaktK\nbrAXY tulhZxeKgo\n", "6 1\nuPVIuLBuYM\nVejWyKCtbN\nqqjgF\nulBD\nDRNzxJU\nCOzbXWOt\nulBD qqjgF\n", "5 1\nWEYUdpYmZp\nfhNmMpjr\nydARivBg\ncilTtE\nyeXxkhPzB\nyeXxkhPzB cilTtE\n", "16 8\nJIo\nINanHVnP\nKaxyCBWt\nkVfnsz\nRAwFYCrSvI\nF\nvIEWWIvh\nTGF\nFeuhJJwJ\nTngcmS\nSqI\nRmcaVngp\neGwhme\nlwaFfXzM\noabGmpvVH\nTMT\nFeuhJJwJ F\neGwhme FeuhJJwJ\nRmcaVngp SqI\nINanHVnP JIo\nSqI FeuhJJwJ\nF kVfnsz\nTGF F\nTMT TGF\n", "15 8\ncXeOANpvBF\nbkeDfi\nnsEUAKNxQI\noSIb\naU\nXYXYVo\nduZQ\naPkr\nPVrHpL\nmVgmv\nhHhukllwbf\nGkNPGYVxjY\nbgBjA\nslNKCLIlOv\nmPILXy\nbgBjA cXeOANpvBF\nGkNPGYVxjY cXeOANpvBF\nslNKCLIlOv GkNPGYVxjY\nGkNPGYVxjY mVgmv\nXYXYVo cXeOANpvBF\nslNKCLIlOv bkeDfi\nmVgmv aPkr\nslNKCLIlOv nsEUAKNxQI\n", "8 12\nBkgxqAF\nKhq\nNpIfk\nkheqUyDVG\niRBkHlRpp\nZDaQY\nNG\nqN\nqN BkgxqAF\nNpIfk BkgxqAF\niRBkHlRpp BkgxqAF\niRBkHlRpp NpIfk\nNG Khq\niRBkHlRpp Khq\nNG ZDaQY\nNG iRBkHlRpp\nNG NpIfk\nqN Khq\nZDaQY kheqUyDVG\nNpIfk Khq\n", "7 12\nPasha\nLesha\nVanya\nTaras\nNikita\nSergey\nAndrey\nPasha Taras\nPasha Nikita\nPasha Andrey\nPasha Sergey\nLesha Taras\nLesha Nikita\nLesha Andrey\nLesha Sergey\nVanya Taras\nVanya Nikita\nVanya Andrey\nVanya Sergey\n", "3 0\nr\nyVwqs\nsdTDerOyhp\n", "7 14\nFXCT\nn\no\nS\nMdFuonu\nmszv\nbqScOCw\nS o\nbqScOCw FXCT\nMdFuonu o\no n\nbqScOCw n\nmszv S\nbqScOCw MdFuonu\nmszv n\nS FXCT\nbqScOCw o\no FXCT\nmszv MdFuonu\nmszv FXCT\nbqScOCw mszv\n", "9 6\nfLfek\nEQPcotnrp\nCaAlbwoIL\nVG\nNAZKIBiKT\noFy\njFluh\nKqHXRNya\nQSwgobA\noFy EQPcotnrp\nKqHXRNya jFluh\noFy NAZKIBiKT\njFluh oFy\njFluh fLfek\noFy fLfek\n", "16 0\nTaras\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nDenis\nEgor\nVadim\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice\n", "9 5\nRFiow\naxgvtiBGbx\ngGBVZtI\nVWAxrqx\nmnASVEQI\ntZHzWGAvXc\nBeaCYhIRLy\nhTdUL\nFJd\nhTdUL RFiow\nhTdUL gGBVZtI\nFJd axgvtiBGbx\nFJd BeaCYhIRLy\nhTdUL axgvtiBGbx\n", "5 2\niBrgNFlNXd\nlnGPIV\nnb\nB\nVgqRcEOG\nlnGPIV iBrgNFlNXd\nB iBrgNFlNXd\n", "2 1\ncLWdg\nGoWegdDRp\nGoWegdDRp cLWdg\n", "9 14\nmoRNeufngu\nBSKI\nzXl\ngwmIDluW\nYFn\nHvasEgl\nXcAC\neVP\nAiOm\neVP BSKI\neVP YFn\nHvasEgl YFn\neVP XcAC\nAiOm HvasEgl\nXcAC YFn\nzXl moRNeufngu\neVP zXl\nHvasEgl BSKI\nXcAC gwmIDluW\nXcAC HvasEgl\nYFn moRNeufngu\nzXl BSKI\nHvasEgl gwmIDluW\n", "12 12\njWuGgOjV\nWs\njTZQMyH\nULp\nUfsnPRt\nk\nbPKrnP\nW\nJOaQdgglDG\nAodc\ncpRjAUyYIW\nMrjB\nbPKrnP ULp\nk Ws\ncpRjAUyYIW k\nULp jTZQMyH\nbPKrnP jWuGgOjV\ncpRjAUyYIW jTZQMyH\nW ULp\nk jTZQMyH\nk ULp\nMrjB ULp\ncpRjAUyYIW Aodc\nW k\n", "16 25\nbBZ\nEr\nZ\nrYJmfZLgmx\nPaJNrF\naHtRqSxOO\nD\nhsagsG\nMDuBOXrmWH\nSgjMQZ\nYXgWq\nxDwpppG\nSDY\nJwZWx\ncOzrgrBaE\nFJYX\nYXgWq SgjMQZ\nSDY PaJNrF\nFJYX rYJmfZLgmx\nhsagsG Er\nxDwpppG rYJmfZLgmx\naHtRqSxOO rYJmfZLgmx\nhsagsG bBZ\nJwZWx hsagsG\nFJYX cOzrgrBaE\nSDY YXgWq\nFJYX Z\nJwZWx rYJmfZLgmx\nD rYJmfZLgmx\nYXgWq Z\nrYJmfZLgmx Z\naHtRqSxOO bBZ\nSDY rYJmfZLgmx\ncOzrgrBaE D\nYXgWq hsagsG\nSDY aHtRqSxOO\ncOzrgrBaE xDwpppG\nSDY bBZ\nSDY Er\nJwZWx xDwpppG\nFJYX JwZWx\n", "9 13\nYiUXqlBUx\nQNgYuX\ndPtyZ\nITtwRJCv\nLJ\nrAG\nOgxNq\nsitechE\nvVAAz\nOgxNq QNgYuX\nOgxNq dPtyZ\nsitechE rAG\nLJ QNgYuX\nQNgYuX YiUXqlBUx\nOgxNq LJ\nvVAAz OgxNq\nrAG dPtyZ\nvVAAz LJ\nvVAAz ITtwRJCv\nsitechE LJ\nrAG YiUXqlBUx\nsitechE QNgYuX\n", "3 3\nvRVatwL\nWmkUGiYEn\nuvvsXKXcJ\nWmkUGiYEn vRVatwL\nuvvsXKXcJ vRVatwL\nuvvsXKXcJ WmkUGiYEn\n", "11 13\ncZAMfd\nSWQnweM\nKlQW\nWRsnNZT\nix\nUC\nLWqsVHcWec\nfeb\ncBy\ntvk\nRXDlX\nfeb SWQnweM\ncBy WRsnNZT\nLWqsVHcWec KlQW\nRXDlX feb\nLWqsVHcWec cZAMfd\ncBy UC\nWRsnNZT SWQnweM\nRXDlX cBy\ntvk UC\ncBy SWQnweM\nUC KlQW\nRXDlX KlQW\nUC WRsnNZT\n", "2 0\nNgzlPJgFgz\nQfpagVpWz\n", "16 11\njA\nkyRNTE\neY\nToLcqN\nbnenhMxiK\nzlkOe\nXCKZ\neaQrds\nqUdInpi\nKgPQA\nmQIl\ninOCWEZHxy\nyA\nPIZRMOu\nXtueKFM\nfRNwNn\ninOCWEZHxy qUdInpi\nKgPQA zlkOe\ninOCWEZHxy KgPQA\nfRNwNn XCKZ\ninOCWEZHxy eY\nyA mQIl\ninOCWEZHxy ToLcqN\nyA KgPQA\nqUdInpi ToLcqN\nqUdInpi eaQrds\nPIZRMOu eY\n", "4 2\noVemoZhjW\nHspFEry\nhFO\njxt\nhFO HspFEry\njxt oVemoZhjW\n", "5 10\nTaras\nNikita\nSergey\nAndrey\nRomka\nTaras Romka\nTaras Nikita\nTaras Sergey\nTaras Andrey\nRomka Nikita\nRomka Sergey\nRomka Andrey\nNikita Sergey\nNikita Andrey\nSergey Andrey\n", "6 6\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice\nAlena John\nAlena Alice\nOlya John\nOlya Alice\nVanya John\nVanya Alice\n", "1 0\nPetr\n", "6 9\noySkmhCD\nUIKWj\nmHolKkBx\nQBikssqz\nZ\nzoFUJYa\nZ UIKWj\nQBikssqz oySkmhCD\nQBikssqz UIKWj\nZ oySkmhCD\nzoFUJYa UIKWj\nzoFUJYa Z\nzoFUJYa mHolKkBx\nzoFUJYa QBikssqz\nQBikssqz mHolKkBx\n", "11 17\njFTNgFBO\ntZDgmdF\nIjeDjoj\nBEMAaYkNb\nRZRQl\ntK\nlNHWt\nIdG\nLAbVLYiY\notOBsWqJuo\nUoTy\ntK BEMAaYkNb\nBEMAaYkNb jFTNgFBO\nIjeDjoj tZDgmdF\nRZRQl jFTNgFBO\nlNHWt tZDgmdF\nRZRQl tZDgmdF\nUoTy LAbVLYiY\nBEMAaYkNb IjeDjoj\nIdG BEMAaYkNb\nLAbVLYiY tK\nLAbVLYiY jFTNgFBO\nUoTy IjeDjoj\nlNHWt jFTNgFBO\nlNHWt BEMAaYkNb\ntK IjeDjoj\nUoTy RZRQl\nBEMAaYkNb tZDgmdF\n", "15 3\na\nYcJKFloaIA\nhalYcB\nbLOlPzAeQ\ntckjt\noDFijpx\nb\npz\nVDLb\nlCEHPibt\noF\npzJD\nMC\nqklsX\nTAU\npzJD tckjt\nqklsX oF\nMC pzJD\n", "2 0\nAndrey\nTar`s\n", "16 8\nJIo\nINanHVnP\nKaxyCBWt\nkVfnsz\nRAwFYCrSvI\nF\nvIEWWIvh\nTGF\nFeuhJJwJ\nSmcgnT\nSqI\nRmcaVngp\neGwhme\nlwaFfXzM\noabGmpvVH\nTMT\nFeuhJJwJ F\neGwhme FeuhJJwJ\nRmcaVngp SqI\nINanHVnP JIo\nSqI FeuhJJwJ\nF kVfnsz\nTGF F\nTMT TGF\n", "3 0\nr\nyVwqs\nphyOreDTds\n", "9 6\nfLfek\nEQPcotnrp\nCaAlbwoIL\nGV\nNAZKIBiKT\noFy\njFluh\nKqHXRNya\nQSwgobA\noFy EQPcotnrp\nKqHXRNya jFluh\noFy NAZKIBiKT\njFluh oFy\njFluh fLfek\noFy fLfek\n", "16 0\nTaras\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nDenis\nEgor\nVadim\nanelA\nOlya\nVanya\nBrus\nJohn\nAlice\n", "9 5\nRFiow\naxgvtiBGbx\ngGBVZtI\nVWAxrqx\nAnmSVEQI\ntZHzWGAvXc\nBeaCYhIRLy\nhTdUL\nFJd\nhTdUL RFiow\nhTdUL gGBVZtI\nFJd axgvtiBGbx\nFJd BeaCYhIRLy\nhTdUL axgvtiBGbx\n", "2 0\nNgzlPJzFgg\nQfpagVpWz\n", "1 0\nePtr\n", "2 0\nAodrey\nTar`s\n", "3 0\nr\nzVwqs\nsdTDerOyhp\n", "1 0\nrPte\n", "3 0\ns\nzVwqs\nsdTDerOyhp\n", "3 0\ns\nzVqws\nsdTDerOyhp\n", "3 0\ns\nzVqws\nrdTDesOyhp\n", "2 0\nAnerey\nTaras\n", "6 1\nuPVIuLBuYM\nVejWyKCtbN\nqqjgF\nulBD\nDRNzxJU\nCOzbXXOt\nulBD qqjgF\n", "3 0\ns\nyVwqs\nsdTDerOyhp\n", "16 0\nTaras\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nsineD\nEgor\nVadim\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice\n", "9 5\nRFiow\naxgvtiBGbx\ngGBVZtI\nVWBxrqx\nmnASVEQI\ntZHzWGAvXc\nBeaCYhIRLy\nhTdUL\nFJd\nhTdUL RFiow\nhTdUL gGBVZtI\nFJd axgvtiBGbx\nFJd BeaCYhIRLy\nhTdUL axgvtiBGbx\n", "3 2\nvRVatwL\nWmkUGiYEn\nuvvsXKXcJ\nWmkUGiYEn vRVatwL\nuvvsXKXcJ vRVatwL\nuvvsXKXcJ WmkUGiYEn\n", "6 6\nAlena\nOlya\nVanya\nBrvs\nJohn\nAlice\nAlena John\nAlena Alice\nOlya John\nOlya Alice\nVanya John\nVanya Alice\n", "1 0\nPdtr\n", "11 17\njFTNgFBO\ntZDgmdF\nIjeDjoj\nBEMAaYkNb\nRZRQl\ntK\nlNHWt\nIdG\nLAbVLYiY\notOBsWqJvo\nUoTy\ntK BEMAaYkNb\nBEMAaYkNb jFTNgFBO\nIjeDjoj tZDgmdF\nRZRQl jFTNgFBO\nlNHWt tZDgmdF\nRZRQl tZDgmdF\nUoTy LAbVLYiY\nBEMAaYkNb IjeDjoj\nIdG BEMAaYkNb\nLAbVLYiY tK\nLAbVLYiY jFTNgFBO\nUoTy IjeDjoj\nlNHWt jFTNgFBO\nlNHWt BEMAaYkNb\ntK IjeDjoj\nUoTy RZRQl\nBEMAaYkNb tZDgmdF\n", "3 0\nPasha\nLeshb\nVanya\n", "3 0\nr\nyVxqs\nphyOreDTds\n", "3 0\nTaras\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nDenis\nEgor\nVadim\nanelA\nOlya\nVanya\nBrus\nJohn\nAlice\n", "1 0\nrtPe\n", "2 0\nAodsey\nTar`s\n", "3 0\nr\nzVwqs\nphyOreDTds\n", "1 0\nrOte\n", "3 0\nt\nzVwqs\nsdTDerOyhp\n", "2 0\ns\nzVqws\nrdTDesOyhp\n", "2 0\nAnerey\nTarar\n", "6 1\nuPVIuLBuYM\nVejWyKCtbN\nqqjgF\nulBD\nDRNzxJU\nCOzbWXOt\nulBD qqjgF\n", "16 0\nTaras\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nsineD\nEgor\nVadim\nAlena\nOlya\nnaVya\nBrus\nJohn\nAlice\n", "1 0\nPdts\n", "3 0\nPasha\nbhseL\nVanya\n", "3 0\nr\nyVqxs\nphyOreDTds\n", "1 0\nrtPd\n", "3 0\nr\nzVwqs\nseTDdrOyhp\n", "1 0\nAnerey\nTarar\n", "16 0\nTaras\nNikita\nSergey\nyndreA\nRomka\nAlexey\nUra\nsineD\nEgor\nVadim\nAlena\nOlya\nnaVya\nBrus\nJohn\nAlice\n", "1 0\nPdss\n", "1 0\nPasha\nbhseL\nVanya\n", "3 0\nTar`s\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nDenis\nEgor\nVadim\nanelA\nOlya\naynaV\nBrus\nJohn\nAlice\n", "3 0\nq\nzVwqs\nseTDdrOyhp\n", "16 0\nTaras\nNikita\nSerfey\nyndreA\nRomka\nAlexey\nUra\nsineD\nEgor\nVadim\nAlena\nOlya\nnaVya\nBrus\nJohn\nAlice\n", "1 0\nPssd\n", "16 0\nTaras\nNikita\nSerfey\nyndreA\nRomka\nyexelA\nUra\nsineD\nEgor\nVadim\nAlena\nOlya\nnaVya\nBrus\nJohn\nAlice\n", "1 0\nsaPha\nbhseL\naynaV\n", "16 0\nTaras\nNikita\nSerfey\nAerdny\nRomka\nyexelA\nUra\nsineD\nEgor\nVadim\nAlena\nOlya\nnaVya\nBrus\nJohn\nAlice\n", "3 0\nTaras\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nDenis\nEgor\nVadim\nanelA\nOlya\naynaV\nBrus\nJohn\nAlice\n", "2 0\ns\nzVqws\nTdrDesOyhp\n", "1 0\nPasha\nbhseL\naynaV\n", "3 0\nTar`s\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nDenis\nEgor\nVadim\nanelA\nOlya\naynaV\nBrut\nJohn\nAlice\n", "3 0\nPasha\nLesha\nVanya\n", "3 1\nPetya\nVasya\nMasha\nPetya Vasya\n"], "outputs": ["5\nAlena\nBrus\nMariana\nOlya\nVanya\n", "5\nUj\nZ\na\nm\nsuaaSiKcK\n", "13\nMC\nTAU\nVDLb\nYclKFJoaIA\na\nb\nbLOlPzAeQ\nhalYcB\nlCEHPibt\noDFijpx\noF\npz\ntckjt\n", "5\nC\nDPPvwuWvmA\nU\nVubTXNI\nhLNFnzmqFE\n", "2\nAndrey\nTaras\n", "2\nadQx\ntgPYZk\n", "8\nIEAYCq\nWX\nXozwkum\ne\niPwfd\nltmruh\nmeJa\ntIWi\n", "11\nAdIfP\nB\nJlmscIUOxO\nOfyLIUO\nZuxr\nds\nhXPfJrL\ntulhZxeKgo\nuaMl\nweVtBIP\nzRwb\n", "5\nCOzbXWOt\nDRNzxJU\nVejWyKCtbN\nqqjgF\nuPVIuLBuYM\n", "4\nWEYUdpYmZp\ncilTtE\nfhNmMpjr\nydARivBg\n", "11\nFeuhJJwJ\nJIo\nKaxyCBWt\nRAwFYCrSvI\nRmcaVngp\nTGF\nTngcmS\nkVfnsz\nlwaFfXzM\noabGmpvVH\nvIEWWIvh\n", "12\nGkNPGYVxjY\nPVrHpL\nXYXYVo\naPkr\naU\nbgBjA\nbkeDfi\nduZQ\nhHhukllwbf\nmPILXy\nnsEUAKNxQI\noSIb\n", "3\nBkgxqAF\nKhq\nkheqUyDVG\n", "4\nAndrey\nNikita\nSergey\nTaras\n", "3\nr\nsdTDerOyhp\nyVwqs\n", "3\nFXCT\nMdFuonu\nn\n", "7\nCaAlbwoIL\nEQPcotnrp\nKqHXRNya\nNAZKIBiKT\nQSwgobA\nVG\nfLfek\n", "16\nAlena\nAlexey\nAlice\nAndrey\nBrus\nDenis\nEgor\nJohn\nNikita\nOlya\nRomka\nSergey\nTaras\nUra\nVadim\nVanya\n", "7\nBeaCYhIRLy\nRFiow\nVWAxrqx\naxgvtiBGbx\ngGBVZtI\nmnASVEQI\ntZHzWGAvXc\n", "4\nB\nVgqRcEOG\nlnGPIV\nnb\n", "1\ncLWdg\n", "4\nAiOm\nBSKI\ngwmIDluW\nmoRNeufngu\n", "8\nAodc\nJOaQdgglDG\nMrjB\nUfsnPRt\nW\nWs\njTZQMyH\njWuGgOjV\n", "8\nD\nEr\nMDuBOXrmWH\nPaJNrF\nSgjMQZ\nZ\nbBZ\nxDwpppG\n", "4\nITtwRJCv\nLJ\nYiUXqlBUx\ndPtyZ\n", "1\nvRVatwL\n", "6\nKlQW\nWRsnNZT\ncZAMfd\nfeb\nix\ntvk\n", "2\nNgzlPJgFgz\nQfpagVpWz\n", "10\nToLcqN\nXCKZ\nXtueKFM\nbnenhMxiK\neY\neaQrds\njA\nkyRNTE\nmQIl\nzlkOe\n", "2\nHspFEry\noVemoZhjW\n", "1\nTaras\n", "4\nAlena\nBrus\nOlya\nVanya\n", "1\nPetr\n", "3\nUIKWj\nmHolKkBx\noySkmhCD\n", "6\nIdG\nIjeDjoj\nLAbVLYiY\nRZRQl\nlNHWt\notOBsWqJuo\n", "13\nMC\nTAU\nVDLb\nYcJKFloaIA\na\nb\nbLOlPzAeQ\nhalYcB\nlCEHPibt\noDFijpx\noF\npz\ntckjt\n", "2\nAndrey\nTar`s\n", "11\nFeuhJJwJ\nJIo\nKaxyCBWt\nRAwFYCrSvI\nRmcaVngp\nSmcgnT\nTGF\nkVfnsz\nlwaFfXzM\noabGmpvVH\nvIEWWIvh\n", "3\nphyOreDTds\nr\nyVwqs\n", "7\nCaAlbwoIL\nEQPcotnrp\nGV\nKqHXRNya\nNAZKIBiKT\nQSwgobA\nfLfek\n", "16\nAlexey\nAlice\nAndrey\nBrus\nDenis\nEgor\nJohn\nNikita\nOlya\nRomka\nSergey\nTaras\nUra\nVadim\nVanya\nanelA\n", "7\nAnmSVEQI\nBeaCYhIRLy\nRFiow\nVWAxrqx\naxgvtiBGbx\ngGBVZtI\ntZHzWGAvXc\n", "2\nNgzlPJzFgg\nQfpagVpWz\n", "1\nePtr\n", "2\nAodrey\nTar`s\n", "3\nr\nsdTDerOyhp\nzVwqs\n", "1\nrPte\n", "3\ns\nsdTDerOyhp\nzVwqs\n", "3\ns\nsdTDerOyhp\nzVqws\n", "3\nrdTDesOyhp\ns\nzVqws\n", "2\nAnerey\nTaras\n", "5\nCOzbXXOt\nDRNzxJU\nVejWyKCtbN\nqqjgF\nuPVIuLBuYM\n", "3\ns\nsdTDerOyhp\nyVwqs\n", "16\nAlena\nAlexey\nAlice\nAndrey\nBrus\nEgor\nJohn\nNikita\nOlya\nRomka\nSergey\nTaras\nUra\nVadim\nVanya\nsineD\n", "7\nBeaCYhIRLy\nRFiow\nVWBxrqx\naxgvtiBGbx\ngGBVZtI\nmnASVEQI\ntZHzWGAvXc\n", "2\nWmkUGiYEn\nuvvsXKXcJ\n", "4\nAlena\nBrvs\nOlya\nVanya\n", "1\nPdtr\n", "6\nIdG\nIjeDjoj\nLAbVLYiY\nRZRQl\nlNHWt\notOBsWqJvo\n", "3\nLeshb\nPasha\nVanya\n", "3\nphyOreDTds\nr\nyVxqs\n", "3\nNikita\nSergey\nTaras\n", "1\nrtPe\n", "2\nAodsey\nTar`s\n", "3\nphyOreDTds\nr\nzVwqs\n", "1\nrOte\n", "3\nsdTDerOyhp\nt\nzVwqs\n", "2\ns\nzVqws\n", "2\nAnerey\nTarar\n", "5\nCOzbWXOt\nDRNzxJU\nVejWyKCtbN\nqqjgF\nuPVIuLBuYM\n", "16\nAlena\nAlexey\nAlice\nAndrey\nBrus\nEgor\nJohn\nNikita\nOlya\nRomka\nSergey\nTaras\nUra\nVadim\nnaVya\nsineD\n", "1\nPdts\n", "3\nPasha\nVanya\nbhseL\n", "3\nphyOreDTds\nr\nyVqxs\n", "1\nrtPd\n", "3\nr\nseTDdrOyhp\nzVwqs\n", "1\nAnerey\n", "16\nAlena\nAlexey\nAlice\nBrus\nEgor\nJohn\nNikita\nOlya\nRomka\nSergey\nTaras\nUra\nVadim\nnaVya\nsineD\nyndreA\n", "1\nPdss\n", "1\nPasha\n", "3\nNikita\nSergey\nTar`s\n", "3\nq\nseTDdrOyhp\nzVwqs\n", "16\nAlena\nAlexey\nAlice\nBrus\nEgor\nJohn\nNikita\nOlya\nRomka\nSerfey\nTaras\nUra\nVadim\nnaVya\nsineD\nyndreA\n", "1\nPssd\n", "16\nAlena\nAlice\nBrus\nEgor\nJohn\nNikita\nOlya\nRomka\nSerfey\nTaras\nUra\nVadim\nnaVya\nsineD\nyexelA\nyndreA\n", "1\nsaPha\n", "16\nAerdny\nAlena\nAlice\nBrus\nEgor\nJohn\nNikita\nOlya\nRomka\nSerfey\nTaras\nUra\nVadim\nnaVya\nsineD\nyexelA\n", "3\nNikita\nSergey\nTaras\n", "2\ns\nzVqws\n", "1\nPasha\n", "3\nNikita\nSergey\nTar`s\n", "3\nLesha\nPasha\nVanya\n", "2\nMasha\nPetya\n"]}
|
MEDIUM
|
['brute force', 'bitmasks', 'graphs']
| null |
codeforces
|
['Bit manipulation', 'Graph algorithms', 'Complete search']
|
['Bit manipulation', 'Complete search']
|
https://codeforces.com/problemset/problem/114/B
| null |
2.0 seconds
| null | null |
256.0 megabytes
| null |
|
"Consider sequences \\{A_1,...,A_N\\} of length N consisting of integers between 1 and K (inclusive)(...TRUNCATED)
| "[\"(N, K) = map(int, input().split())\\nD = [0] * (K + 1)\\nD[K] = 1\\nmod = 10 ** 9 + 7\\nfor i in(...TRUNCATED)
| "{\"inputs\": [\"3 2\\n\", \"3 200\\n\", \"100000 100000\\n\", \"2 1000\\n\", \"2 100000\\n\", \"2 1(...TRUNCATED)
|
MEDIUM
|
[]
|
AtCoder Beginner Contest 162 - Sum of gcd of Tuples (Hard)
|
atcoder
|
[]
|
[]
|
https://atcoder.jp/contests/abc162/tasks/abc162_e
| null |
2.0 seconds
| null | null |
1024.0 megabytes
| null |
|
"King Tle4Ever of Time Limit Exceeded has recently appointed Ram as his new cashier. To get this job(...TRUNCATED)
|
[]
|
{"inputs": [], "outputs": []}
|
MEDIUM
|
['Algorithms', 'Combinatorics']
|
computing-salary
|
hackerearth
|
['Combinatorics']
|
[]
| null | null | null | null | null | null | null |
|
"A gene is represented as a string of length $n$ (where $n$ is divisible by $4$), composed of the le(...TRUNCATED)
| "[\"def solve(S, n):\\n\\tcount = {}\\n\\tfor c in S:\\n\\t\\tcount[c] = count.get(c, 0) + 1\\n\\tfo(...TRUNCATED)
|
{"inputs": ["8 \nGAAATAAA\n"], "outputs": ["5\n"]}
|
MEDIUM
|
['Algorithms - Strings']
| null |
hackerrank
|
['String algorithms']
|
[]
|
https://www.hackerrank.com/challenges/bear-and-steady-gene/problem
| null | null | null |
0
| null | null |
|
"Little Elephant is playing a game with arrays. He is given an array A0, A1, ..., AN−1 of N intege(...TRUNCATED)
| "[\"n = int(input())\\na = list(map(int, input().split()))\\ncnt = {}\\nfor i in range(n):\\n\\tmn =(...TRUNCATED)
| "{\"inputs\": [[\"5\", \"4 1 2 3 4\", \"4\", \"3\", \"4\", \"6\", \"1\", \"\", \"\"], \"5\\n4 0 2 3 (...TRUNCATED)
|
MEDIUM
|
['Algorithms', 'Constructive', 'ad-hoc', 'Brute Force', 'Stacks', 'Data Structures']
| null |
codechef
|
['Complete search', 'Constructive algorithms', 'Data structures', 'Ad-hoc']
|
['Data structures', 'Complete search']
|
https://www.codechef.com/problems/SUBMIN
| null |
1 seconds
|
2014-01-03
|
0
|
50000 bytes
| null |
|
"There is a legendary tale about Dragon Balls on Planet X: if one collects seven Dragon Balls, the D(...TRUNCATED)
|
[]
| "{\"inputs\": [\"10 9\\n1 2 1\\n2 3 1\\n3 4 1\\n4 5 1\\n5 6 1\\n6 7 1\\n7 8 1\\n8 9 1\\n9 10 1\\n1 2(...TRUNCATED)
|
MEDIUM
|
[]
| null |
kattis
|
[]
|
[]
|
https://open.kattis.com/problems/dragonball1
| null | null | null | null | null | null |
|
"Silver Fox is fighting with N monsters.\nThe monsters are standing in a row, and we can assume them(...TRUNCATED)
| "[\"(n, d, a) = map(int, input().split())\\nxh = [list(map(int, input().split())) for _ in range(n)](...TRUNCATED)
| "{\"inputs\": [\"3 3 2\\n1 2\\n5 4\\n9 2\\n\", \"9 4 1\\n1 5\\n2 4\\n3 3\\n4 2\\n5 1\\n6 2\\n7 3\\n8(...TRUNCATED)
|
MEDIUM
|
[]
|
AtCoder Beginner Contest 153 - Silver Fox vs Monster
|
atcoder
|
[]
|
[]
|
https://atcoder.jp/contests/abc153/tasks/abc153_f
| null |
2.0 seconds
| null | null |
1024.0 megabytes
| null |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 18